𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Upper bounds on the size of error-correcting runlength-limited codes

✍ Scribed by Winick, Kim A. ;Yang, Shih-Hsuan

Publisher
John Wiley and Sons
Year
1996
Tongue
English
Weight
757 KB
Volume
7
Category
Article
ISSN
1124-318X

No coin nor oath required. For personal study only.

✦ Synopsis

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-correction control is often needed in order to obtain the desired system reliability. It is well-known that the error-correcting capability of a code is closely related to its distance properties. In this paper, asymptotic upper bounds for the maximum achievable rate of a runlength-limited code are derived as a function of the code's minimum Hamming distance.

πŸ“œ SIMILAR VOLUMES

Codes for perfectly correcting errors of
Codes for perfectly correcting errors of limited size
✍ Samira Saidi πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 749 KB

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 (

Upper Bounds on the Size of Obstructions
Upper Bounds on the Size of Obstructions and Intertwines
✍ Jens Lagergren πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 417 KB

We give an exponential upper bound in p 4 on the size of any obstruction for path-width at most p. We give a doubly exponential upper bound in k 5 on the size of any obstruction for tree-width at most k. We also give an upper bound on the size of any intertwine of two given trees T and T $. The boun

New upper bounds on the minimum size of
New upper bounds on the minimum size of covering designs
✍ Iliya Bluskov; Heikki HΓ€mΓ€lΓ€inen πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 310 KB πŸ‘ 1 views

Let D = {B1 , B2 , . . . , B b } be a finite family of k-subsets (called blocks) of a vset X(v) = {1, 2, . . . , v} (with elements called points). Then D is a (v, k, t) covering design or covering if every t-subset of X(v) is contained in at least one block of D. The number of blocks, b, is the size

General Upper Bounds on the Minimum Size
General Upper Bounds on the Minimum Size of Covering Designs
✍ Iliya Bluskov; Katherine Heinrich πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 105 KB

Let D be a finite family of k-subsets (called blocks) of a v-set X(v). Then D is a (v, k, t) covering design or covering if every t-subset of X(v) is contained in at least one block of D. The number of blocks is the size of the covering, and the minimum size of the covering is called the covering nu