Some Best Rate 1/p and Rate (p -1)/p Systematic Quasi-Cyclic Codes over GF(3) and GF(4)

IEEE Transactions on Information Theory

Volumn 38, Issue 4, 1992, Pages 1369-1374

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

^a CARLETON UNIVERSITY   (Canada)

^b UNIVERSITY OF VICTORIA   (Canada)

Author keywords

heuris ; integer linear programming; Quasi cyclic codes; tables of best codes over GF(3) and GF(4); tic search techniques

Indexed keywords

EID: 0000916411     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.144719     Document Type: Article

References (21)

1. T. A. Gulliver and V. K. Bhargava, “Some best rate 1/p and rate (p - l)/p systematic quasi-cyclic codes,” IEEE Trans. Inform. Theory, vol. 37. no. 3, pp. 552–555, May 1991.
2. E. F. Assmus, Jr. and H. F. Mattson, Jr., “On weights in quadratic residue codes,” Discrete Math., vol. 3, pp. 1–20, 1972.
3. V. Pless, “Symmetry codes over GF(3) and new 5-designs,” J. Combinat. Theory, vol. 12, pp. 119–142, 1972.
4. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam: North-Holland, 1977.
5. G. Solomon and H. C. A. van Tilborg, “A connection between block codes and convolutional codes,” SIAM J. Appl. Math., vol. 37, pp. 358–369, Oct. 1979.
6. H. C. A. van Tilborg, “On quasi-cyclic codes with rate 1/m,” IEEE Trans. Inform. Theory, vol. IT-24, pp. 628–629, Sept. 1978.
7. G. E. Seguin and G. Drolet, “The theory of 1-generator quasi-cyclic codes,” unpublished manuscript, Mar. 1991.
8. F. R. Kschischang and S. Pasupathy, “Some ternary and quaternary codes and associated sphere packings,” IEEE Trans. Inform. Theory vol. 38, pp. 227–246, Mar. 1992.
9. R. Hill and D. E Newton, “Optimal ternary linear codes,” to appear Designs, Codes and Cryptography.
10. P. P. Greenough and R. Hill, “Optimal linear codes over GF(4),” in Proc. 13th British Combinat. Conf., July 1991.
11. M. Hall, Jr., Combinatorial Theory. Waltham, MA: Blaisdell Publishing Co., 1967.
12. H. Luneberg, “On Dedekind numbers,” in Combinatorial Theory, Springer Lecture Notes in Math., no. 969, pp. 251–257, 1982.
13. G.L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization. New York: Wiley, 1988.
14. G. Solomon and J. J. Stiffler, “Algebraically punctured cyclic codes,” Inform. Contr., vol. 8, pp. 170–179, 1965.
15. A. A. Gamal, L. A. Hemachandra, I. Shperling, and V. K. Wei, “Using simulated annealing to design good codes,” IEEE Trans. Inform. Theory, vol. IT-33, pp. 116–123, Jan. 1987.
16. A. R. Calderbank and W. M. Kantor, “The geometry of two-weight codes,” Bull. Lon. Math. Soc., vol. 18, pp.97-122, 1986.
17. P. P. Greenough and R. Hill, “Optimal ternary quasi-cyclic codes,” to appear Designs, Codes and Cryptography.
18. C. L. Chen, W. W. Peterson, and E. J. Weldon, Jr., “Some results on quasi-cyclic codes,” Inform. Contr., vol. 15, pp. 407–423, 1969.
19. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw Hill, 1969.
20. E. F. Assmus, Jr. and H. F. Mattson, Jr., “Coding and combinatorics,” SIAM Rev., vol. 16, no. 4, pp. 349–388, 1974.
21. R. Hill, private communication, Apr. 1991.