Pseudocodeword-free criterion for codes with cycle-free Tanner graph (Q1801093)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Pseudocodeword-free criterion for codes with cycle-free Tanner graph |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Pseudocodeword-free criterion for codes with cycle-free Tanner graph |
scientific article |
Statements
Pseudocodeword-free criterion for codes with cycle-free Tanner graph (English)
0 references
26 October 2018
0 references
iterative decoding
0 references
linear programming decoding
0 references
low-density parity-check (LDPC) code
0 references
Tanner graphs
0 references
pseudocodewords
0 references
0 references
0 references
0.833097517490387
0 references
0.7994755506515503
0 references
0.7883550524711609
0 references
