Polar codes: Characterization of exponent, bounds, and constructions
By Satish Babu Korada, Eren Sasoglu, Rüdiger L. Urbanke. 2009 IEEE International Symposium on Information Theory, 2009
303 citations recorded by the source corpus.
Subfields: Computer Networks and Communications, Electrical and Electronic Engineering, Molecular Biology
View Paper: https://www.semanticscholar.org/paper/44823a9b7c1944e39440ae83c57036000eb6c5e4
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
- E. Arıkan
- Alexander Vardy
- Ido Tal
- Peter Vladimirovich Trifonov
- Emre Telatar
- Hessam Mahdavifar
- Kai Niu
- Kai Chen
In Electrical and Electronic Engineering
- E. Arıkan
- Alexander Vardy
- Ido Tal
- Peter Vladimirovich Trifonov
- Hessam Mahdavifar
- Helmut Bölcskei
- Andrea J. Goldsmith
- Giuseppe Caire
In Molecular Biology
- E. Arıkan
- Alexander Vardy
- Ido Tal
- Peter Vladimirovich Trifonov
- Emre Telatar
- Hessam Mahdavifar
- Kai Niu
- Kai Chen
Citations in the corpus
- On the rate of channel polarization (2008, background): “The following result was proved in [4].”
- List decoding of polar codes (2011, background): “Their probability of error is known to approach O (2 −√ n ) [2], with generalizations giving even better asymptotic results [3].”
- Efficient Design and Decoding of Polar Codes (2012, background): “Classes of polar codes with high error exponents were proposed in [2], [3].”
- A Semi-Parallel Successive-Cancellation Decoder for Polar Codes (2013, unknown): “An SC decoder architecture containing only N node processors and 2 N memory elements was detailed.”
- Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes (2010, methodology): “With a slight abuse of notation, we will follow [3], [4], and [20] and simply write to denote a BSM channel .”