Skip to main content
SpringerLink
Log in

New Quasi-cyclic Degenerate Linear Codes over GF(8)

  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

Abstract

Let [n, k, d] q code be a linear code of length n, dimension k, and minimum Hamming distance d over GF(q). One of the most important problems in coding theory is to construct codes with best possible minimum distances. Recently, quasi-cyclic (QC) codes were proved to contain many such codes. In this paper, twenty-five new codes over GF(8) are constructed, which improve the best known lower bounds on minimum distance.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. Greenough, P.P. and Hill, R., Optimal Ternary Quasi-cyclic Codes, Designs Codes Crypt., 1992, vol. 2, pp. 81–91.

    Google Scholar 

  2. Thomas, K., Polynomial Approach to Quasi-cyclic Codes, Bull. Calcutta Math. Soc., 1977, vol. 69, pp. 51–59.

    Google Scholar 

  3. Séguin, G.E. and Drolet, G., The Theory of 1-Generator Quasi-cyclic Codes, Tech. Report of Royal Military College of Canada, Kingston, 1991.

  4. Lally, K. and Fitzpatrick, P., Construction and Classification of Quasi-cyclic Codes, Proc. Int. Workshop on Coding and Cryptography (WCC'99), Paris, 1999, pp. 11–20.

  5. Kasami, T., A Gilbert Varshamov Bound for Quasi-cyclic Codes of Rate 1/2, IEEE Trans. Inf. Theory, 1974, vol. 20, no. 5, p. 679.

    Google Scholar 

  6. MacWilliams, F.J. and Sloane, N.J.A., The Theory of Error-Correcting Codes, Amsterdam: North-Holland, 1977. Translated under the title Teoriya kodov, ispravlyayushchikh oshibki, Moscow: Svyaz', 1979.

    Google Scholar 

  7. Brouwer, A.E., Linear Code Bounds [electronic table]. Available at www.win.tue.nl/~aeb/voorlincod.html

  8. Solomon, G. and van Tilborg, H.C.A., A Connection Between Block and Convolutional Codes, SIAM J. Appl. Math., 1979, vol. 37, no. 2, pp. 358–369.

    Google Scholar 

  9. Esmaeili, M., Gulliver, T.A., Secord N.P., and Mahmoud, S.A., A Link between Quasi-cyclic Codes and Convolutional Codes, IEEE Trans. Inf. Theory, 1998, vol. 44, no. 1, pp. 431–435.

    Google Scholar 

  10. Siap, I., Aydin, N., and Ray-Chaudhuri, D., New Ternary Quasi-cyclic Codes with Better Minimum Distances, IEEE Trans. Inf. Theory, 2000, vol. 46, no. 4, pp. 1554–1558.

    Google Scholar 

  11. Daskalov, R. and Hristov, P., New One-Generator Quasi-cyclic Codes over GF(7), Probl. Peredachi Inf., 2002, vol. 38, no. 1, pp. 59–63 [Probl. Inf. Trans. (Engl. Transl.), 2002, vol. 38, no. 1, pp. 50-54].

    Google Scholar 

  12. Kapralov, S.N., Hristov, P., and Bogdanova, G.T., The New Version of QLC―a Computer Program for Linear Codes Studying, in Proc. Int. Workshop on Optimal Codes and Related Topics, Sozopol, Bulgaria, 1995, pp. 11–14.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Technical University of Gabrovo, Bulgaria

    R. Daskalov & P. Hristov

Authors
  1. R. Daskalov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Hristov
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Daskalov, R., Hristov, P. New Quasi-cyclic Degenerate Linear Codes over GF(8). Problems of Information Transmission 39, 184–190 (2003). https://doi.org/10.1023/A:1025100305167

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1025100305167

Keywords

Search

Navigation