New good rate (m-1)/pm ternary and quaternary quasi-cyclic codes

Designs, Codes, and Cryptography

Volumn 7, Issue 3, 1996, Pages 223-233

  Gulliver, T Aaron ^a   Bhargava, Vijay K ^b  

^a CARLETON UNIVERSITY   (Canada)

^b UNIVERSITY OF VICTORIA   (Canada)

Author keywords

Heuristic search; Integer linear programming; Linear codes over GF(3) and GF(4); Quasi cyclic codes

Indexed keywords

EID: 0009349982     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1018090707115     Document Type: Article

References (21)

1. E. H. L. Aarts and P. J. M. van Laarhoven, Local search in coding theory, Discrete Math., Vol. 106/107 (1992) pp. 11-18.
2. A. E. Brouwer, Table of minimum-distance bounds for linear codes over GF(3) and GF(4), lincodbd server, aeb@cwi.nl, Eindhoven University of Technology, Eindhoven, the Netherlands (1993),
3. R. N. Daskalov, R. Hill and P. Lizak, Tables of bounds on linear codes over GF(3) and GF(4), Technical University, Gabrovo, Bulgaria (1992).
4. H. Fredricksen and J. Maiorana, Necklaces of beads in k colors and k-ary de Bruijn sequences, Discrete Math., Vol. 23 (1978) pp. 207-210.
5. R. G. Gallager, The random coding bound is tight for the average code, IEEE Trans. Inf. Theory, Vol. IT-19 (1973) pp. 244-246.
6. P. P. Greenough and R. Hill, Optimal ternary quasi-cyclic codes, Designs, Codes and Cryptography, Vol. 2 (1992) pp. 81-91.
7. T. A. Gulliver and V. K. Bhargava, Some best rate 1/p and rate (p - 1)/p systematic quasi-cyclic codes, IEEE Trans. Inf. Theory, Vol. IT-37 (1991) pp. 552-555.
8. 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. Inf. Theory, Vol. IT-38 (1992) pp. 1369-1374.
9. T. A. Gulliver and V. K. Bhargava, Nine good rate (m - 1)/pm quasi-cyclic codes, IEEE Trans. Inf. Theory, Vol. IT-38 (1992) pp. 1366-1369.
10. T. A. Gulliver and V. K. Bhargava, V.K. Twelve good rate (m - r)/pm quasi-cyclic codes, IEEE Trans. Inf. Theory, Vol. IT-39 (1993).
11. M. Hall, Jr., Combinatorial Theory, Blaisdell Publishing Co., Waltham, MA (1967).
12. A. A. Hashim and A. G. Constantinides, Some new results on binary linear block codes, Electronics Letters, Vol. 10 (1974) pp. 31-33.
13. A. A. Hashim and V S. Pozdniakov, Computerized search for linear binary codes, Electronics Letters, Vol. 12 (1976) pp. 350-351.
14. T. Kasami, A Gilbert-Varshamov bound for quasi-cyclic codes of rate 1/2, IEEE Trans. Inf. Theory, Vol. IT-20 (1974) pp. 679.
15. F. R. Kschischang and S. Pasupathy, Some ternary and quaternary codes and associated sphere packings, IEEE Trans. Inf. Theory, Vol. IT-38 (1992) pp. 227-246.
16. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland Publishing Co., New York (1977)
17. J. N. Pierce, Limit distribution of the minimum distance of random linear codes, IEEE Trans. Inf. Theory, Vol. IT-13 (1967) pp. 595-599.
18. G. E. Séguin and G. Drolet, The Theory of I-Generator Quasi-Cyclic Codes, Royal Military College of Canada. Kingston. ON (1991).
19. N. J. A. Sloane, Tables of lower bounds on dmax(n,k) for linear codes overfields of order 3 and 4, to appear in V. Pless, et al., The Handbook of Coding Theory.
20. G. Solomon and J. J. Stiffler, Algebraically punctured cyclic codes, Inf. and Contr., Vol. 8 (1965) pp. 170-170.
21. H. C. A. van Tilborg, On quasi-cyclic codes with rate 1/m. IEEE Trans. Inf. Theory, Vol. IT-24 (1978) pp. 628-629.