A note on the decoding complexity of error-correcting codes (Q845843)
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: A note on the decoding complexity of error-correcting codes |
scientific article; zbMATH DE number 5664702
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on the decoding complexity of error-correcting codes |
scientific article; zbMATH DE number 5664702 |
Statements
A note on the decoding complexity of error-correcting codes (English)
0 references
29 January 2010
0 references
computational complexity
0 references
branching programs
0 references
error-correcting codes
0 references
0.7715361714363098
0 references
0.7577072381973267
0 references
0.7465546131134033
0 references
0.7432589530944824
0 references
