𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On covering sets and error-correcting codes

✍ Scribed by J.G Kalbfleisch; R.G Stanton; J.D Horton

Publisher
Elsevier Science
Year
1971
Tongue
English
Weight
811 KB
Volume
11
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Dominated error correcting codes with di
Dominated error correcting codes with distance two
✍ FeliΓΊ Sagols; Laura P. Riccio; Charles J. Colbourn πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 117 KB

## Abstract We study the hamiltonicity of certain graphs obtained from the hypercube as a means of producing a binary code of distance two and length __n__, whose codewords are ordered so that for each two consecutive codewords, one dominates the other. One vector __dominates__ the other, if and on

Upper bounds on the size of error-correc
Upper bounds on the size of error-correcting runlength-limited codes
✍ Winick, Kim A. ;Yang, Shih-Hsuan πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 757 KB

The maximum achievable rate of an error-correcting runlength-limited code is consid-ered. Runlength-limited codes find wide appIications in magnetic and optical recording, baseband. pulse transmission, and fiber optic communications. When a runlength-limited code is used on a noisy channel, error-co