Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Tillich, Jean-Pierre
and
Zémor, Gilles
1999.
Cryptography and Coding.
Vol. 1746,
Issue. ,
p.
129.
Ashikhmin, A.
Barg, A.
and
Litsyn, S.
2001.
Estimates of the Distance Distribution of Codes and Designs.
Electronic Notes in Discrete Mathematics,
Vol. 6,
Issue. ,
p.
4.
Askikhmin, A.
Barg, A.
and
Litsyn, S.
2001.
Estimates of the distance distribution of codes and designs.
IEEE Transactions on Information Theory,
Vol. 47,
Issue. 3,
p.
1050.
Cohen, Gérard
Krivelevich, Michael
and
Litsyn, Simon
2003.
Communications, Information and Network Security.
p.
33.
Tillich, J.-P.
and
Zemor, G.
2004.
The Gaussian Isoperimetric Inequality and Decoding Error Probabilities for the Gaussian Channel.
IEEE Transactions on Information Theory,
Vol. 50,
Issue. 2,
p.
328.
Ashikhmin, A.E.
Cohen, G.D.
Krivelevich, M.
and
Litsyn, S.N.
2005.
Bounds on Distance Distributions in Codes of Known Size.
IEEE Transactions on Information Theory,
Vol. 51,
Issue. 1,
p.
250.
Rossignol, Raphaël
2007.
Arbitrary Threshold Widths for Monotone, Symmetric Properties.
Journal of Applied Probability,
Vol. 44,
Issue. 1,
p.
164.
Rossignol, Raphaël
2007.
Arbitrary Threshold Widths for Monotone, Symmetric Properties.
Journal of Applied Probability,
Vol. 44,
Issue. 1,
p.
164.
Amraoui, Abdelaziz
Montanari, Andrea
Richardson, Tom
and
Urbanke, RÜdiger
2009.
Finite-Length Scaling for Iteratively Decoded LDPC Ensembles.
IEEE Transactions on Information Theory,
Vol. 55,
Issue. 2,
p.
473.
Kindarji, Bruno
Cohen, Gerard
and
Chabanne, Herve
2010.
On the threshold of Maximum-Distance Separable codes.
p.
1163.
Boucheron, Stéphane
and
Thomas, Maud
2012.
Concentration inequalities for order statistics.
Electronic Communications in Probability,
Vol. 17,
Issue. none,
Mondelli, Marco
Hassani, S. Hamed
and
Urbanke, Rudiger L.
2016.
Unified Scaling of Polar Codes: Error Exponent, Scaling Exponent, Moderate Deviations, and Error Floors.
IEEE Transactions on Information Theory,
Vol. 62,
Issue. 12,
p.
6698.
Kudekar, Shrinivas
Kumar, Santhosh
Mondelli, Marco
Pfister, Henry D.
Şaşoğlu, Eren
and
Urbanke, Rüdiger
2016.
Reed-Muller codes achieve capacity on erasure channels.
p.
658.
Kudekar, Shrinivas
Kumar, Santhosh
Mondelli, Marco
Pfister, Henry D.
Sasoglu, Eren
and
Urbanke, Ridiger L.
2017.
Reed–Muller Codes Achieve Capacity on Erasure Channels.
IEEE Transactions on Information Theory,
Vol. 63,
Issue. 7,
p.
4298.
Ordentlich, Erik
and
Roth, Ron M.
2017.
On the pointwise threshold behavior of the binary erasure polarization subchannels.
p.
859.
Hassani, Hamed
Kudekar, Shrinivas
Ordentlich, Or
Polyanskiy, Yury
and
Urbanke, Rudiger
2018.
Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels.
p.
311.
Ordentlich, Erik
and
Roth, Ron M.
2019.
On the Pointwise Threshold Behavior of the Binary Erasure Polarization Subchannels.
IEEE Transactions on Information Theory,
Vol. 65,
Issue. 10,
p.
6044.
Ye, Min
and
Abbe, Emmanuel
2020.
Recursive Projection-Aggregation Decoding of Reed-Muller Codes.
IEEE Transactions on Information Theory,
Vol. 66,
Issue. 8,
p.
4948.
Hązła, Jan
Samorodnitsky, Alex
and
Sberlo, Ori
2021.
On codes decoding a constant fraction of errors on the BSC.
p.
1479.
Fazeli, Arman
Hassani, Hamed
Mondelli, Marco
and
Vardy, Alexander
2021.
Binary Linear Codes With Optimal Scaling: Polar Codes With Large Kernels.
IEEE Transactions on Information Theory,
Vol. 67,
Issue. 9,
p.
5693.