Uniqueness of \([87,5,57; 3]\)-codes and the nonexistence of \([258,6,171; 3]\)-codes
type: Item
instance of: scholarly article
title: Uniqueness of \([87,5,57; 3]\)-codes and the nonexistence of \([258,6,171; 3]\)-codes
zbMATH Open document ID: 0873.05027
DOI: 10.1016/S0378-3758(96)00013-4
author: Noboru Hamada
author: Tor Helleseth
published in: Journal of Statistical Planning and Inference
publication date: 1997-10-20T00:00:00Z
Mathematics Subject Classification ID: 05B25
Mathematics Subject Classification ID: 62K15
Mathematics Subject Classification ID: 94B65
zbMATH DE Number: 1040438
zbMATH Keywords: linear codes
zbMATH Keywords: minihypers
zbMATH Keywords: Griesmer bound
MaRDI profile type: Publication
cites work: Q5796828
cites work: Q3285034
cites work: On a Bound Useful in the Theory of Factorial Designs and Error Correcting Codes
cites work: An optimal ternary [69,5,45] code and related codes
cites work: Optimal ternary quasi-cyclic codes
cites work: A Bound for Error-Correcting Codes
cites work: 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
cites work: A characterization of some \([n,k,d;q]\)-codes meeting the Griesmer bound using a minihyper in a finite projective geometry
cites work: Q4894967
cites work: 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
cites work: Q3813825
cites work: A characterization of \(\{v_{\mu +1}+\epsilon,v_{\mu};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes and factorial designs
cites work: Q1182872
cites work: A characterization of some minihypers in a finite projective geometry PG(t,4)
cites work: Q3993697
cites work: Q1197005
cites work: Q4027639
cites work: Q3136944
cites work: 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
cites work: Q4271179
cites work: Q4314362
cites work: 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\)
cites work: On the construction of \([q^ 4+q^ 2-q, 5, q^ 4-q^ 3+q^ 2-2q; q]\)-codes meeting the Griesmer bound
cites work: Characterization of \(\{2(q+1) + 2, 2; t, q\}\)-minihypers in \(PG(t,q) (t\geqslant 3, q\in \{3,4\})\)
cites work: Q4201552
cites work: Q4201554
cites work: A new class of nonbinary codes meeting the Griesmer bound
cites work: A characterization of some \(\{ 3v_ 1+v_ 3,3v_ 0+v_ 2; 3,3\}\)-minihypers and its applications to error-correcting codes
cites work: On a geometrical method of construction of maximal t-linearly independent sets
cites work: Construction of Optimal Codes and Optimal Fractional Factorial Designs Using Linear Programming
cites work: Construction of optimal linear codes using flats and spreads in a finite projective geometry
cites work: A characterization of codes meeting the Griesmer bound
cites work: Caps and codes
cites work: Q3801474
cites work: Optimal ternary linear codes
cites work: Q3694152
cites work: Q4146667
cites work: Algebraically punctured cyclic codes
cites work: A note on the construction of optimal linear codes
cites work: On linear codes which attain the Solomon-Stiffler bound
description: scientific article; zbMATH DE number 1040438