On the minimum length of some linear codes

DOI10.1007/S10623-007-9070-9MaRDI QIDQ2384020zbMATH OpenOpenAlexFDO

Publication date 20 September 2007

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-007-9070-9

0-Cycles Griesmer bound minihypers projective spaces

Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20) Linear codes (general theory) (94B05) Bounds on codes (94B65)

Review text

The authors compute \(n_q(k,d)\), the minimum length that a \(q\)-ary linear code of dimension \(k\) and minimum distance \(d\) can have. It is well-known that \(n_q(k,d)\) is lower bounded by the so-called Griesmer bound \(g_q(k,d)\), this estimate being sharp in several cases such as e.g. whenever \(k\) odd and \(q^{k-1}-2q^{(k-1)/2}+1\leq d\leq q^{k-1}\). Among other things, the main result in this paper implies \(n_q(k,d)=g_k(q,d)+1\) for for \(k\geq 5\) odd, \(q\geq 3\) and \(q^{k-1}-2q^{(k-1)/2}-q+1\leq d\leq q^{k-1}-2q^{(k-1)/2}\). The value \(n_2(k,d)\) is not known at present.

Recommendations

Cites work

Cited in

(21)

This page was built for publication: On the minimum length of some linear codes

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