Some best rate 1/p quasi-cyclic codes over GF(5)1

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1133, Issue , 1996, Pages 29-40

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

^a CARLETON UNIVERSITY   (Canada)

^b UNIVERSITY OF VICTORIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; INFORMATION THEORY; INTEGER PROGRAMMING; OPTIMAL SYSTEMS; OPTIMIZATION;

GOOD CODE; INTEGER LINEAR PROGRAMMING; LINEAR CODES; LOWER BOUNDS; MINIMUM DISTANCE; QUASICYCLIC CODES; SELF-DUAL;

CODES (SYMBOLS);

EID: 84955580989     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (15)

1. A. E. Brouwer, Tables of minimum-distance bounds for linear codes over GF(2), GF(3) and GF(4), lincodbd server, aeb@cwi.nl, Eindhoven University of Technology, Eindhoven, the Netherlands
2. T. A. Gulliver and V. K. Bhargava, Some best rate 1/p and rate (p—l)/p systematic quasi-cyclic codes, IEEE Trans. Inf. Theory, 37 (1991) 552-555.
3. T. A. Gulliver and V. K. Bhargava, Some best rate 1/p and (p — l)/p quasi-cyclic codes over GF(3) and GF(4), IEEE Trans. Inform. Theory, 38 (1992) 1369-1374.
4. T. Kasami, A Gilbert-Varshamov bound for quasi-cyclic codes of rate 1/2, IEEE Trans. Inf. Theory 20 (1974) 679.
5. H. C. A. van Tilborg, On quasi-cyclic codes with rate 1/m, IEEE Trans. Inf. Theory, 24 (1978) 628-629.
6. G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization, New York: Wiley, 1988.
7. E. H. L. Aarts and P. J. M. van Laarhoven, Local search in coding theory, Discrete Math. 106/107 (1992) 11-18.
8. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, New York: North-Holland Publishing Co., 1977.
9. G. E. Séguin and G. Drolet, The theory of 1-generator quasi-cyclic codes, preprint, Royal Military College of Canada, Kingston, ON, 1991.
10. T. A. Gulliver, New optimal ternary linear codes, IEEE Trans. Inf. Theory, 41 (1995) 1182-1185.
11. G. Solomon and J. J. Stiffler, Algebraically punctured cyclic codes, Inf. and Control 8 (1965) 170-179.
12. CL. Chen, W. W. Peterson, and E. J. Weldon, Jr., Some results on quasi-cyclic codes, Inf. and Control 15 (1969) 407-423.
13. T. A. Gulliver, M. Serra and V. K. Bhargava, The generation of primitive polynomials in GF(g) with independent roots and their applications for power residue codes, VLSI testing and finite field multipliers using normal basis, Int. J. Elect. 71 (1991) 559-576.
14. E. R. Berlekamp, Algebraic Coding Theory, New York: McGraw Hill, 1969.
15. J. S. Leon, V. Pless and N. J. A. Sloane, Self-dual codes over GF(5), J. Comb. Theory A 32 (1982) 178-194.