Skip to main content
SpringerLink
Log in

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

  • Algebraic Coding
  • Conference paper
  • First Online:
Book cover Information Theory and Applications II (CWIT 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1133))

Included in the following conference series:

Abstract

The class of quasi-cyclic (QC) codes has been proven to contain many good codes. In this paper, new rate 1/p QC codes over GF(5) are constructed using integer linear programming and heuristic combinatorial optimization. Many of these attain the maximum possible minimum distance for a linear code, and so are optimal. The others provide a lower bound on the maximum minimum distance. Power residue and self-dual QC codes are also presented.

This research was supported in part by the Natural Sciences and Engineering Research Council of Canada.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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

    Google Scholar 

  2. 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, 37 (1991) 552–555.

    Google Scholar 

  3. T.A. Gulliver and V.K. Bhargava, Some best rate 1/p and (p−1)/p quasi-cyclic codes over GF(3) and GF(4), IEEE Trans. Inform. Theory, 38 (1992) 1369–1374.

    Google Scholar 

  4. T. Kasami, A Gilbert-Varshamov bound for quasi-cyclic codes of rate 1/2, IEEE Trans. Inf. Theory 20 (1974) 679.

    Google Scholar 

  5. H.C.A. van Tilborg, On quasi-cyclic codes with rate 1/m, IEEE Trans. Inf. Theory, 24 (1978) 628–629.

    Google Scholar 

  6. G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization, New York: Wiley, 1988.

    Google Scholar 

  7. E.H.L. Aarts and P.J.M. van Laarhoven, Local search in coding theory, Discrete Math. 106/107 (1992) 11–18.

    Google Scholar 

  8. F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, New York: North-Holland Publishing Co., 1977.

    Google Scholar 

  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.

    Google Scholar 

  10. T.A. Gulliver, New optimal ternary linear codes, IEEE Trans. Inf. Theory, 41 (1995) 1182–1185.

    Google Scholar 

  11. G. Solomon and J.J. Stiffler, Algebraically punctured cyclic codes, Inf. and Control 8 (1965) 170–179.

    Google Scholar 

  12. C.L. Chen, W.W. Peterson, and E.J. Weldon, Jr., Some results on quasi-cyclic codes, Inf. and Control 15 (1969) 407–423.

    Google Scholar 

  13. T.A. Gulliver, M. Serra and V.K. Bhargava, The generation of primitive polynomials in GF(q) 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.

    Google Scholar 

  14. E.R. Berlekamp, Algebraic Coding Theory, New York: McGraw Hill, 1969.

    Google Scholar 

  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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Systems & Computer Engineering, Carleton University, 1125 Colonel By Dr., K1S 5B6, Ottawa, ON, Canada

    T. Aaron Gulliver

  2. Department of Electrical & Computer Engineering, University of Victoria, MS 8610, P.O. Box 3055, V8W 3P6, Victoria, BC, Canada

    Vijay K. Bhargava

Authors
  1. T. Aaron Gulliver
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vijay K. Bhargava
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jean-Yves Chouinard Paul Fortier T. Aaron Gulliver

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gulliver, T.A., Bhargava, V.K. (1996). Some best rate 1/p quasi-cyclic codes over GF(5). In: Chouinard, JY., Fortier, P., Gulliver, T.A. (eds) Information Theory and Applications II. CWIT 1995. Lecture Notes in Computer Science, vol 1133. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0025133

Download citation

  • DOI: https://doi.org/10.1007/BFb0025133

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61748-8

  • Online ISBN: 978-3-540-70647-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation