67 search results - page 6 / 14 » Information-Set Decoding for Linear Codes over Fq |
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We design the first efficient algorithms and prove new combinatorial bounds for list decoding tensor products of codes and interleaved codes. ? We show that for every code, the rat...
VTC
2010
IEEE
13 years 5 months ago
2010
IEEE
— Systematic Luby Transform (SLT) codes constitute rateless codes, which are capable of adaptively adjusting their code rate depending on the channel quality without any explicit...
TIT
2002
13 years 7 months ago
2002
Multiple-antenna systems that operate at high rates require simple yet effective space-time transmission schemes to handle the large traffic volume in real time. At rates of tens ...
ICALP
2005
Springer
14 years 29 days ago
2005
Springer
We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding nbit strings over an ℓ-bit alphabet, where the decode...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Abstract--We investigate the structure of the polytope underlying the linear programming (LP) decoder introduced by Feldman, Karger, and Wainwright. We first show that for expander...