181 search results - page 6 / 37 » On the Number of Errors Correctable with Codes on Graphs |
IOLTS
2008
IEEE
14 years 1 months ago
2008
IEEE
— Error correcting coding is the dominant technique to achieve acceptable soft-error rates in memory arrays. In many modern circuits, the number of memory elements in the random ...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
This paper presents a new decoding method inspired by Mitzenmacher’s idea of adding a different pseudo-random number to each packet, in a packet-symbol (n, k) code, for verificat...
STOC
1998
ACM
13 years 11 months ago
1998
ACM
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density parity-check codes. He suggests a natural decoding algorithm for these c...
EMSOFT
2009
Springer
14 years 1 months ago
2009
Springer
While NAND flash memories have rapidly increased in both capacity and performance and are increasingly used as a storage device in many embedded systems, their reliability has de...