58 search results - page 1 / 12 » On Unique Decodability |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
In this paper, we propose a revisitation of the topic of unique decodability and of some fundamental theorems of lossless coding. It is widely believed that, for any discrete sourc...
CRYPTO
2009
Springer
13 years 11 months ago
2009
Springer
We prove the equivalence, up to a small polynomial approximation factor n/ log n, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and...
DCC
1999
IEEE
13 years 4 months ago
1999
IEEE
TCC
2005
Springer
13 years 10 months ago
2005
Springer
For computationally bounded adversarial models of error, we construct appealingly simple, efficient, cryptographic encoding and unique decoding schemes whose error-correction capab...
TIT
2010
12 years 11 months ago
2010
For adversarial but computationally bounded models of error, we construct appealingly simple and efficient cryptographic encoding and unique decoding schemes whose error-correctio...