Minimum distance and pseudodistance lower bounds for generalised LDPC codes (Q622792)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5845413
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum distance and pseudodistance lower bounds for generalised LDPC codes |
scientific article; zbMATH DE number 5845413 |
Statements
Minimum distance and pseudodistance lower bounds for generalised LDPC codes (English)
0 references
4 February 2011
0 references
Summary: Two different ways of obtaining generalised low-density parity-check (LDPC) codes are considered. Lower bounds on the minimum distance, stopping distance and pseudodistance are derived for these codes using graph-based analysis. These bounds are generalisations of Tanner's bit- and parity-oriented bound for simple (LDPC) codes. The new bounds are useful in predicting the performance of generalised LDPC codes under maximum-likelihood decoding, graph-based iterative decoding and linear programming decoding, and rely on the connectivity of the Tanner graph.
0 references
low-density parity check codes
0 references
LDPC codes
0 references
generalised LDPC codes
0 references
tanner graph
0 references
bit-oriented bound
0 references
parity-oriented bound
0 references
constraint-oriented bound
0 references
iterative decoding
0 references
code graph
0 references
eigenvalues
0 references
minimum distance
0 references
stopping set
0 references
pseudoweight
0 references
pseudodistance
0 references
stopping distance
0 references
linear programming decoding
0 references
lower bounds
0 references
0.8534547686576843
0 references
0.8385070562362671
0 references
0.8378022313117981
0 references
0.8330077528953552
0 references
0.830090343952179
0 references
