Fetching the paper…
Reading the bibliography…
We establish the capacity of a class of communication channels introduced in [1].
“A remark on stirling’s formula,”
Herbert Robbins, · 1955
Earlier work this paper cites.
“Distance between sampling with and without replacement,”
A. J. Stam, · 1978
Earlier work this paper cites.
“Finite exchangeable sequences,”
P. Diaconis and D. Freedman, · 1980
Earlier work this paper cites.
“A simple proof of the blowing-up lemma (corresp.),”
K. Marton, · 1986
Earlier work this paper cites.
“Information-theoretic determination of minimax rates of convergence,”
Yuhong Yang and Andrew Barron, · 1999
Earlier work this paper cites.
“On transmission over deletion channels,”
Suhas N Diggavi and Matthias Grossglauser, · 2001
Earlier work this paper cites.
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
T.M. Cover and J.A. Thomas, · 2006
Earlier work this paper cites.
“Polynomial time low-density parity-check codes with rates very close to the capacity of the q q -ary random deletion channel for large q q ,”
Michael Mitzenmacher, · 2006
Earlier work this paper cites.
“Context tree estimation for not necessarily finite memory processes, via BIC and MDL,”
I. Csiszar and Z. Talata, · 2006
Earlier work this paper cites.
“Optimal rate delay tradeoffs for multipath routed and network coded networks,”
John MacLaren Walsh, Steven Weber, and Ciira wa Maina, · 2008
Cited alongside, same era.
Sums of Independent Random Variables
V.V. Petrov, · 2012
Cited alongside, same era.
“Subset codes for packet networks,”
Mladen Kovacevic and Dejan Vukobratovic, · 2013
Cited alongside, same era.
“Perfect codes in the discrete simplex,”
Mladen Kovacevic and Dejan Vukobratovic, · 2013
Cited alongside, same era.
“A sharp estimate of the binomial mean absolute deviation with applications,”
Daniel Berend and Aryeh Kontorovich, · 2013
Cited alongside, same era.
“DNA-based storage: Trends and methods,”
S. M. Hossein Tabatabaei Yazdi, Han Mao Kiah, Eva Garcia-Ruiz, Jian Ma, Huimin Zhao, and Olgica Milenkovic, · 2015
Cited alongside, same era.
“Urns and entropies revisited,”
Frantisek Matus, · 2017
Later among the works it cites.
“Codes in the space of multisets-coding for permutation channels with impairments,”
Mladen Kovacevic and Vincent Y. F. Tan, · 2018
Later among the works it cites.
High-Dimensional Probability: An Introduction with Applications in Data Science
Roman Vershynin, · 2018
Later among the works it cites.
“Capacity results for the noisy shuffling channel,”
Ilan Shomorony and Reinhard Heckel, · 2019
Later among the works it cites.
“Coding theorems for noisy permutation channels,”
Anuran Makur, · 2020
Later among the works it cites.
“Quantization of random distributions under kl divergence,”
Aviv Adler, Jennifer Tang, and Yury Polyanskiy, · 2021
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Lecture notes on information theory,” class notes for MIT 6.441, 2013-2016
Y. Polyanskiy and Y. Wu, · 2016
Cited alongside, same era.
“DNA fountain enables a robust and efficient storage architecture,”
Yaniv Erlich and Dina Zielinski, · 2016
Cited alongside, same era.
“Fundamental limits of DNA storage systems,”
Reinhard Heckel, Ilan Shomorony, Kannan Ramchandran, and David N. C. Tse, · 2017
Cited alongside, same era.
Divergence Covering
Jennifer Tang, · 2021
Closest in time.
“Lecture notes for statistics 311/electrical engineering 377,”
John Duchi, · 2021
Closest in time.