scientific article; zbMATH DE number 1498813

MaRDI QIDQ4501004zbMATH OpenFDO

Authors Emil Kolev

Publication date 3 September 2000

zbMATH Keywords

binary codesmaximal cardinality

Mathematics Subject Classification ID

Bounds on codes (94B65) Other types of codes (94B60)

Recommendations

• An improvement on the bound for \(C_2 (n)\)
• Improved bounds on the set \(A(A+1)\)
• An improved bound on \((A+A)/(A+A)\)
• An improved upper bound for Ramsey number R(3,3,3,3;2)
• A new bound for the 2/3 conjecture
• An improved bound for the size of the set \(A/A+A\)
• Improved upper and lower bounds for the difference \(A_n-G_n\)
• Improved lower bounds on \(m_r(2,29)\)
• A new lower bound for \(\|(3/2)^k\|\)
• An improved upper bound for the Erdős-Szekeres conjecture

Cited in

(3)

• On the Maximal Cardinality of Binary Two-weight Codes
• The uniqueness of the Best code
• Two new bounds on the size of binary codes with a minimum distance of three

This page was built for publication:

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