Code pairs with specified parity of the Hamming distances

DOI10.1016/S0012-365X(97)00270-7zbMath0949.94008MaRDI QIDQ1584332

R. Smith

Publication date: 2 November 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

extremal problemsmonochromatic rectanglesconstant distance code pairsparity of Hamming distances

Mathematics Subject Classification ID

Extremal set theory (05D05) Other types of codes (94B60)

Related Items

Multiparty Communication Complexity of Vector–Valued and Sum–Type Functions

Cites Work

• Une propriété extremale des plans projectifs finis dans une classe de codes équidistants
• A theorem on equidistant codes
• A two-family extremal problem in Hamming space
• Inequalities for code pairs
• An extension of an inequality by Ahlswede, El Gamal and Pang for pairs of binary codes
• A general 4-words inequality with consequences for 2-way communication complexity
• Unnamed Item
• Unnamed Item
• Unnamed Item