"Soft-decision" decoding of Chinese remainder codes

Authors:
V. Guruswami;A. Sahai;M. Sudan
Affiliations:
-;-;-
Venue:
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Year:
2000

Citing 0
Cited 10

Limits to list decodability of linear codes

STOC '02 Proceedings of the thiry-fourth 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
Constructions of Codes from Number Fields

AAECC-14 Proceedings of the 14th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Finding smooth integers in short intervals using CRT decoding

Journal of Computer and System Sciences - Special issue on STOC 2000
The security of all RSA and discrete log bits

Journal of the ACM (JACM)
Noisy Chinese remaindering in the Lee norm

Journal of Complexity - Special issue on coding and cryptography
Algorithmic results in list decoding

Foundations and Trends® in Theoretical Computer Science
Output-sensitive decoding for redundant residue systems

Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
A closed-form robust chinese remainder theorem and its performance analysis

IEEE Transactions on Signal Processing
High-rate codes with sublinear-time decoding

Proceedings of the forty-third annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

For any positive integers r and n, let H(r,n) denote the family of graphs on n vertices with maximum degree r, and let H(r,n,n) denote the family of bipartite graphs H on 2n vertices with n vertices in each vertex class, and with maximum degree r. On ...