The construction of M-ary (d,∞) codes that achieve capacity and have the fewest number of encoder states (Q4340338)
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 1019225
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The construction of M-ary (d,∞) codes that achieve capacity and have the fewest number of encoder states |
scientific article; zbMATH DE number 1019225 |
Statements
The construction of M-ary (d,∞) codes that achieve capacity and have the fewest number of encoder states (English)
0 references
10 June 1997
0 references
constrained codes
0 references
run-length-limited codes
0 references
Shannon capacity
0 references
0.8745221495628357
0 references
0.8147878050804138
0 references
0.8125315308570862
0 references
