Optimal linear codes of dimension 4 over F/sub 5/

DOI10.1109/18.567723zbMath0871.94046OpenAlexW1990038698MaRDI QIDQ4336313

Masaharu Fukui, Iliya G. Boukliev, Stoian N. Kapralov, Tatsuya Maruta

Publication date: 29 September 1997

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

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

zbMATH Keywords

minimum-length boundsoptimal \(q\)-ary linear codes

Mathematics Subject Classification ID

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

Related Items (6)

On multiple caps in finite projective spaces ⋮ On the minimum length of linear codes over \(\mathbb{F}_5\) ⋮ New minimum distance bounds for linear codes over GF(5). ⋮ \(t\)-CIS codes over \(\mathrm{GF}(p)\) and orthogonal arrays ⋮ A method for efficiently computing the number of codewords of fixed weights in linear codes ⋮ Divisibility of codes meeting the Griesmer bound

This page was built for publication: Optimal linear codes of dimension 4 over F/sub 5/