The Capacity of 3 User Linear Computation Broadcast

• Published in: IEEE transactions on information theory Vol. 70; no. 6; pp. 4414 - 4438
• Main Authors: Yao, Yuhang, Jafar, Syed A.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.06.2024; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: broadcast; Capacity; Channel coding; coded computation; Coding; Computation; Costs; Decomposition; Degrees of freedom; Distributed databases; Fields (mathematics); index coding; Indexes; Linear functions; Servers; Symbols; User requirements; Vectors
• ISSN: 0018-9448; 1557-9654
• DOI: 10.1109/TIT.2024.3392685

The K User Linear Computation Broadcast (LCBC) problem is comprised of d dimensional data (from <inline-formula> <tex-math notation="LaTeX">\mathbb {F}_{q} </tex-math></inline-formula>), that is fully available to a central server, and K users, who require various linear computations of the data, and have prior knowledge of various linear functions of the data as side-information. The optimal broadcast cost is the minimum number of q-ary symbols to be broadcast by the server per computation instance, for every user to retrieve its desired computation. The reciprocal of the optimal broadcast cost is called the capacity. The main contribution of this paper is the exact capacity characterization for the <inline-formula> <tex-math notation="LaTeX">K=3 </tex-math></inline-formula> user LCBC for all cases, i.e., for arbitrary finite fields <inline-formula> <tex-math notation="LaTeX">\mathbb {F}_{q} </tex-math></inline-formula>, arbitrary data dimension d, and arbitrary linear side-informations and demands at each user. A remarkable aspect of the converse (impossibility result) is that unlike the 2 user LCBC whose capacity was determined previously, the entropic formulation (where the entropies of demands and side-informations are specified, but not their functional forms) is insufficient to obtain a tight converse for the 3 user LCBC. Instead, the converse exploits functional submodularity. Notable aspects of achievability include sufficiency of vector linear coding schemes, subspace decompositions that parallel those found previously by Yao Wang in degrees of freedom (DoF) studies of wireless broadcast networks, and efficiency tradeoffs that lead to a constrained waterfilling solution. Random coding arguments are invoked to resolve compatibility issues that arise as each user has a different view of the subspace decomposition, conditioned on its own side-information.