A construction of some [n,k,d;q]-codes meeting the Griesmer bound
From MaRDI portal
Publication:1802135
Recommendations
- scientific article; zbMATH DE number 1284205
- scientific article; zbMATH DE number 5054194
- Publication:4945067
- 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
- Construction of some optimal ternary linear codes and the uniqueness of \([294, 6, 195; 3]\)-codes meeting the Griesmer bound
Cites work
- A Bound for Error-Correcting Codes
- A characterization of codes meeting the Griesmer bound
- A note on the Griesmer bound (Corresp.)
- 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
- Algebraically punctured cyclic codes
- Characterization of \(\{v_{\mu +1}+2v_{\mu},v_{\mu}+2v_{\mu - 1};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes
- Codes and information
- Construction of Optimal Codes and Optimal Fractional Factorial Designs Using Linear Programming
- Construction of optimal linear codes using flats and spreads in a finite projective geometry
- Error detecting and error correcting codes
- Goppa codes that are better than the Varshamov-Gilbert bound
- scientific article; zbMATH DE number 3121305 (Why is no real title available?)
- scientific article; zbMATH DE number 3133919 (Why is no real title available?)
- scientific article; zbMATH DE number 3166657 (Why is no real title available?)
- scientific article; zbMATH DE number 3917102 (Why is no real title available?)
- scientific article; zbMATH DE number 4059287 (Why is no real title available?)
- scientific article; zbMATH DE number 4097281 (Why is no real title available?)
- scientific article; zbMATH DE number 3763833 (Why is no real title available?)
- scientific article; zbMATH DE number 3765799 (Why is no real title available?)
- scientific article; zbMATH DE number 3499621 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1101474 (Why is no real title available?)
- scientific article; zbMATH DE number 3225713 (Why is no real title available?)
- scientific article; zbMATH DE number 3257050 (Why is no real title available?)
- scientific article; zbMATH DE number 3319555 (Why is no real title available?)
- scientific article; zbMATH DE number 3397423 (Why is no real title available?)
- scientific article; zbMATH DE number 3048068 (Why is no real title available?)
- scientific article; zbMATH DE number 3057679 (Why is no real title available?)
- Maximal sets of points in finite projective space, no t-linearly dependent
- Minimum block length of a linear q-ary code with specified dimension and code distance
- On a geometrical method of construction of maximal t-linearly independent sets
- On linear codes which attain the Solomon-Stiffler bound
- On maximal t-linearly independent sets
- On the uniqueness of \((q+1)_ 4\)-arcs of \(PG(4,q),q=2^ h,h\vee\)
- On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer bound
- Orthogonal Arrays of Index Unity
- Some maximal arcs in finite projective planes
- Some optimal codes from algebraic geometry and their covering radii
- Some results concerning \(\{(q+1)(n-1);\;n\}\)-arcs and \(\{(q+1)\;(n-1)+1;\;n\}\)-arcs in finite projective planes of order \(q\)
- The non-classical 10-arc of PG(4,9)
Cited in
(6)- On codes meeting the Griesmer bound.
- Linear codes over \(\mathbb {F}_{q}[x]/(x^2)\) and \(\mathrm{GR}(p^2,m)\) reaching the Griesmer bound
- New constructions of codes meeting the Griesmer bound
- On the geometric constructions of optimal linear codes
- scientific article; zbMATH DE number 1284205 (Why is no real title available?)
- scientific article; zbMATH DE number 1420995 (Why is no real title available?)
This page was built for publication: A construction of some \([n,k,d;q]\)-codes meeting the Griesmer bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802135)
