On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer bound
From MaRDI portal
Publication:3866012
DOI10.1016/S0019-9958(80)90115-1zbMath0428.94009OpenAlexW2111913322MaRDI QIDQ3866012
Publication date: 1980
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(80)90115-1
Related Items (22)
An improvement of the Griesmer bound for some small minimum distances ⋮ 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 ⋮ 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 ⋮ On the minimum weights of binary linear complementary dual codes ⋮ New upper bounds and constructions of multi-erasure locally recoverable codes ⋮ The smallest length of binary 7-dimensional linear codes with prescribed minimum distance ⋮ Sufficient conditions for monotonicity of the undetected error probability for large channel error probabilities ⋮ Optimal subcodes and optimum distance profiles of self-dual codes ⋮ On linear projective codes which satisfy the chain condition. ⋮ A note on the covering radius of optimum codes ⋮ A characterization of \(\{ 2\upsilon{}_{\alpha{}+1}+2\upsilon{}_{\beta{}+1},2\upsilon_ \alpha{}+2\upsilon{}_ \beta{} ;t,q\}\)-minihypers in PG\((t,q)(t\geq 2,q\geq 5\) and \(0\leq\alpha{}<\beta{}<t)\) and its applications to error- correcting codes ⋮ 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 ⋮ Hamming distances of constacyclic codes of length \(3p^s\) and optimal codes with respect to the Griesmer and Singleton bounds ⋮ 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 ⋮ On the Construction of Binary Optimal LCD Codes with Short Length ⋮ 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] ⋮ On linear codes which attain the Solomon-Stiffler bound ⋮ A characterization of some minihypers in a finite projective geometry PG(t,4) ⋮ On the cosets of the simplex code
This page was built for publication: On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer bound
