๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Codes for perfectly correcting errors of limited size

โœ Scribed by Samira Saidi

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
749 KB
Volume
118
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

Saidi S., Codes for perfectly correcting errors of limited size, Discrete Mathematics 118 (1993) 207-223.

In this paper we study an analogue of perfect codes: codes that perfectly correct errors of limited size, assuming that there is a bound on the number of these errors.

Stein's (m, n) crosses (or (m, n) semicrosses) [4,5].

๐Ÿ“œ SIMILAR VOLUMES

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