Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs (Q3990791)
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 35620
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs |
scientific article; zbMATH DE number 35620 |
Statements
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs (English)
0 references
28 June 1992
0 references
independent sets
0 references
expanders
0 references
asymptotically good codes
0 references
Justesen codes
0 references
Zyablov bound
0 references
0.8050991892814636
0 references
