𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On covering problems of codes

✍ Scribed by M. Frances; A. Litman

Book ID
110621110
Publisher
Springer
Year
1997
Tongue
English
Weight
265 KB
Volume
30
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On Covering Problems of Codes
On Covering Problems of Codes
✍ M. Frances; A. Litman πŸ“‚ Article πŸ“… 1997 πŸ› Springer 🌐 English βš– 100 KB
On lengthening of covering codes
On lengthening of covering codes
✍ Iiro Honkala πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 278 KB

Honkala, I., On lengthening of covering codes, Discrete Mathematics 106/107 (1992) 291-295. We study a construction method introduced by Kamps and van Lint and generalized by Blokhuis and Lam, and van Lint jr and show how the theorem of Cauchy and Davenport and other related results about finite fi

On Lower Bounds For Covering Codes
On Lower Bounds For Covering Codes
✍ M. C. Bhandari; K. K. P. Chanduka; A. K. Lal πŸ“‚ Article πŸ“… 1998 πŸ› Springer 🌐 English βš– 78 KB
On the normality of multiple covering co
On the normality of multiple covering codes
✍ Iiro Honkala πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 778 KB

A binary code C of length n is called a p-fold r-covering if every binary word of length n is within Hamming distance r of at least p codewords of C. The normality and the amalgamated direct sum (ADS) construction of l-fold coverings have been extensively studied. In this paper we generalize the con