Designs, Codes and Cryptography

, Volume 58, Issue 1, pp 23–33

Quaternary 1-generator quasi-cyclic codes

Authors

    • Department of MathematicsSoochow University
  • Junying Pei
    • Department of MathematicsSoochow University
Article

DOI: 10.1007/s10623-010-9381-0

Cite this article as:
Cui, J. & Pei, J. Des. Codes Cryptogr. (2011) 58: 23. doi:10.1007/s10623-010-9381-0

Abstract

Quaternary 1-generator quasi-cyclic codes are considered in the paper. Under the conditions that n is odd and gcd(|2|n, m) = 1, where |2|n denotes the order of 2 modulo n, we give the enumeration of quaternary 1-generator quasi-cyclic codes of length mn, and describe an algorithm which will obtain one, and only one, generator for each quaternary 1-generator quasi-cyclic code.

Keywords

Quasi-cyclic codeAnnihilatorDirect sum decomposition

Mathematics Subject Classification (2000)

11T71

Copyright information

© Springer Science+Business Media, LLC 2010