New good quasi-cyclic ternary and quaternary linear codes

IEEE Transactions on Information Theory

Volumn 43, Issue 5, 1997, Pages 1647-1650

  Daskalov, Rumen N ^a,b   Gulliver, T Aaron ^a,c,d  

^a IEEE   (Bulgaria)

^b TECHNICAL UNIVERSITY OF GABROVO   (Bulgaria)

^c CARLETON UNIVERSITY   (Canada)

^d UNIVERSITY OF CANTERBURY   (New Zealand)

Author keywords

Quasi cyclic codes; Ternary and quaternary linear codes

Indexed keywords

ALGEBRA; MATRIX ALGEBRA; POLYNOMIALS;

HAMMING DISTANCE; LOWER BOUNDS; QUASI CYCLIC CODES; QUATERNARY LINEAR CODES;

CODES (SYMBOLS);

EID: 0031233344     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.623167     Document Type: Article

References (8)

1. I. G. Boukliev, "New bounds for the minimum length of quaternary linear codes of dimension five," Discr. Math., to be published.
2. A. E. Brouwer, "Tables of minimum-distance bounds for linear codes over GF(3) and GF(4)," [Online], Available e-mail: lincodbd server, aeb@cwi.nl, Eindhoven University of Technology, Eindhoven, The Netherlands.
3. Z. Chen, "Six new binary quasi-cyclic codes," IEEE Trans. Inform. Theory, vol. 40, pp. 1666-1667, 1994.
4. P. P. Greenough and R. Hill, "Optimal ternary quasi-cyclic codes," Des., Codes and Cryptogr., vol. 2, pp. 81-91, 1992.
5. _, "Optimal linear codes over GF (4)," Discr. Math., vol. 125, pp. 187-199, 1994.
6. T. A. Gulliver and V. K. Bhargava, "Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes over GF(3) and GF(4),"IEEE Trans. Inform. Theory, vol. 38, pp. 1369-1375, 1992.
7. _, "New good rate (m-1)/pm ternary and quaternary quasi-cyclic codes," Des., Codes and Cryptogr., vol. 7, pp. 223-233, 1996.
8. F. J. Mac Williams and N. J. A. Sloane, The Theory of Error-Correcting Codes. New York: North-Holland, 1977.