On the covering radius of long binary BCH codes (Q1093616)

From MaRDI portal
Revision as of 19:14, 12 July 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
On the covering radius of long binary BCH codes
scientific article

    Statements

    On the covering radius of long binary BCH codes (English)
    0 references
    0 references
    1987
    0 references
    The author has proved in this paper that the covering radius of long binary BCH codes with designed distance \(2t+1\) is at most 2t.
    0 references
    covering radius
    0 references
    long binary BCH codes
    0 references

    Identifiers