Optimal quaternary linear codes of dimension five

DOI10.1109/18.508846zbMath0854.94011OpenAlexW2125456888MaRDI QIDQ4885724

Iliya G. Boukliev, Stoian N. Kapralov, Rumen N. Daskalov

Publication date: 28 July 1996

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

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

zbMATH Keywords

boundsquaternary linear codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Related Items (4)

New bounds for the minimum length of quaternary linear codes of dimension five ⋮ A method for efficiently computing the number of codewords of fixed weights in linear codes ⋮ New bounds for \(n_{4}(k,d)\) and classification of some optimal codes over GF(4) ⋮ On the minimum length of quaternary linear codes of dimension five

This page was built for publication: Optimal quaternary linear codes of dimension five