Uniqueness of [87,5,57; 3]-codes and the nonexistence of [258,6,171; 3]-codes

DOI10.1016/S0378-3758(96)00013-4zbMATH Open0873.05027MaRDI QIDQ1361705FDOQ1361705

Authors: Noboru Hamada, Tor Helleseth 

Publication date: 20 October 1997

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Recommendations

• A characterization of some \(\{ 3v_ 1+v_ 3,3v_ 0+v_ 2; 3,3\}\)-minihypers and its applications to error-correcting 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\)
• Construction of some optimal ternary linear codes and the uniqueness of \([294, 6, 195; 3]\)-codes meeting the Griesmer bound

zbMATH Keywords

Griesmer boundlinear codesminihypers

Mathematics Subject Classification ID

Factorial statistical designs (62K15) Combinatorial aspects of finite geometries (05B25) Bounds on codes (94B65)

Cites Work

• Title not available (Why is that?)
• Algebraically punctured cyclic codes
• A Bound for Error-Correcting Codes
• On a geometrical method of construction of maximal t-linearly independent sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimal ternary quasi-cyclic codes
• 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
• Optimal ternary linear codes
• On a Bound Useful in the Theory of Factorial Designs and Error Correcting Codes
• A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
• Caps and codes
• An optimal ternary [69,5,45] code and related 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\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A characterization of codes meeting the Griesmer bound
• Title not available (Why is that?)
• A note on the construction of optimal linear codes
• Construction of Optimal Codes and Optimal Fractional Factorial Designs Using Linear Programming
• On linear codes which attain the Solomon-Stiffler bound
• Construction of optimal linear codes using flats and spreads in a finite projective geometry
• 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
• 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
• Characterization of \(\{2(q+1) + 2, 2; t, q\}\)-minihypers in \(PG(t,q) (t\geqslant 3, q\in \{3,4\})\)
• Title not available (Why is that?)
• A characterization of some minihypers in a finite projective geometry PG(t,4)
• A new class of nonbinary codes meeting the Griesmer bound
• Title not available (Why is that?)
• 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
• On the construction of \([q^ 4+q^ 2-q, 5, q^ 4-q^ 3+q^ 2-2q; q]\)-codes meeting the Griesmer bound
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A characterization of some \(\{ 3v_ 1+v_ 3,3v_ 0+v_ 2; 3,3\}\)-minihypers and its applications to error-correcting codes

Cited In (8)

• Title not available (Why is that?)
• The nonexistence of some ternary linear codes of dimension 6
• The nonexistence of ternary [79, 6, 51] codes
• Nonexistence of a uniformly packed [70,58,5] code (Corresp.)
• A characterization of some \(\{ 3v_ 1+v_ 3,3v_ 0+v_ 2; 3,3\}\)-minihypers and its applications to error-correcting codes
• Uniqueness of the \((22,891,1/4)\) spherical code
• Nonexistence of some ternary linear codes with minimum weight \(-2\) modulo 9
• Title not available (Why is that?)

This page was built for publication: Uniqueness of \([87,5,57; 3]\)-codes and the nonexistence of \([258,6,171; 3]\)-codes

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