A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES (Q4968646): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
label / enlabel / en
 
A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A table of upper bounds for binary codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The completion determination of optimal \((3,4)\)-packings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary codes with a minimum distance of four (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5707657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3546840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Code Bounds Based on Quadruple Distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the failing cases of the Johnson bound for error-correcting codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3285920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new four-error-correcting code of length 20 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes from affine permutation groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Semidefinite Programming Bound on Sizes of Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two new bounds on the size of binary codes with a minimum distance of three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing error-correcting binary codes using transitive permutation groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new binary code of length 16 and minimum distance 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bounds on sizes of codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds on codes via association schemes and linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two new four-error-correcting binary codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On optimal binary codes with unbalanced coordinates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal binary one-error-correcting codes of length 10 have 72 codewords / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Code Upper Bounds From the Terwilliger Algebra and Semidefinite Programming / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://www.koreascience.or.kr:443/article/JAKO201912742274788.pdf / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3175737355 / rank
 
Normal rank
Property / title
 
A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES (English)
Property / title: A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES (English) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:18, 30 July 2024

scientific article; zbMATH DE number 7080987
Language Label Description Also known as
English
A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES
scientific article; zbMATH DE number 7080987

    Statements

    0 references
    0 references
    16 July 2019
    0 references
    binary code
    0 references
    Johnson bound
    0 references
    upper bound
    0 references
    A SIMPLE PROOF OF THE IMPROVED JOHNSON BOUND FOR BINARY CODES (English)
    0 references

    Identifiers