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

New Lower Bounds of the Size of Error-Correcting Codes for theZ-Channel

โœ Scribed by V.P. Shilo

Book ID
110338283
Publisher
Springer US
Year
2002
Tongue
English
Weight
32 KB
Volume
38
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ 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

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 (

Lower bounds for codes correcting modera
Lower bounds for codes correcting moderate-density bursts of fixed length with Lee weight consideration
โœ Sapna Jain; Ki-Bong Nam ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 110 KB

Lee weight is more appropriate for some practical situations than Hamming weight as it takes into account magnitude of each digit of the word. In this paper, considering Lee weight, we obtain necessary lower bound over the number of parity checks to correct bursts of length b (fixed) whose weight li