Skip to main content

How to Know if a Linear Code Is a Group Code?

  • Conference paper
Book cover Coding Theory and Applications

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

  • 743 Accesses

Abstract

We present an intrinsecal characterization of when a linear code C is a (left) group code, i.e. the ambient space can be identified with a group algebra in which the standard basis is the group basis such that C is a (left) ideal in this group algebra. As application we obtain a class containing properly the class of metacyclic groups such that every group code is an abelian group code. We also use the characterization to describe all the possible group structures on some classes of generalized Reed-Solomon codes.

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

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bernal, J.J., del Río, Á., Simón, J.J.: An intrinsical description of group codes in preparation

    Google Scholar 

  2. Dür, A.: The automorphism groups of Reed-Solomon codes. J. Combin. Theory Ser. A. 44, 69–82 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  3. Evans Sabin, R., Lomonaco, S.J.: Metacyclic Error-Correcting Codes. AAECC 6, 191–210 (1995)

    Article  MATH  Google Scholar 

  4. 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 

  5. Landrock, P., Manz, O.: Classical codes as ideals in group algebras. Des. Codes Cryptogr. 2, 273–285 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  6. Kelarev, A.V., Solé, P.: Error-correcting codes as ideals in group rings. Abelian groups, rings and modules (Perth, 2000), Contemp. Math. 273, 11–18 (2001)

    Google Scholar 

  7. Phelps, K.T., Rifà, J.: On binary 1-perfect additive codes: Some structural properties. IEEE Trans. Inform. Theory 48, 2587–2592 (2002)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ángela Barbero

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bernal, J.J., del Río, Á., Simón, J.J. (2008). How to Know if a Linear Code Is a Group Code?. In: Barbero, Á. (eds) Coding Theory and Applications. Lecture Notes in Computer Science, vol 5228. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87448-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-87448-5_4

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-87448-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics