Skip to main content
SpringerLink
Log in

Repeated-Root Isodual Cyclic Codes over Finite Fields

  • Conference paper
Codes, Cryptology, and Information Security (C2SI 2015)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 9084))

Abstract

In this paper we give several constructions of cyclic codes over finite fields that are monomially equivalent to their dual, where the characteristic of the field divides the length of the code. These are called repeated-root cyclic isodual codes over finite fields. The constructions are based on the field characteristic, the generator polynomial and the length of the code.

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

Access this chapter

Log in via an institution
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. Bachoc, C., Gulliver, T.A., Harada, M.: Isodual codes over Z 2k and isodual lattices. J. Algebra. Combin. 12, 223–240 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  2. Batoul, A., Guenda, K., Gulliver, T.A.: On isodual cyclic codes over finite fields and finite chain rings: Monomial equivalence. CoRR abs/1303.1870 (2013)

    Google Scholar 

  3. Guenda, K.: New MDS self-dual codes over finite fields. Des., Codes, Crypt. 62(1), 31–42 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  4. Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge Univ. Press, New York (2003)

    Book  MATH  Google Scholar 

  5. Jia, Y., Ling, S., Xing, C.: On self-dual cyclic codes over finite fields. IEEE Trans. Inform. Theory 57(4), 2243–2251 (2011)

    Article  MathSciNet  Google Scholar 

  6. Jia, Y., Ling, S., Solé, P.: On isodual of cyclic codes over finite fields: Multiplier equivalence. Preprint

    Google Scholar 

  7. Smid, M.H.M.: Duadic codes. IEEE. Trans. Inform. Theory 33(3), 432–433 (1987)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics USTHB, University of Science and Technology of Algiers, Algiers, Algeria

    Aicha Batoul & Kenza Guenda

  2. Department of Electrical and Computer Engineering, University of Victoria, Victoria, BC, Canada

    T. Aaron Gulliver

Authors
  1. Aicha Batoul
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kenza Guenda
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. T. Aaron Gulliver
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Aicha Batoul .

Editor information

Editors and Affiliations

  1. University of Mohammed V, Rabat, Morocco

    Said El Hajji

  2. University of Caen, Caen, France

    Abderrahmane Nitaj

  3. LAGA,Universities of Paris 8 and Paris 13, Saint-Denis Cedex 02, France

    Claude Carlet

  4. University of Mohammed V, Rabat, Morocco

    El Mamoun Souidi

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Batoul, A., Guenda, K., Gulliver, T.A. (2015). Repeated-Root Isodual Cyclic Codes over Finite Fields. In: El Hajji, S., Nitaj, A., Carlet, C., Souidi, E. (eds) Codes, Cryptology, and Information Security. C2SI 2015. Lecture Notes in Computer Science(), vol 9084. Springer, Cham. https://doi.org/10.1007/978-3-319-18681-8_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-18681-8_10

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-18680-1

  • Online ISBN: 978-3-319-18681-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation