  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.
