A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with Preparata parameters (Q1802186): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The linear programming bound for binary linear codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An updated table of minimum-distance bounds for binary linear codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly perfect binary codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3285920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of optimum nonlinear double-error-correcting codes / rank
 
Normal rank

Latest revision as of 16:10, 17 May 2024

scientific article
Language Label Description Also known as
English
A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with Preparata parameters
scientific article

    Statements

    A sharpening of the Johnson bound for binary linear codes and the nonexistence of linear codes with Preparata parameters (English)
    0 references
    0 references
    0 references
    21 July 1993
    0 references

    Identifiers