Skip to main content
Log in

Generalized quasi-cyclic codes: structural properties and code construction

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract

Generalized quasi-cyclic (GQC) codes are defined by generator matrices comprised of circulant matrices of lengths not necessarily identical. A decomposition of these codes is given by using the Chinese reminder theorem. The focus is to characterize ρ-generator GQC codes in details. A good lower bound on the minimum distance of such a code in terms of the minimum distance of the constituent codes is given. Construction methods are given and a set of GQC codes is provided that from minimum distance perspective are optimal codes among the known linear codes having the same length and dimension.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Chen Z.: Six new binary quasi-cyclic codes. IEEE Trans. Inf. Theory 40, 1666–1667 (1994)

    Article  MATH  Google Scholar 

  2. Conan J., Seguin C.: Structural properties and enumeration of quasi-cyclic codes. AAECC 4, 25–39 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  3. Esmaeili M., Gulliver T.A., Secord N.P., Mahmoud S.A.: A link between quasi-cyclic codes and convolutional codes. IEEE Trans. Inf. Theory 44, 431–435 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  4. Gulliver T.A., Bhargava V.K.: Nine good rate (m − 1)/pm quasi-cyclic codes. IEEE Trans. Inf. Theory 38, 1366–1369 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  5. Gulliver T.A., Bhargava V.K.: Twelve good rat (mr)/pm quasi-cyclic codes. IEEE Trans. Inf. Theory. 39, 1750–1751 (1993)

    Article  MATH  Google Scholar 

  6. Gulliver T.A., Bhargava V.K.: New optimal binary linear codes of dimensions 9 and 10. IEEE Trans. Inf. Theory. 43, 314–316 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  7. Gulliver T.A., Bhargava V.K.: Some best rate 1/p and rate (p − 1)/p systematic quasi-cyclic codes. IEEE Trans. Inf. Theory. 37, 552–555 (1991)

    Article  MathSciNet  Google Scholar 

  8. Lally K., Fitzpatrick P.: Algebraic structure of quasi-cyclic codes. Discrete Appl. Math. 111, 157–175 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  9. Ling S., Solé P.: On the algebraic structure of quasi-cyclic codes I: finite fields. IEEE Trans. Inf. Theory. 47, 2751–2760 (2001)

    Article  MATH  Google Scholar 

  10. Ling S., Solé P.: On the algebraic structure of quasi-cyclic codes II: chain rings. Designs Codes Crypt. 30, 113–130 (2003)

    Article  MATH  Google Scholar 

  11. Ling S., Solé P.: On the algebraic structure of quasi-cyclic codes III: generator theory. IEEE Trans. Inf. Theory 51, 2692–2700 (2005)

    Article  Google Scholar 

  12. MacWilliams F.J., Sloane N.J.A.: The Theory of Error Correcting Codes. North-Holland, Amsterdam (1977)

    MATH  Google Scholar 

  13. Siap I., Kulhan N.: The structure of generalized quasi cyclic codes. Appl. Math. E-Notes. 5, 24–30 (2005)

    MATH  MathSciNet  Google Scholar 

  14. Solomon G., van Tilborg H.C.A.: A connection between block codes and convolutional codes. SIAM J. Appl. Math. 37, 358–369 (2004)

    Article  MathSciNet  Google Scholar 

  15. http://www.codetables.de/

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to M. Esmaeili.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Esmaeili, M., Yari, S. Generalized quasi-cyclic codes: structural properties and code construction. AAECC 20, 159–173 (2009). https://doi.org/10.1007/s00200-009-0095-3

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00200-009-0095-3

Keywords

Navigation