Characterization of two classes of codes that attain the Griesmer bound (Q2266696)

From MaRDI portal
Revision as of 10:41, 2 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Characterization of two classes of codes that attain the Griesmer bound
scientific article

    Statements

    Characterization of two classes of codes that attain the Griesmer bound (English)
    0 references
    0 references
    0 references
    1983
    0 references
    0 references
    binary linear codes
    0 references
    Griesmer bound
    0 references