The nonexistence of ternary [79, 6, 51] codes
From MaRDI portal
Publication:1299056
DOI10.1016/S0378-3758(98)00040-8zbMath0929.94030OpenAlexW2052050509MaRDI QIDQ1299056
Publication date: 12 October 1999
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0378-3758(98)00040-8
Linear codes (general theory) (94B05) Combinatorial aspects of finite geometries (05B25) Factorial statistical designs (62K15)
Related Items (1)
The nonexistence of ternary \([105,6,68\) and \([230,6,152]\) codes]
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classification of some optimal ternary linear codes of small length
- On the construction of \([q^ 4+q^ 2-q, 5, q^ 4-q^ 3+q^ 2-2q; q\)-codes 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
- On a geometrical method of construction of maximal t-linearly independent sets
- Uniqueness of \([87,5,57; 3\)-codes and the nonexistence of \([258,6,171; 3]\)-codes]
- A characterization of some \([n,k,d;q\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry]
- Construction of some optimal ternary linear codes and the uniqueness of \([294, 6, 195; 3\)-codes meeting the Griesmer bound]
- The nonexistence of \([71,5,46;3\)-codes]
- Algebraically punctured cyclic codes
- A Bound for Error-Correcting Codes
- On a Bound Useful in the Theory of Factorial Designs and Error Correcting Codes
This page was built for publication: The nonexistence of ternary [79, 6, 51] codes
