A note on the construction of optimal linear codes
From MaRDI portal
Publication:1156769
DOI10.1016/0378-3758(81)90042-2zbMath0468.94008OpenAlexW2074539348MaRDI QIDQ1156769
Publication date: 1981
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0378-3758(81)90042-2
Linear programming (90C05) Linear codes (general theory) (94B05) Combinatorial aspects of finite geometries (05B25)
Related Items (13)
A characterization of some \(\{3v_{\mu+ 1}, 3v_ \mu; k-1, q\}\)-minihypers and some \([n, k, q^{k-1}- 3q^ \mu; q\)-codes \((k\geq 3\), \(q\geq 5\), \(1\leq \mu< k-1)\) meeting the Griesmer bound] ⋮ Uniqueness of \([87,5,57; 3\)-codes and the nonexistence of \([258,6,171; 3]\)-codes] ⋮ A characterization of some \(\{ 3v_ 2+v_ 3,3v_ 1+v_ 2; 3,3\}\)-minihypers and some \([15,4,9; 3\)-codes with \(B_ 2=0\)] ⋮ Characterization of \(\{(q+1)+2,1;t,q\}-\min \cdot hypers\) and \(\{2(q+1)+2,2;2,q\}-\min \cdot hypers\) in a finite projective geometry ⋮ Characterization of \(\{v_{\mu +1}+2v_{\mu},v_{\mu}+2v_{\mu - 1};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes ⋮ The nonexistence of \([71,5,46;3\)-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 ⋮ A characterization of some \(\{2v_{\alpha{}+1}+v_{\gamma{}+1},2v_ \alpha{}+v_ \gamma{};k-1,3\}\)-minihypers and some \((n,k,3^{k-1}- 2\cdot{}3^ \alpha{}-3^ \gamma{};3)\)-codes \((k\geq{}3,\;0 \leq{}\alpha{}< \gamma{}< k-1)\) meeting the Griesmer bound ⋮ A characterization of some \(\{v_ 2+2v_ 3,v_ 1+2v_ 2;k-1,3\}\)-minihypers and some \((v_ k-30,k,3^{k-1}-21;3)\)-codes meeting the Griesmer bound ⋮ A characterization of some \([n,k,d;q\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry] ⋮ 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 ⋮ On linear codes which attain the Solomon-Stiffler bound ⋮ A characterization of some minihypers in a finite projective geometry PG(t,4)
Cites Work
This page was built for publication: A note on the construction of optimal linear codes
