A two-family extremal problem in Hamming space

DOI10.1016/0012-365X(84)90144-4zbMath0532.94013MaRDI QIDQ789376

N. E. Zubov

Publication date: 1984

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

zbMATH Keywords

inequalitiesHamming spacecode pairstwo-family extremal problem

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99)

Related Items

A general 4-words inequality with consequences for 2-way communication complexity, Multiparty Communication Complexity of Vector–Valued and Sum–Type Functions, Forbidden Intersections, Code pairs with specified parity of the Hamming distances, Inequalities for code pairs, An extension of an inequality by Ahlswede, El Gamal and Pang for pairs of binary codes

Cites Work

• Unnamed Item
• Contributions to the geometry of Hamming spaces
• Communication Complexity of Computing the Hamming Distance