𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the normality of multiple covering codes

✍ Scribed by Iiro Honkala

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
778 KB
Volume
125
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

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 concepts of subnormality and normality to p-fold coverings and discuss how the ADS construction can be applied to them. In particular, we show that for r = 1,2 all binary linear p-fold r-coverings of length at least 2r+ 1 and n-fold normal.

πŸ“œ SIMILAR VOLUMES

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 the covering radius of cyclic linear
On the covering radius of cyclic linear codes and arithmetic codes
✍ Tor Helleseth πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 781 KB

The problem of finding the covering radius and minimum distance of algebraic and arithmetic codes is shown to be related to Waring's problem i n a finite field and to the theory of cyclotomic numbers. The methods devel oped l ead to new results for the covering radius of certain f-errorcorrecting BC

On the covering radius of Reed-Muller co
On the covering radius of Reed-Muller codes
✍ GΓ©rard D. Cohen; Simon N. Litsyn πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 371 KB

We present lower and upper bounds on the covering radius of Reed-Muller codes, yielding asymptotical improvements on known results. The lower bound is simply the sphere covering one (not very new). The upper bound is derived from a thorough use of a lemma, the 'essence of Reed-Mullerity'. The idea