Article

Designs, Codes and Cryptography

, Volume 58, Issue 1, pp 23-33

Quaternary 1-generator quasi-cyclic codes

  • Jie CuiAffiliated withDepartment of Mathematics, Soochow University Email author 
  • , Junying PeiAffiliated withDepartment of Mathematics, Soochow University

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access

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 code Annihilator Direct sum decomposition

Mathematics Subject Classification (2000)

11T71