On the Maximal Cardinality of Binary Two-weight Codes

DOI10.7546/CRABS.2021.10.01zbMATH Open1493.94062OpenAlexW3208627174MaRDI QIDQ5068219

Assia Rousseva, Ivan Landjev

Publication date: 5 April 2022

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

zbMATH Keywords

two-weight codesErdös-Ko-Rado theoremnon-linear codesmain problem of coding theory

Mathematics Subject Classification ID

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

Related Items (1)

On the size of maximal binary codes with 2, 3, and 4 distances

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On the maximum cardinality of binary constant weight codes with prescribed distance 👍 👎
• A new two-error-correcting binary code of length 16 👍 👎
• On \(q\)-ary codes with two distances \(d\) and \(d+1\) 👍 👎
• Two-weight codes: upper bounds and new optimal constructions 👍 👎
• On two-weight codes 👍 👎
• Constructions of binary codes with two distances 👍 👎
• Optimal binary one-error-correcting codes of length 10 have 72 codewords 👍 👎

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)