Sciweavers

91 search results - page 7 / 19
» Some Soft-Decision Decoding Algorithms for Reed-Solomon Code...
Sort
View
IACR
2011
141views more  IACR 2011»
14 years 3 months ago
Approximate common divisors via lattices
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
Henry Cohn, Nadia Heninger
152
Voted
TIT
2010
136views Education» more  TIT 2010»
14 years 10 months ago
The existence of concatenated codes list-decodable up to the hamming bound
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra
ACNS
2006
Springer
148views Cryptology» more  ACNS 2006»
15 years 7 months ago
An Efficient Single-Key Pirates Tracing Scheme Using Cover-Free Families
A cover-free family is a well-studied combinatorial structure that has many applications in computer science and cryptography. In this paper, we propose a new public key traitor t...
Dongvu Tonien, Reihaneh Safavi-Naini
138
Voted
CORR
2010
Springer
131views Education» more  CORR 2010»
15 years 2 months ago
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
Henry Cohn, Nadia Heninger
JSAC
2010
180views more  JSAC 2010»
14 years 10 months ago
List Decoding Techniques for Intersymbol Interference Channels Using Ordered Statistics
In this paper, we present a generalization of the ordered statistics decoding (OSD) techniques for the class of intersymbol interference (ISI) channels, and show decoding results f...
Fabian Lim, Aleksandar Kavcic, Marc P. C. Fossorie...