In this paper we describe a new error-correcting code (ECC) inspired by the Naccache-Stern cryptosystem. While by far less efficient than Turbo codes, the proposed ECC happens to be more efficient than some established ECCs for certain sets of parameters. The new ECC adds an appendix to the message. The appendix is the modular product of small primes representing the message bits. The receiver recomputes the product and detects transmission errors using modular division and lattice reduction.
CITATION STYLE
Brier, E., Coron, J. S., Gèraud, R., Maimuţ, D., & Naccache, D. (2015). A number-theoretic error-correcting code. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9522, pp. 25–35). Springer Verlag. https://doi.org/10.1007/978-3-319-27179-8_2
Mendeley helps you to discover research relevant for your work.