Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,378,627 papers from all fields of science
Search
Sign In
Create Free Account
Polar code (coding theory)
Known as:
Polar code
, Polar code (telecommunication)
In information theory, a polar code is a linear block error correcting code developed by Erdal Arıkan. It is the first code with an explicit…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Additive white Gaussian noise
Binary erasure channel
Binary symmetric channel
Forward error correction
Expand
Broader (2)
Coding theory
Error detection and correction
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Decoder Partitioning: Towards Practical List Decoding of Polar Codes
Seyyed Ali Hashemi
,
Marco Mondelli
,
S. H. Hassani
,
C. Condo
,
Rüdiger L. Urbanke
,
Warren J. Gross
IEEE Transactions on Communications
2018
Corpus ID: 52290273
Polar codes represent one of the major recent breakthroughs in coding theory and, because of their attractive features, they have…
Expand
2017
2017
Binary Linear Codes with Optimal Scaling: Polar Codes with Large Kernels
Arman Fazeli
,
Hamed Hassani
,
Marco Mondelli
,
A. Vardy
Information Theory Workshop
2017
Corpus ID: 52892587
We prove that, at least for the binary erasure channel, the polar-coding paradigm gives rise to codes that not only approach the…
Expand
2016
2016
Construction of polar codes with sublinear complexity
Marco Mondelli
,
S. Hassani
,
R. Urbanke
,
ruediger. urbanke
International Symposium on Information Theory
2016
Corpus ID: 15713296
Consider the problem of constructing a polar code of block length N for the transmission over a given channel W. Typically this…
Expand
Highly Cited
2015
Highly Cited
2015
List Decoding of Polar Codes
I. Tal
,
A. Vardy
IEEE Transactions on Information Theory
2015
Corpus ID: 47180616
We describe a successive-cancellation list decoder for polar codes, which is a generalization of the classic successive…
Expand
Highly Cited
2011
Highly Cited
2011
Polar codes for q-ary channels, q =2r
Woomyoung Park
,
A. Barg
IEEE International Symposium on Information…
2011
Corpus ID: 14663572
We study polarization for nonbinary channels with input alphabet of size q = 2r, r = 2,3,.... Using Arikan's polarizing kernel H2…
Expand
Highly Cited
2010
Highly Cited
2010
Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes
Hessam Mahdavifar
,
A. Vardy
IEEE Transactions on Information Theory
2010
Corpus ID: 1438075
Suppose that Alice wishes to send messages to Bob through a communication channel C1, but her transmissions also reach an…
Expand
Highly Cited
2010
Highly Cited
2010
An empirical scaling law for polar codes
Satish Babu Korada
,
A. Montanari
,
E. Telatar
,
R. Urbanke
IEEE International Symposium on Information…
2010
Corpus ID: 15443794
Using scaling laws, we obtain estimates of the block error probability of polar codes under successive cancellation decoding. For…
Expand
Highly Cited
2010
Highly Cited
2010
Polar Codes for the Two-User Multiple-Access Channel
Eren Sasoglu
,
E. Telatar
,
E. Yeh
IEEE Transactions on Information Theory
2010
Corpus ID: 5469273
Arikan's polar coding method is extended to two-user multiple-access channels. It is shown that if the two users of the channel…
Expand
Highly Cited
2010
Highly Cited
2010
Secrecy-achieving polar-coding
Eran Hof
,
S. Shamai
IEEE Information Theory Workshop
2010
Corpus ID: 18811906
A polar coding scheme is suggested for the binary-input memoryless symmetric and degraded wire-tap channel. The provided scheme…
Expand
Highly Cited
2009
Highly Cited
2009
Performance and construction of polar codes on symmetric binary-input memoryless channels
R. Mori
,
Toshiyuki Tanaka
IEEE International Symposium on Information…
2009
Corpus ID: 2129348
Channel polarization is a method of constructing capacity achieving codes for symmetric binary-input discrete memoryless channels…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE
or Only Accept Required