Sciweavers

77 search results - page 5 / 16
» Near-MDS codes over some small fields
Sort
View
STOC
2009
ACM
161views Algorithms» more  STOC 2009»
14 years 9 months ago
List decoding tensor products and interleaved codes
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...
Parikshit Gopalan, Venkatesan Guruswami, Prasad Ra...
ECCC
2006
120views more  ECCC 2006»
13 years 8 months ago
New Locally Decodable Codes and Private Information Retrieval Schemes
A q query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
CORR
2010
Springer
75views Education» more  CORR 2010»
13 years 6 months ago
Dense Error-Correcting Codes in the Lee Metric
Several new applications and a number of new mathematical techniques have increased the research on errorcorrecting codes in the Lee metric in the last decade. In this work we cons...
Tuvi Etzion, Alexander Vardy, Eitan Yaakobi
CORR
2006
Springer
132views Education» more  CORR 2006»
13 years 8 months ago
A Decomposition Theory for Binary Linear Codes
The decomposition theory of matroids initiated by Paul Seymour in the 1980's has had an enormous impact on research in matroid theory. This theory, when applied to matrices ov...
Navin Kashyap
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 8 months ago
Distributed Source Coding using Abelian Group Codes
In this work, we consider a distributed source coding problem with a joint distortion criterion depending on the sources and the reconstruction. This includes as a special case the...
Dinesh Krithivasan, S. Sandeep Pradhan