ON THE NORMALITY OF MULTIPLE COVERING CODES




HONKALA I

PublisherELSEVIER SCIENCE BV

1994

Discrete Mathematics

DISCRETE MATHEMATICS

DISCRETE MATH

125

1-3

229

239

11

0012-365X

DOIhttps://doi.org/10.1016/0012-365X(94)90164-3



A binary code C of length n is called a mu-fold r-covering if every binary word of length n is within Hamming distance r of at least mu codewords of C. The normality and the amalgamated direct sum (ADS) construction of 1-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 mu-fold r-coverings of length at least 2r + 1 and mu-fold normal.



Last updated on 2024-26-11 at 22:23