Numerical code for finite-blocklength research: "SPECTRE: Short packet communication toolbox," GitHub repository, Dec 2014.
Curious? Check manual.pdf (for up-to-date version: git clone; cd documentation; make manual.pdf)
Z. Goldfeld and Y. Polyanskiy, "The information bottleneck problem and its applications in machine learning,"
IEEE Journal on Selected Areas in Information Theory, vol. 1, no. 1, pp. 19--38, Apr. 2020;
also
arXiv:2004.14941, Apr. 2020
A. Makur, E. Mossel and Y. Polyanskiy, "Broadcasting on bounded degree DAGs," arxiv:1803.07527, Mar. 2018. NOTE: This earlier draft was subsequently split into two papers, see part 1 and part 2.
N. Alon, B. Bukh, and Y. Polyanskiy, "List-decodable zero-rate codes,"
IEEE Trans. Inf. Theory, vol. 65, no. 3, pp. 1657--1667, Mar. 2019;
also
arxiv:1710.10663, Oct. 2017 (updated May 2018).
Y. Polyanskiy, A. T. Suresh and Y. Wu, "Sample complexity of population recovery," Proc. Conf. On Learning Theory (COLT-2017), Jul. 2017 ; also arxiv:1702.05574, Feb. 2017.
Errata (Apr 2020): Earlier versions (incl. the one in proceedings) had a mistake in Prop. 9 that propagated to Theorem 1 (lower bound) and Lemma 12.
Y. Polyanskiy, H. V. Poor and S. Verdú,
"Channel coding rate in the finite blocklength regime,"
IEEE Trans. Inf. Theory, vol. 56, no. 5, pp. 2307-2359, May 2010.
Errata: In (175) the upper limit of summation should be (ℓ-1). (Thanks D. Divsalar!).
Analysis of case 1 in Theorem 48 has a gap, fixed by Cao and Tomamichel.
V. Gorokhov, G. Popelnukha, G. Polyanskiy, Y. Polyanskiy, V. Tsukanov,
"Switchboard for managing submersible electric motor,"
Russian Federation Patent N 31061 (RU), Jul. 10, 2003.
J. Tang and Y. Polyanskiy,
"Capacity of noisy permutation channels,"
2022 IEEE Int. Symp. Inf. Theory (ISIT), Espoo, Finland, Jun. 2022 (Best student paper award).
A. Adler, J. Tang and Y. Polyanskiy,
"Quantization of random distributions under KL divergence,"
2021 IEEE Int. Symp. Inf. Theory (ISIT), Melbourne, Australia, Jul. 2021
Errata: In Theorem 1 constants c1 and c2 should depend on alpha; typos in the proof of Prop. 7; Lemma 2(iii) applies to uniform p
A. Makur, E. Mossel and Y. Polyanskiy,
"Reconstruction on 2D regular grids,"
2021 IEEE Int. Symp. Inf. Theory (ISIT), Melbourne, Australia, Jul. 2021
A. Collins and Y. Polyanskiy,
"Dispersion of the coherent MIMO block-fading channel,"
2016 IEEE Int. Symp. Inf. Theory (ISIT), Barcelona, Spain, Jul. 2016.
Errata: Proposition 3 is incorrect. There are many caids, but for all of them entries are pairwise independent. Consequently, they all achieve the same dispersion. See the journal version for details.
G. Ajjanagadde and Y. Polyanskiy,
"Adder MAC and estimates for Rényi entropy,"
53rd Allerton Conference 2015, Allerton Retreat Center, Monticello, IL, USA, Oct. 2015.
A. Collins, Y. Polyanskiy,
"Orthogonal designs optimize achievable dispersion for coherent MISO channels,"
2014 IEEE Int. Symp. Inf. Theory (ISIT), Honolulu, Hawaii, Jul 2014.
Errata: Proposition 1 erroneously claims that any caid is necessarily jointly Gaussian. In truth, only rows/columns of the caid are guaranteed to be jointly Gaussian. Consequently, proof of Theorem 6 needs to be modified slightly to account for non-jointly Gaussian caids.
A. Mazumdar, Y. Polyanskiy, B. Saha,
"On Chebyshev radius of a set in Hamming space and the closest string problem,"
2013 IEEE Int. Symp. Inf. Theory (ISIT), Istanbul, Turkey, Jul 2013.
Errata: Results in Section II.A (in particular Theorem 1) are correct, but trivial: taking set S to be the entire space shows Jung constant of Hamming space equals 2 for all dimensions n.
A. Andoni, H. L. Nguyen, Y. Polyanskiy, Y. Wu,
"Tight lower bound for linear sketches of moments,"
40th Internat. Coll. Automata, Languages, and Programming (ICALP-2013),
Riga, Latvia, Jul 2013.
Y. Polyanskiy and S. Verdú,
"Arimoto channel coding converse and Rényi divergence,"
48th Allerton Conference 2010, Allerton Retreat Center, Monticello, IL, USA, Sep. 2010.
Errata: Typo in Theorem 5.1. The correct version is "concave in P_X and convex in P_{Y|X}". (Thanks Siu-Wai Ho!)
Y. Polyanskiy, H. V. Poor and S. Verdú,
"New channel coding achievability bounds,"
2008 IEEE Int. Symp. Inf. Theory (ISIT), Toronto, Canada, Jun. 2008 (Best student paper award).