Skip to main content

On Decoding Hyperbolic Codes

  • Conference paper
  • First Online:
Arithmetic of Finite Fields (WAIFI 2024)

Abstract

This work studies several decoding algorithms for hyperbolic codes. We use some previous ideas to describe how to decode a hyperbolic code using the largest Reed-Muller code contained in it or using the smallest Reed-Muller code that contains it. A combination of these two algorithms is proposed when hyperbolic codes are defined by polynomials in two variables. Then, we compare hyperbolic codes and Cube codes (tensor product of Reed-Solomon codes) and propose decoding algorithms of hyperbolic codes based on their closest Cube codes. Finally, we adapt to hyperbolic codes the Geil and Matsumoto’s generalization of Sudan’s list decoding algorithm.

E. Camps-Moreno, H. H. López, E. Martínez-Moro and I. Márquez-Corbella were partially supported by Grant TED2021-130358B-I00 funded by MCIU/AEI/10.13039/501100011033 and by the “European Union NextGenerationEU/PRTR”.

H. H. López was partially supported by the NSF grants DMS-2201094 and DMS-2401558.

I. García-Marco and I. Márquez-Corbella were partially supported by the Spanish MICINN PID2019-105896GB-I00.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Berlekamp, E.: Nonbinary BCH decoding (abstr.). IEEE Trans. Inf. Theory 14(2), 242 (1968)

    Article  Google Scholar 

  2. Camps-Moreno, E., García-Marco, I., López, H.H., Márquez-Corbella, I., ínez-Moro, E.M., Sarmiento, E.: On the generalized Hamming weights of hyperbolic codes. J. Algebra Appl. 23(7), Paper No. 2550062 (2024)

    Google Scholar 

  3. Geil, O., Matsumoto, R.: Generalized Sudan’s list decoding for order domain codes. In: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. Lecture Notes in Computer Science, vol. 4851, pp. 50–59. Springer, Berlin (2007)

    Google Scholar 

  4. Sugiyama, Y., Kasahara, M., Hirasawa, S., Namekawa, T.: A method for solving key equation for decoding Goppa codes. Inf. Control 27, 87–99 (1975)

    Article  MathSciNet  Google Scholar 

  5. Wu, X.-W.: An algorithm for finding the roots of the polynomials over order domains. In: Proceedings IEEE International Symposium on Information Theory, p. 202 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Edgar Martínez-Moro .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2025 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Camps-Moreno, E., García-Marco, I., López, H.H., Márquez-Corbella, I., Martínez-Moro, E., Sarmiento, E. (2025). On Decoding Hyperbolic Codes. In: Petkova-Nikova, S., Panario, D. (eds) Arithmetic of Finite Fields. WAIFI 2024. Lecture Notes in Computer Science, vol 15176. Springer, Cham. https://doi.org/10.1007/978-3-031-81824-0_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-81824-0_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-81823-3

  • Online ISBN: 978-3-031-81824-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics