On the Maximal Cardinality of Binary Two-weight Codes

DOI10.7546/CRABS.2021.10.01MaRDI QIDQ5068219zbMATH OpenOpenAlexFDO

Authors Assia Rousseva, I. Landjev

Publication date 5 April 2022

Full work available at URL https://doi.org/10.7546/crabs.2021.10.01

zbMATH Keywords

Erdös-Ko-Rado theoremmain problem of coding theorynon-linear codestwo-weight codes

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial inequalities (05A20) Combinatorial codes (94B25) Bounds on codes (94B65)

Recommendations

• Constructions of binary codes with two distances
• On two-weight codes
• Two-weight codes: upper bounds and new optimal constructions
• scientific article; zbMATH DE number 2192000
• On the maximum cardinality of binary constant weight codes with prescribed distance
• A new two-error-correcting binary code of length 16
• Optimal binary one-error-correcting codes of length 10 have 72 codewords
• On \(q\)-ary codes with two distances \(d\) and \(d+1\)
• scientific article; zbMATH DE number 1498813
• scientific article; zbMATH DE number 3801447

Cited in

(6)

• Maximum weight spectrum codes
• On \(q\)-ary codes with two distances \(d\) and \(d+1\)
• Two-weight codes: upper bounds and new optimal constructions
• On two-weight codes
• On the most weight w vectors in a dimension k binary code
• On the size of maximal binary codes with 2, 3, and 4 distances

This page was built for publication: On the Maximal Cardinality of Binary Two-weight Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5068219)