A recursive approach to low complexity codes (Q3931320)
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 3745089
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A recursive approach to low complexity codes |
scientific article; zbMATH DE number 3745089 |
Statements
A recursive approach to low complexity codes (English)
0 references
1981
0 references
constructing long error-correcting codes
0 references
subcodes
0 references
bipartite graph
0 references
encoders
0 references
decoders
0 references
decoding algorithms
0 references
probabilistic information
0 references
burst-error correction
0 references
0.8326951265335083
0 references
0.8311057686805725
0 references
0.8211696147918701
0 references
