Noisy Chinese remaindering in the Lee norm

Authors:
Igor E. Shparlinski;Ron Steinfeld
Affiliations:
Department of Computing, Macquarie University, Sydney, NSW 2109, Australia;Department of Computing, Macquarie University, Sydney, NSW 2109, Australia
Venue:
Journal of Complexity - Special issue on coding and cryptography
Year:
2004

Citing 15
Cited 3

A hierarchy of polynomial time lattice basis reduction algorithms

Theoretical Computer Science
Decoding of Reed Solomon codes beyond the error-correction bound

Journal of Complexity
Reconstructing Algebraic Functions from Mixed Data

SIAM Journal on Computing
Rounding in lattices and its cryptographic applications

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Sparse polynomial approximation in finite fields

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A sieve algorithm for the shortest lattice vector problem

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Ideal Error-Correcting Codes: Unifying Algebraic and Number-Theoretic Algorithms

AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey

Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
Lattice Reduction in Cryptology: An Update

ANTS-IV Proceedings of the 4th International Symposium on Algorithmic Number Theory
Finding smooth integers in short intervals using CRT decoding

Journal of Computer and System Sciences - Special issue on STOC 2000
"Soft-decision" decoding of Chinese remainder codes

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
List decoding of algebraic-geometric codes

IEEE Transactions on Information Theory
Improved decoding of Reed-Solomon and algebraic-geometry codes

IEEE Transactions on Information Theory
Chinese remaindering with errors

IEEE Transactions on Information Theory
A class of Sudan-decodable codes

IEEE Transactions on Information Theory

A robust Chinese remainder theorem with its applications in frequency estimation from undersampled waveforms

IEEE Transactions on Signal Processing
A closed-form robust chinese remainder theorem and its performance analysis

IEEE Transactions on Signal Processing
Lattice-based threshold-changeability for standard CRT secret-sharing schemes

Finite Fields and Their Applications

Quantified Score

Hi-index	0.02

Visualization

Abstract

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.