Decoding of low-density codes with parity-check matrices composed of permutation matrices in an erasure channel (Q415651): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4091821 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5538637 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient erasure correcting codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4132387 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An analysis of the block error probability performance of iterative decoding / rank | |||
Normal rank |
Revision as of 03:44, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Decoding of low-density codes with parity-check matrices composed of permutation matrices in an erasure channel |
scientific article |
Statements
Decoding of low-density codes with parity-check matrices composed of permutation matrices in an erasure channel (English)
0 references
9 May 2012
0 references