Optimal quaternary linear codes of dimension five

DOI10.1109/18.508846MaRDI QIDQ4885724zbMATH OpenOpenAlexFDO

Authors Iliya G. Boukliev, Stoyan Kapralov, Rumen 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)

Recommendations

• New bounds for the minimum length of quaternary linear codes of dimension five
• On the minimum length of quaternary linear codes of dimension five
• New optimal quaternary linear codes of dimension 5
• New bounds for \(n_{4}(k,d)\) and classification of some optimal codes over GF(4)
• Optimal linear codes of dimension 4 over F/sub 5/

Cited in

(11)

• The nonexistence of some five-dimensional quaternary linear codes
• scientific article; zbMATH DE number 969980 (Why is no real title available?)
• scientific article; zbMATH DE number 5592915 (Why is no real title available?)
• Bounds on codes over an alphabet of five elements
• On 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 the minimum length of quaternary linear codes of dimension five
• scientific article; zbMATH DE number 1189037 (Why is no real title available?)
• New bounds for \(n_{4}(k,d)\) and classification of some optimal codes over GF(4)
• Bounds on minimum distance for linear codes over GF(5)
• Optimal Additive Quaternary Codes of Low Dimension

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

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