A note on the Griesmer bound (Corresp.)
From MaRDI portal
Publication:5666443
DOI10.1109/TIT.1973.1054939zbMath0252.94005OpenAlexW2009160369MaRDI QIDQ5666443
L. D. Baumert, Robert J. McEliece
Publication date: 1973
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1973.1054939
Related Items (17)
On entanglement-assisted quantum codes achieving the entanglement-assisted Griesmer bound ⋮ PIR codes with short block length ⋮ Locality of optimal binary codes ⋮ Characterization of \(\{2(q+1)+2,2;t,q\}\)-\(\min \cdot hypers\) in PG(t,q) (t\(\geq 3,q\geq 5)\) and its applications to error-correcting codes ⋮ A characterization of \(\{v_{\mu +1}+\epsilon,v_{\mu};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes and factorial designs ⋮ Classification of \((3 \bmod 5)\) arcs in \(\mathrm{PG}(3,5)\) ⋮ The smallest length of binary 7-dimensional linear codes with prescribed minimum distance ⋮ A note on the covering radius of optimum codes ⋮ Optimal ternary quasi-cyclic codes ⋮ On the binary projective codes with dimension 6 ⋮ The \([46, 9, 20_2\) code is unique] ⋮ A characterization of some \([n,k,d;q\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry] ⋮ A construction of some \([n,k,d;q\)-codes meeting the Griesmer bound] ⋮ A survey of recent works with respect to a characterization of an (n,k,d;q)-code meeting the Griesmer bound using a min\(\cdot hyper\) in a finite projective geometry ⋮ Divisibility of codes meeting the Griesmer bound ⋮ New bounds for \(n_{4}(k,d)\) and classification of some optimal codes over GF(4) ⋮ Classification of Griesmer codes and dual transform
This page was built for publication: A note on the Griesmer bound (Corresp.)
