Exact lower bounds on the codelength of three-step permutation-decodable cyclic codes (Q4024561)
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 110464
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact lower bounds on the codelength of three-step permutation-decodable cyclic codes |
scientific article; zbMATH DE number 110464 |
Statements
Exact lower bounds on the codelength of three-step permutation-decodable cyclic codes (English)
0 references
4 February 1993
0 references
error trapping
0 references
lower bounds on codelength
0 references
permutation decodable binary cyclic codes
0 references
0.781761646270752
0 references
0.7480496764183044
0 references
0.7467443943023682
0 references
0.7342277765274048
0 references
