Skip to main content
SpringerLink
Log in
Book cover

IMA International Conference on Cryptography and Coding

Cryptography and Coding 2001: Cryptography and Coding pp 128–137Cite as

Majority-Logic-Decodable Cyclic Arithmetic-Modular AN-Codes in 1, 2, and L Steps

  • Conference paper
  • First Online:

  • 808 Accesses

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

Abstract

We generalize to any base r ≥ 2 the Majority-Logic-Decodification Algorithms already considered for r = 2 by Chin-Long Chen, Robert T. Chien and Chao-Kai Liu [2]. The codes considered are generated by ϕn(r) where ϕn(x) is the nth-cyclotomic polynomial associated to the polynomial x n-1. Hong Decodification Algorithm [7] is also applicable to these codes, but achieves quite higher computational complexity.

All three authors are supported by Junta de Castilla y León project “Construcciones criptográficas basadas en códigos correctores”. Second one is also supported by Dgicyt PB97-0471.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D. Boneh, R.A. DeMillo, and R.J. Lipton. On the importance of eliminating errors in cryptographic computations. Journal of Cryptology, 14:101–119, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  2. C. L. Chen, R. T. Chien, and C. K. Liu. On majority-logic-decodable arithmetic codes. IEEE Trans. Information Theory, IT-19:678–682, 1973.

    Article  MathSciNet  Google Scholar 

  3. R. T. Chien, S. J. Hong, and F. P. Preparata. Some results in the theory of arithmetic codes. Information and Control, 19:246–264, 1971.

    Article  MathSciNet  MATH  Google Scholar 

  4. Joseph M. Diamond. Checking codes for digital computers. IRE, 1954.

    Google Scholar 

  5. Fco. Javier Galán-Simón. Pesos aritméticos y modulares en los códigos aritméticos. Master thesis, Facultad de Ciencias, Universidad de Valladolid, 1990.

    Google Scholar 

  6. Fco. Javier Galán-Simón. Detección y corrección de errores en códigos aritméticos y modulares. PhD thesis, Facultad de Ciencias, Universidad de Valladolid, 1993.

    Google Scholar 

  7. S. J. Hong On bounds and implementation of arithmetic codes, Procedings of National Electronics Cooference, R-437, Univ. of lllinois, Urbana. 1976.

    Google Scholar 

  8. Antoine Lobstein. On modular weights in arithmetic codes. In Coding theory and applications (Cachan, 1986), pages 56–67. Springer, Berlin, 1988.

    Google Scholar 

  9. Félix López Fernández-Asenjo and Juan Tena Ayuso. Introducción a la teoría de números primos. Universidad de Valladolid Instituto de Ciencias de la Educación, Valladolid, 1990.

    Google Scholar 

  10. T. R. N. Rao. Error coding for arithmetic processors. Academic Press, New York-London, 1974.

    MATH  Google Scholar 

  11. J. H. van Lint. Introduction to coding theory. Springer-Verlag, Berlin, 1999.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dpto. Organización y Gestión de Empresas, Universidad de Valladolid, 47002, Valladolid, Spain

    F. Javier Galán-Simón

  2. Dpto. Matemática Aplicada Fundamental, Universidad de Valladolid, 47002, Valladolid, Spain

    Edgar Martínez-Moro

  3. Dpto. Álgebra, Geometría y Topología, Universidad de Valladolid, 47002, Valladolid, Spain

    Juan G. Tena-Ayuso

Authors
  1. F. Javier Galán-Simón
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Edgar Martínez-Moro
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Juan G. Tena-Ayuso
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Applied Sciences, Department of Communication Systems, Lancaster University, LA1 4YR, Lancaster, UK

    Bahram Honary

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Galán-Simón, F.J., Martínez-Moro, E., Tena-Ayuso, J.G. (2001). Majority-Logic-Decodable Cyclic Arithmetic-Modular AN-Codes in 1, 2, and L Steps. In: Honary, B. (eds) Cryptography and Coding. Cryptography and Coding 2001. Lecture Notes in Computer Science, vol 2260. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45325-3_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-45325-3_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43026-1

  • Online ISBN: 978-3-540-45325-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation