Noisy Chinese remaindering in the Lee norm

Igor E. Shparlinski*, Ron Steinfield

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

17 Citations (Scopus)


We use lattice reduction to obtain a polynomial time algorithm for recovering an integer (up to a small interval) from its residues modulo sufficiently many primes, when the residues are corrupted by a small additive noise bounded in the Lee norm. Our results are similar to those obtained for Hamming norm, but based on rather different arguments.

Original languageEnglish
Pages (from-to)423-437
Number of pages15
JournalJournal of Complexity
Issue number2-3
Publication statusPublished - Apr 2004


  • Chinese remaindering
  • Closets vector problem
  • Lattices


Dive into the research topics of 'Noisy Chinese remaindering in the Lee norm'. Together they form a unique fingerprint.

Cite this