Sciweavers

212 search results - page 1 / 43
» On the Locality of Codeword Symbols
Sort
View
CORR
2011
Springer
142views Education» more  CORR 2011»
14 years 1 months ago
On the Locality of Codeword Symbols
Consider a linear [n, k, d]q code C. We say that that i-th coordinate of C has locality r, if the value at this coordinate can be recovered from accessing some other r coordinates...
Parikshit Gopalan, Cheng Huang, Huseyin Simitci, S...
89
Voted
STOC
2009
ACM
224views Algorithms» more  STOC 2009»
15 years 10 months ago
3-query locally decodable codes of subexponential length
Locally Decodable Codes (LDC) allow one to decode any particular symbol of the input message by making a constant number of queries to a codeword, even if a constant fraction of t...
Klim Efremenko
ECCC
2007
88views more  ECCC 2007»
14 years 10 months ago
Combinatorial Construction of Locally Testable Codes
An error correcting code is said to be locally testable if there is a test that checks whether a given string is a codeword, or rather far from the code, by reading only a constan...
Or Meir
CORR
2008
Springer
120views Education» more  CORR 2008»
14 years 10 months ago
Codeword-Independent Performance of Nonbinary Linear Codes Under Linear-Programming and Sum-Product Decoding
A coded modulation system is considered in which nonbinary coded symbols are mapped directly to nonbinary modulation signals. It is proved that if the modulator-channel combination...
Mark F. Flanagan
CORR
2010
Springer
230views Education» more  CORR 2010»
14 years 6 months ago
Query-Efficient Locally Decodable Codes of Subexponential Length
A k-query locally decodable code (LDC) C : n N encodes each message x into a codeword C(x) such that each symbol of x can be probabilistically recovered by querying only k coordina...
Yeow Meng Chee, Tao Feng, San Ling, Huaxiong Wang,...