On the general excess bound for binary codes with covering radius one (Q5891409): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4342497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further results on the covering radius of codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary and ternary codes of covering radius one: some new lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary codes with covering radius one: Some new lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2713644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on Haas' method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved sphere bounds on the covering radius of codes / rank
 
Normal rank

Latest revision as of 07:20, 7 July 2024

scientific article; zbMATH DE number 6250384
Language Label Description Also known as
English
On the general excess bound for binary codes with covering radius one
scientific article; zbMATH DE number 6250384

    Statements

    On the general excess bound for binary codes with covering radius one (English)
    0 references
    0 references
    24 January 2014
    0 references
    binary codes
    0 references
    covering radius
    0 references
    general excess bound
    0 references
    lower bounds
    0 references
    covering codes
    0 references

    Identifiers