A characterization of \(\{v_{\mu +1}+\epsilon,v_{\mu};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes and factorial designs (Q1124584): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Q758949 / rank
Normal rank
 
Property / author
 
Property / author: Michel Marie Deza / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0378-3758(89)90098-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2085025493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the Griesmer bound (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4081121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5796828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3285034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Bound Useful in the Theory of Factorial Designs and Error Correcting Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bound for Error-Correcting Codes / rank
 
Normal rank
Property / cites work
 
Property / 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 / rank
 
Normal rank
Property / cites work
 
Property / 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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3813825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a geometrical method of construction of maximal t-linearly independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of Optimal Codes and Optimal Fractional Factorial Designs Using Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of optimal linear codes using flats and spreads in a finite projective geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of codes meeting the Griesmer bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5683869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraically punctured cyclic codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the construction of optimal linear codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On linear codes which attain the Solomon-Stiffler bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the uniqueness resp. Nonexistence of certain codes meeting the Griesmer bound / rank
 
Normal rank

Latest revision as of 09:25, 20 June 2024

scientific article
Language Label Description Also known as
English
A characterization of \(\{v_{\mu +1}+\epsilon,v_{\mu};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes and factorial designs
scientific article

    Statements

    A characterization of \(\{v_{\mu +1}+\epsilon,v_{\mu};t,q\}\)-min\(\cdot hypers\) and its applications to error-correcting codes and factorial designs (English)
    0 references
    0 references
    0 references
    1989
    0 references
    See the review of the preceding article of the authors.
    0 references
    linear code
    0 references
    minimum distance
    0 references
    Griesmer bound
    0 references
    finite projective space
    0 references
    min\(\cdot hyper\)
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references