Modified bounds for covering codes
From MaRDI portal
Publication:5753891
DOI10.1109/18.75253zbMath0721.94023OpenAlexW2140050124MaRDI QIDQ5753891
Publication date: 1991
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.75253
covering radiusbinary codenormal and abnormal codesminimal number of codewordss-surjective matricesvan Wee lower bounds
Related Items (17)
Lower bounds for \(q\)-ary coverings by spheres of radius one ⋮ On \((p,1)\)-subnormal \(q\)-ary covering codes ⋮ Long binary narrow-sense BCH codes are normal ⋮ Further results on the covering radius of small codes ⋮ Binary codes with covering radius one: Some new lower bounds ⋮ New upper bounds for binary covering codes ⋮ Bounds on packings and coverings by spheres in \(q\)-ary and mixed Hamming spaces ⋮ Optimal constant weight covering codes and nonuniform group divisible 3-designs with block size four ⋮ All binary codes with covering radius one are subnormal ⋮ Frequency computation and bounded queries ⋮ A Graham-Sloane type construction for \(s\)-surjective matrices ⋮ Bounds on the sizes of constant weight covering codes ⋮ Bounds for binary multiple covering codes ⋮ Upper bounds for football pool problems and mixed covering codes ⋮ Partial sums of binomials, intersecting numbers, and the excess bound in Rosenbloom-Tsfasman space ⋮ Bounds for covering codes over large alphabets ⋮ On the normality of multiple covering codes
This page was built for publication: Modified bounds for covering codes
