Journal ArticleDOI
Improved decoding of Reed-Solomon and algebraic-geometry codes
Venkatesan Guruswami,Madhu Sudan +1 more
TLDR
An improved list decoding algorithm for decoding Reed-Solomon codes and alternant codes and algebraic-geometry codes is presented and a solution to a weighted curve-fitting problem is presented, which may be of use in soft-decision decoding algorithms for Reed- Solomon codes.Abstract:
Given an error-correcting code over strings of length n and an arbitrary input string also of length n, the list decoding problem is that of finding all codewords within a specified Hamming distance from the input string. We present an improved list decoding algorithm for decoding Reed-Solomon codes. The list decoding problem for Reed-Solomon codes reduces to the following "curve-fitting" problem over a field F: given n points ((x/sub i//spl middot/y/sub i/))/sub i=1//sup n/, x/sub i/, y/sub i//spl isin/F, and a degree parameter k and error parameter e, find all univariate polynomials p of degree at most k such that y/sub i/=p(x/sub i/) for all but at most e values of i/spl isin/(1,...,n). We give an algorithm that solves this problem for e 1/3, where the result yields the first asymptotic improvement in four decades. The algorithm generalizes to solve the list decoding problem for other algebraic codes, specifically alternant codes (a class of codes including BCH codes) and algebraic-geometry codes. In both cases, we obtain a list decoding algorithm that corrects up to n-/spl radic/(n(n-d')) errors, where n is the block length and d' is the designed distance of the code. The improvement for the case of algebraic-geometry codes extends the methods of Shokrollahi and Wasserman (see in Proc. 29th Annu. ACM Symp. Theory of Computing, p.241-48, 1998) and improves upon their bound for every choice of n and d'. We also present some other consequences of our algorithm including a solution to a weighted curve-fitting problem, which may be of use in soft-decision decoding algorithms for Reed-Solomon codes.read more
Citations
More filters
Proceedings Article
Unidirectional key distribution across time and space with applications to RFID security
TL;DR: This work explores the problem of secret-key distribution in unidirectional channels, those in which a sender transmits information blindly to a receiver, and considers two approaches: via simultaneously emitted values that may follow different data paths and in temporally staggered emissions.
Journal ArticleDOI
Security Considerations in Minutiae-Based Fuzzy Vaults
TL;DR: The notion that a single finger is not sufficient to provide acceptable security is supported and implementations for multiple finger or even multiple modalities should be deployed the security of which may be improved by the technical contributions of this paper.
Proceedings ArticleDOI
Privacy-Aware Biometrics: Design and Implementation of a Multimodal Verification System
TL;DR: This work presents a biometric authentication technique that exploits multiple biometric traits and is privacy-aware as it ensures privacy protection and allows the extraction of secure identifiers by means of cryptographic primitives.
Posted Content
Explicit Capacity-Achieving List-Decodable Codes
Venkatesan Guruswami,Atri Rudra +1 more
TL;DR: This paper presented error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius for RS codes, which are called folded Reed-Solomon codes.
Posted Content
New List Decoding Algorithms for Reed-Solomon and BCH Codes
TL;DR: A rational curve fitting algorithm is devised and applied to the list decoding of Reed-Solomon and Bose-Chaudhuri-Hocquenghen codes and the resulting list decoding algorithms exhibit the following significant properties.
References
More filters
Book
The Theory of Error-Correcting Codes
TL;DR: This book presents an introduction to BCH Codes and Finite Fields, and methods for Combining Codes, and discusses self-dual Codes and Invariant Theory, as well as nonlinear Codes, Hadamard Matrices, Designs and the Golay Code.
Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Book
Algebraic Coding Theory
TL;DR: This is the revised edition of Berlekamp's famous book, "Algebraic Coding Theory," originally published in 1968, wherein he introduced several algorithms which have subsequently dominated engineering practice in this field.
Book
A Course in Computational Algebraic Number Theory
TL;DR: The first seven chapters guide readers to the heart of current research in computational algebraic number theory, including recent algorithms for computing class groups and units, as well as elliptic curve computations, while the last three chapters survey factoring and primality testing methods.
Book
Algebraic Function Fields and Codes
TL;DR: This new edition, published in the series Graduate Texts in Mathematics, has been considerably expanded and contains numerous exercises that help the reader to understand the basic material.