60 search results - page 3 / 12 » Cryptographic Hardness Based on the Decoding of Reed-Solomon... |
VTC
2007
IEEE
14 years 12 hour ago
2007
IEEE
Provision of mobile broadband wireless access, for instance via high altitude platforms (HAPs) to the passengers on a high-speed train, requires the development of efficient and r...
STOC
2009
ACM
14 years 6 months ago
2009
ACM
Algebraic codes that achieve list decoding capacity were recently constructed by a careful "folding" of the Reed-Solomon code. The "low-degree" nature of this f...
ASIACRYPT
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between...
TCOM
2008
13 years 5 months ago
2008
This paper presents five methods for constructing nonbinary LDPC codes based on finite geometries. These methods result in five classes of nonbinary LDPC codes, one class of cyclic...
CISS
2007
IEEE
14 years 2 days ago
2007
IEEE
Abstract— This paper considers hybrid-ARQ under the constraints of noncoherent orthogonal modulation and hard-decision decoding. Information theoretic bounds on the throughput fo...