Every Bit Counts: Second-Order Analysis of Cooperation in the Multiple-Access Channel

The work at hand presents a finite-blocklength analysis of the multiple access channel (MAC) sum-rate under the cooperation facilitator (CF) model. The CF model, in which independent encoders coordinate through an intermediary node, is known to show significant rate benefits, even when the rate of cooperation is limited. We continue this line of study for cooperation rates which are sub-linear in the blocklength n. Roughly speaking, our results show that if the facilitator transmits log $K$ bits, then there is a sum-rate benefit of order √log K/n compared to the best-known achievable rate. This result extends across a wide range of K: even a single bit of cooperation is shown to provide a sum-rate benefit of order 1/√n.

[1]  Albert Guillén i Fàbregas,et al.  Second-order rate region of constant-composition codes for the multiple-access channel , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[2]  Michael Langberg,et al.  The unbounded benefit of encoder cooperation for the k-user MAC , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[3]  J. A. Hartigan,et al.  Bounding the Maximum of Dependent Random Variables , 2013 .

[4]  Michael Langberg,et al.  On the Capacity Advantage of a Single Bit , 2016, 2016 IEEE Globecom Workshops (GC Wkshps).

[5]  Michael Langberg,et al.  Can Negligihle Cooperation Increase Capacity? The Average-Error Case , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[6]  Pierre Moulin,et al.  Finite blocklength coding for multiple access channels , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[7]  Michael Langberg,et al.  Negligible Cooperation: Contrasting the Maximal- and Average-Error Cases , 2019, ArXiv.

[8]  Frans M. J. Willems,et al.  The discrete memoryless multiple-access channel with cribbing encoders , 1985, IEEE Trans. Inf. Theory.

[9]  Tracey Ho,et al.  On the power of cooperation: Can a little help a lot? , 2014, 2014 IEEE International Symposium on Information Theory.

[10]  Michelle Effros,et al.  Random Access Channel Coding in the Finite Blocklength Regime , 2021, IEEE Transactions on Information Theory.

[11]  Vincent Y. F. Tan,et al.  On the dispersions of three network information theory problems , 2012, 2012 46th Annual Conference on Information Sciences and Systems (CISS).

[12]  Qi-Man Shao,et al.  From Stein identities to moderate deviations , 2009, 0911.5373.

[13]  C. Borell.  The Brunn-Minkowski inequality in Gauss space , 1975 .

[14]  J. Nicholas Laneman,et al.  Simpler achievable rate regions for multiaccess with finite blocklength , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[15]  Frans M. J. Willems,et al.  The discrete memoryless multiple access channel with partially cooperating encoders , 1983, IEEE Trans. Inf. Theory.

[16]  I. Ibragimov,et al.  Norms of Gaussian sample functions , 1976 .