212 search results - page 4 / 43 » On the Locality of Codeword Symbols |
CORR
2008
Springer
13 years 8 months ago
2008
Springer
This paper presents new lower and upper bounds for the optimal compression of binary prefix codes in terms of the most probable input symbol, where compression efficiency is determ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Because each golden code codeword conveys four information symbols from an -ary QAM alphabet, the complexity of an exhaustive-search decoder is proportional to 4 . In this paper we...
COCO
2009
Springer
14 years 3 months ago
2009
Springer
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
APPROX
2005
Springer
14 years 2 months ago
2005
Springer
An error-correcting code is said to be locally testable if it has an efficient spot-checking procedure that can distinguish codewords from strings that are far from every codeword...
SPIRE
2009
Springer
14 years 3 months ago
2009
Springer
We introduce a symbol reordering technique that implicitly synchronizes variable-length codes, such that it is possible to directly access the i-th codeword without need of any sam...