On normal and subnormal q-ary codes

DOI10.1109/18.45285zbMath0695.94017OpenAlexW2153535269MaRDI QIDQ3472054

G. J. M. van Wee, Antoine C. 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

covering radiuslower boundsternary codesperfect codeamalgamated direct sum constructionnormal codesubnormal code

Mathematics Subject Classification ID

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

Related Items (6)

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

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