A general 4-words inequality with consequences for 2-way communication complexity

DOI10.1016/0196-8858(89)90004-3zbMath0668.94007OpenAlexW2012121115MaRDI QIDQ1118569

Zhen Zhang, Ning Cai

Publication date: 1989

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://pub.uni-bielefeld.de/record/1780500

zbMATH Keywords

2-way communication complexityGeneral 4-words inequalitymonochromatic rectangles

Mathematics Subject Classification ID

Communication, information (94A99)

Related Items (9)

Deterministic communication complexity of set intersection ⋮ On a restricted cross-intersection problem ⋮ On Extremal Set Partitions in Cartesian Product Spaces ⋮ Fractional cross intersecting families ⋮ Maximal fractional cross-intersecting families ⋮ Multiparty Communication Complexity of Vector–Valued and Sum–Type Functions ⋮ Uniformly cross intersecting families ⋮ Code pairs with specified parity of the Hamming distances ⋮ Rank formulas for certain products of matrices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A two-family extremal problem in Hamming space
• An extension of an inequality by Ahlswede, El Gamal and Pang for pairs of binary codes
• Communication Complexity of Computing the Hamming Distance

This page was built for publication: A general 4-words inequality with consequences for 2-way communication complexity