Fetching the paper…
Reading the bibliography…
We analyze the dispersions of distributed lossless source coding (the Slepian-Wolf problem), the multiple-access channel and the asymmetric broadcast channel.
C. E. Shannon, “A mathematical theory of communication,” Bell System Tech. Journal , vol. 27, pp. 379–423, 1948
1948
Earlier work this paper cites.
V. Strassen, “Asymptotische Abschätzungen in Shannons Informationstheorie,” in Trans. Third. Prague Conf. Inf. Th. , 1962, pp. 689–723
1962
Earlier work this paper cites.
U. Augustin, “Gedachtnisfreie kannale for diskrete zeit,” Z. Wahrscheinlichkelts theory verw , pp. 10–61, 1966
1966
Earlier work this paper cites.
R. G. Gallager, Information theory and reliable communication . New York: Wiley, 1968
1968
Earlier work this paper cites.
R. Ahlswede, “Multiway communication channels,” in Intl. Symp. on Inf. Th. , Tsahkadsor, Armenian S.S.R, 1971, pp. 23–52
1971
Earlier work this paper cites.
H. H. J. Liao, “Multiple access channels,” Ph.D. dissertation, University of Hawaii, Honolulu, 1972
1972
Earlier work this paper cites.
P. P. Bergmans, “Random coding theorems for broadcast channels with degraded components,” IEEE Trans. Inf. Th. , vol. 19, pp. 197–207, 1973
1973
Earlier work this paper cites.
D. Slepian and J. K. Wolf, “Noiseless coding of correlated information sources,” IEEE Trans. on Inf. Th. , vol. 19, pp. 471–80, 1973
1973
Earlier work this paper cites.
T. M. Cover, “A proof of the data compression theorem of Slepian and Wolf for ergodic sources,” IEEE Trans. Inf. Th. , vol. 21, pp. 226–228, Mar. 1975
1975
Earlier work this paper cites.
V. D. Goppa, “Nonprobabilistic mutual information without memory,” Probl. of Control and Inf. Th. , vol. 4, pp. 97–102, 1975
1975
Earlier work this paper cites.
1976
Earlier work this paper cites.
J. Körner and K. Marton, “General broadcast channels with degraded message sets,” IEEE Trans. on Inf. Th. , vol. 23, no. 1, pp. 60–64, 1977
1977
Earlier work this paper cites.
G. Dueck, “Maximal error capacity regions are smaller than average error capacity regions for multi-user channels,” Probl. Control Inf. Theory , vol. 7, pp. 11–19, 1978
1978
Earlier work this paper cites.
R. Ahlswede, “Coloring hypergraphs: A new approach to multi-user source coding–Part I,” Journal of Combinatorics, Information and System Sciences , vol. 1, no. 1, pp. 76–115, 1979
1979
Earlier work this paper cites.
——, “Coloring hypergraphs: A new approach to multi-user source coding–Part II,” Journal of Combinatorics, Information and System Sciences , vol. 5, no. 3, pp. 220–268, 1980
1980
Earlier work this paper cites.
I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems . Akademiai Kiado, 1981
1981
Cited alongside, same era.
T. S. Han and K. Kobayashi, “A new achievable rate region for the interference channel,” IEEE Trans. Inf. Theory , vol. 27, no. 1, pp. 49–60, 1981
1981
Cited alongside, same era.
G. Dueck, “The strong converse coding theorem for the multiple-access channel,” J. Combinatorics, Information & System Science , pp. 187–196, 1981
1981
Cited alongside, same era.
R. Ahlswede, “An elementary proof of the strong converse theorem for the multiple access channel,” J. of Combinatorics, Information & System Sciences , pp. 216–230, 1982
1982
Cited alongside, same era.
F. Göetze, “On the rate of convergence in the multivariate CLT,” The Annals of Probability , vol. 19, no. 2, pp. 721–739, 1991
1991
S. Sarvotham, D. Baron, and R. G. Baraniuk, “Variable-rate universal Slepian-Wolf coding with feedback,” in Asilomar Conference on Signals, Systems and Computers , 2005
2005
Later among the works it cites.
S. Sarvotham, D. Baron, and R. G. Baraniuk, “Non-asymptotic performance of symmetric Slepian-Wolf coding,” in Conference on Information Sciences and Systems , 2005
2005
Later among the works it cites.
J. Chen, D. He, A. Jagmohan, and L. A. Lastras-Montano, “On the duality and difference between Slepian-Wolf coding and channel coding,” in Information Theory Workshop , Lake Tahoe, CA, 2007
2007
Later among the works it cites.
C. Chang and A. Sahai, “Universal quadratic lower bounds on source coding error exponents,” in Conference on Information Sciences and Systems , 2007
2007
Later among the works it cites.
M. Hayashi, “Information spectrum approach to second-order coding rate in channel coding,” IEEE Trans. on Inf. Th. , vol. 55, pp. 4947–66, Nov 2009
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
S. Miyake and F. Kanaya, “Coding theorems on correlated general sources,” IEICE Trans. on Fundamentals of Electronics, Communications and Computer , vol. E78-A, no. 9, pp. 1063–70, 1995
1995
Cited alongside, same era.
I. Kontoyiannis, “Second-order noiseless source coding theorems,” IEEE Trans. on Inf. Th. , pp. 1339–41, Jul 1997
1997
Cited alongside, same era.
T. Cover, “Comments on broadcast channels,” IEEE Trans. on Inf. Th. , vol. 44, no. 6, pp. 2524–30, 1998
1998
Cited alongside, same era.
T. S. Han, “An information-spectrum approach to capacity theorems for the general multiple-access channel,” IEEE Trans. on Inf. Th. , vol. 44, no. 7, pp. 2773–95, Jul 1998
1998
Cited alongside, same era.
S. Boucheron and M. R. Salamatian, “About priority encoding transmission,” IEEE Trans. on Inf. Th. , vol. 46, no. 2, pp. 699–705, 2000
2000
Cited alongside, same era.
G. D. Forney, “On exponential error bounds for random codes on the BSC,” 2001, Unpublished manuscript
2001
Cited alongside, same era.
T. Cormen, C. Leiserson, R. Rivest, and C. Stein, Introduction to Algorithms , 2nd ed. McGraw-Hill Science/Engineering/Math, 2003
2003
Cited alongside, same era.
2009
Later among the works it cites.
D.-K. He, L. A. Lastras-Montaño, E.-H. Yang, A. Jagmohan, and J. Chen, “On the redundancy of Slepian-Wolf coding,” IEEE Trans. on Inf. Th. , vol. 55, no. 12, pp. 5607–27, Dec 2009
2009
Later among the works it cites.
Y. Polyanskiy, H. V. Poor, and S. Verdú, “Channel coding in the finite blocklength regime,” IEEE Trans. on Inf. Th. , vol. 56, pp. 2307 – 59, May 2010
2010
Later among the works it cites.
T. S. Han, Information-Spectrum Methods in Information Theory . Springer Berlin Heidelberg, Feb 2010
2010
Later among the works it cites.
Y. Altug and A. B. Wagner, “Moderate deviation analysis of channel coding: Discrete memoryless case,” in Int. Symp. Inf. Th. , 2010
2010
Later among the works it cites.
V. Kostina and S. Verdú, “Fixed-length lossy compression in the finite blocklength regime: Discrete memoryless sources,” in Int. Symp. Inf. Th. , 2011
2011
Later among the works it cites.
A. Ingber and Y. Kochman, “The dispersion of lossy source coding,” in Data Compression Conference (DCC) , 2011
2011
Later among the works it cites.
D. Wang, A. Ingber, and Y. Kochman, “The dispersion of joint source-channel coding,” in Allerton Conference , 2011
2011
Later among the works it cites.
A. El Gamal and Y.-H. Kim, Network Information Theory . Cambridge, U.K.: Cambridge University Press, 2012
2012
Closest in time.
V. Y. F. Tan, “Moderate-deviations of lossy source coding for discrete and Gaussian sources,” in Int. Symp. Inf. Th. , 2012
2012
Closest in time.
I. Sason, “Moderate deviations analysis of binary hypothesis testing,” in Int. Symp. Inf. Th. , 2012
2012
Closest in time.