Some combinatorial aspects of constructing bipartite-graph codes (Q1950398)
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 6162400
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some combinatorial aspects of constructing bipartite-graph codes |
scientific article; zbMATH DE number 6162400 |
Statements
Some combinatorial aspects of constructing bipartite-graph codes (English)
0 references
13 May 2013
0 references
low-density parity-check codes
0 references
LDPC codes
0 references
bipartite-graph codes
0 references
graphs without 4-cycles
0 references
configurations in combinatorics
0 references
projective and affine spaces
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8103821873664856
0 references
0.7732460498809814
0 references
0.766082763671875
0 references
0.7634270787239075
0 references
0.7572550773620605
0 references
