On the normality of multiple covering codes
type: Item
instance of: scholarly article
title: On the normality of multiple covering codes
zbMATH Open document ID: 0799.94012
DOI: 10.1016/0012-365X(94)90164-3
published in: Discrete Mathematics
publication date: 1994-11-22T00:00:00Z
review text: 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 author generalizes the concepts of subnormality and normality to \(\mu\)-fold coverings. He also shows how the ADS (amalgamated direct sum) construction can be applied to them. The author proves that for \(r=1,2\) all binary linear \(\mu\)-fold \(r\)-coverings of length at least \(2r+1\) are \(\mu\)-fold normal.
Mathematics Subject Classification ID: 94B75
zbMATH DE Number: 562667
zbMATH Keywords: multiple covering codes
zbMATH Keywords: subnormality
zbMATH Keywords: normality
author: Iiro Honkala
MaRDI profile type: Publication
cites work: Covering radius---Survey and recent results
cites work: Further results on the covering radius of codes
cites work: On the covering radius of codes
cites work: Lower bounds for binary covering codes
cites work: Modified bounds for covering codes
cites work: All binary codes with covering radius one are subnormal
cites work: On (k, t)-subnormal covering codes
cites work: On \((p,1)\)-subnormal \(q\)-ary covering codes
cites work: Bounds for abnormal binary codes with covering radius one
cites work: Some results on the norm of codes
cites work: Binary linear quasi-perfect codes are normal
cites work: On the Covering Radius Problem for Codes I. Bounds on Normalized Covering Radius
cites work: On the Covering Radius Problem for Codes II. Codes of Low Dimension; Normal and Abnormal Codes
cites work: Q3831025
cites work: The hardness of solving subset sum with preprocessing
cites work: Upper bounds for q-ary covering codes
cites work: Further results on (k, t)-subnormal covering codes
cites work: A new approach to the covering radius of codes
cites work: More binary covering codes are normal
cites work: A note on perfect multiple coverings of the Hamming space
full work available at URL: 0012-365x(94)90164-3
OpenAlex ID: W1990887902
description: scientific article; zbMATH DE number 562667