Establishes tight sum-rate bounds for distributed bilinear function computation over finite fields via non-linear transformations paired with Körner-Marton coding, yielding exact limits for large fields and unbounded gains over Slepian-Wolf.
Multi-server multi-function distributed computation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.IT 1years
2024 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Structured Codes for Distributed Matrix Multiplication
Establishes tight sum-rate bounds for distributed bilinear function computation over finite fields via non-linear transformations paired with Körner-Marton coding, yielding exact limits for large fields and unbounded gains over Slepian-Wolf.