DocumentCode
838836
Title
Polynomial Time Low-Density Parity-Check Codes With Rates Very Close to the Capacity of the 
-ary Random Deletion Channel for Large (1-epsi), the failure probability is n<sup>O(1/epsi2)</sup>/q, and the computational complexity for encoding and decoding is n<sup>O(1/epsi2)</sup>log q. We also extend these schemes to obtain the same results even if the undeleted symbols are also transposed arbitrarily, and if a sufficiently small number of random symbols are inserted</div></div>
</li>
<li class='list-group-item border-0 py-3 px-0'>
<div class='row g-0 align-items-center mb-2'><div class='col-12 col-md-3 fullRecLabelEnglish fw-bold mb-2 mb-md-0'><span class='text-muted small'>Keywords</span></div><div class='col-12 col-md-9 leftDirection leftAlign'>channel capacity; channel coding; decoding; parity check codes; probability; channel capacity; decoding; low-density parity-check codes; polynomial time; probability encoding; q-ary random deletion; Code standards; Computational complexity; Decoding; Information theory; Parity check codes; Robustness; Testing; <emphasis><formula formulatype=)
$q$ -ary symmetric channel; Deletion channel; low-density parity-check codes (LDPC); verification-based decoding;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.2006.885443
Filename
4016309
Link To Document