Optimal quaternary linear codes of dimension five
From MaRDI portal
Publication:4885724
DOI10.1109/18.508846zbMATH Open0854.94011OpenAlexW2125456888MaRDI QIDQ4885724FDOQ4885724
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
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)
- Title not available (Why is that?)
- The nonexistence of some five-dimensional quaternary linear codes
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- 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)
