There Are Not Non-obvious Cyclic Affine-invariant Codes | SpringerLink
Skip to main content
Springer Nature Link
Log in

There Are Not Non-obvious Cyclic Affine-invariant Codes

  • Conference paper
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5527))

  • 856 Accesses

Abstract

We show that an affine-invariant code C of length p m is not permutation equivalent to a cyclic code except in the obvious cases: m = 1 or C is either {0}, the repetition code or its dual.

Research supported by D.G.I. of Spain and Fundación Séneca of Murcia.

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.

Similar content being viewed by others

References

  1. Berger, T.P., Charpin, P.: The Permutation group of affine-invariant extended cyclic codes. IEEE Trans. Inform. Theory 42, 2194–2209 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bernal, J.J., del Río, Á., Simón, J.J.: An intrinsical description of group codes. Designs, Codes, Cryptog. (to appear), doi:10.1007/s10623-008-9261-z

    Google Scholar 

  3. Charpin, P., Levy-Dit-Vehel, F.: On Self-dual affine-invariant codes, J. Comb. Theory, Series A 67, 223–244 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  4. Delsarte, P.: On cyclic codes that are invariant under the general linear group. IEEE Trans. Inform. Theory IT-16, 760–769 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  5. Hou, X.-D.: Enumeration of certain affine invariant extended cyclic codes. J. Comb. Theory, Series A 110, 71–95 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  6. Huffman, W.C.: Codes and groups. In: Pless, V.S., Huffman, W.C., Brualdi, R.A. (eds.) Handbook of coding theory, vol. II, pp. 1345–1440. North-Holland, Amsterdam (1998)

    Google Scholar 

  7. Kasami, T., Lin, S., Peterson, W.W.: Some results on cyclic codes which are invariant under the affine group and their applications. Information and Control 11, 475–496 (1967)

    Article  MathSciNet  MATH  Google Scholar 

  8. Kasami, T., Lin, S., Peterson, W.W.: New generalizations of the Reed-Muller codes part I: primitive codes. IEEE Trans. Inform. Theory IT-14, 189–199 (1968)

    Article  MATH  Google Scholar 

  9. Robinson, D.J.S.: A course in the theory of groups. Springer, Heidelberg (1996)

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Matemáticas, Universidad de Murcia, Spain

    José Joaquín Bernal, Ángel del Río & Juan Jacobo Simón

Authors
  1. José Joaquín Bernal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ángel del Río
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Juan Jacobo Simón
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Departament d’Enginyeria Informàtica i Matemàtiques, Universitat Rovira i Virgili, Avinguda Països Catalans, 26, 43007, Tarragona, Spain

    Maria Bras-Amorós

  2. Department of Mathematics, The Technical University of Denmark, Building 303, 2800, Lyngby, Denmark

    Tom Høholdt

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bernal, J.J., del Río, Á., Simón, J.J. (2009). There Are Not Non-obvious Cyclic Affine-invariant Codes. In: Bras-Amorós, M., Høholdt, T. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2009. Lecture Notes in Computer Science, vol 5527. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02181-7_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02181-7_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02180-0

  • Online ISBN: 978-3-642-02181-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics