Skip to main content
SpringerLink
Log in

The algebraic structure of codes invariant under a permutation

  • Algebraic Coding
  • Conference paper
  • First Online:
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

In this paper, we develop the algebraic theory of q-ary linear codes invariant under the action of a permutation σ. We show that the structure of these σ-codes is very similar to that of cyclic codes. In particular, e determine how many such codes there are of length N. We further show that these codes can be very conveniently described using the concatenation function of Jensen which is a simple generalization of the trace description of irreducible cyclic codes.

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. N. Jacobson, Lectures in Abstract Algebra, Vol. II. D. Van Nostrand Co., 1953.

    Google Scholar 

  2. C.W. Curtis and I. Reiner, Representation Theory of Finite Groups and Associative Algebra, John Wiley and Sons, 1962.

    Google Scholar 

  3. G.E. Séguin and H.T. Huynh, “Quasi-Cyclic Codes: A Study”, report published by the Laboratoire de Radiocommunications et de Traitement du Signal, Université Laval, Québec, Canada, 1985.

    Google Scholar 

  4. J.M. Jensen, “On the Concatenated Structure of Cyclic and Abelian Codes”, IEEE Trans. Inform. Theory, Vol. 31, No. 6, pp. 788–793, Nov. 1985.

    Google Scholar 

  5. G. Drolet, “Sur les codes quasi-cycliques à base cyclique”, Thèse de Ph.D., Université Laval, Québec, Canada, 1990.

    Google Scholar 

  6. J. Conan and G.E. Séguin, “Structural Properties and Enumeration of Quasi-Cyclic Codes”, Applicable Algebra in Engineering, Communication and Computing, Vol. 4, pp. 25–39, 1993.

    Google Scholar 

  7. R.L. Townsend and E.J. Weldon, “Self-Orthogonal Quasi-cyclic Codes”, IEEE Trans. Inform. Theory, Vol. IT-13, No. 2, pp. 183–195, April 1967.

    Google Scholar 

  8. M. Karlin, “New Binary Coding Results by Circulants”, IEEE Trans. Inform. Theory, Vol. IT-15, No. 1, pp. 81–92, Jan. 1969.

    Google Scholar 

  9. C.L. Chen and W.W. Peterson, “Some Results on Quasi-Cyclic Codes”, Information and Control, Academic Press, Vol. 15, No. 5, pp. 407–423, Nov. 1969.

    Google Scholar 

  10. M. Karlin, “Decoding of Circulant Codes”, IEEE Trans. Inform. Theory, Vol. IT-16, No. 6, pp. 797–802, Nov. 1970.

    Google Scholar 

  11. T. Kasami, “A Gilbert-Varshamov Bound for Quasi-Cyclic Codes of Rate 1/2”, IEEE Trans. Inform. Theory, Vol. IT-20, No. 5, p. 679, Sept. 1974.

    Google Scholar 

  12. J.M. Stein, V.K. Bhargava and S.E. Tavares, “Weight Distribution of Some Best (3m, 2m) Binary Quasi-Cyclic Codes”, IEEE Trans. Inform. Theory, Vol. IT-21, No. 6, pp. 708–711, Nov. 1975.

    Google Scholar 

  13. T.A. Gulliver and V.K. Bhargava, “Two New Rate 2/p Binary Quasi-Cyclic Codes”, IEEE Trans. Inform. Theory, Vol. IT-40, No. 5, pp. 1667–1668, Sept. 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, Royal Military College of Canada, K7K 5L0, Kingston, Ontario, Canada

    Gérald E. Séguin

Authors
  1. Gérald E. Séguin
    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

Séguin, G.E. (1996). The algebraic structure of codes invariant under a permutation. 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/BFb0025131

Download citation

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

  • 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