On normal and subnormal q-ary codes

DOI10.1109/18.45285MaRDI QIDQ3472054zbMATH OpenOpenAlexFDO

Authors G. J. M. van Wee, Antoine Lobstein

Publication date 1989

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.45285

zbMATH Keywords

amalgamated direct sum constructioncovering radiuslower boundsnormal codeperfect codesubnormal codeternary codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial codes (94B25) Other types of codes (94B60)

Recommendations

• On \((p,1)\)-subnormal \(q\)-ary covering codes
• Upper bounds for q-ary covering codes
• More binary covering codes are normal
• A note on bounds for q-ary covering codes
• On (k, t)-subnormal covering codes

Cited in

(7)

• Bounds for binary multiple covering codes
• On \((p,1)\)-subnormal \(q\)-ary covering codes
• On normal \(q\)-ary codes in Rosenbloom-Tsfasman metric
• Construction of new codes and its related parameters
• Some results on the norm of codes
• Upper bounds for football pool problems and mixed covering codes
• Generalized bounds and binary/ternary mixed packing and covering codes

This page was built for publication: On normal and subnormal q-ary codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3472054)