Lower bounds on achievable rates for limited bitshift correcting codes (Q4324115)
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: Lower bounds on achievable rates for limited bitshift correcting codes |
scientific article; zbMATH DE number 727123
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds on achievable rates for limited bitshift correcting codes |
scientific article; zbMATH DE number 727123 |
Statements
Lower bounds on achievable rates for limited bitshift correcting codes (English)
0 references
1 March 1995
0 references
lower bounds
0 references
bit-shift correcting codes
0 references
bitshift errors
0 references
Varshamov- Gilbert bound
0 references
Markov chains
0 references
limited codes
0 references
error-correction
0 references
bitshift distance
0 references
binary run length-limited codes
0 references
