Characterization of \(\{v_{\mu +1}+2v_{\mu},v_{\mu}+2v_{\mu - 1};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes
type: Item
instance of: scholarly article
title: Characterization of \(\{v_{\mu +1}+2v_{\mu},v_{\mu}+2v_{\mu - 1};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes
zbMATH Open document ID: 0672.94009
DOI: 10.1007/BF01788665
author: Noboru Hamada
published in: Graphs and Combinatorics
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 51E20
zbMATH DE Number: 4101093
zbMATH Keywords: Griesmer bound
MaRDI profile type: Publication
cites work: Q3285034
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: 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: 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: Q4146667
cites work: Algebraically punctured cyclic codes
cites work: A note on the construction of optimal linear codes
cites work: Q3947676
cites work: On linear codes which attain the Solomon-Stiffler bound
cites work: On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer bound
description: scientific article; zbMATH DE number 4101093