Results 241 to 250 of about 87,888 (259)
Some of the next articles are maybe not open access.
A study on channel polarization and polar coding
2011 9th IEEE International Conference on ASIC, 2011In 2006, Arikan introduced the method of channel polarization on which one can construct efficient capacity-achieving codes, called polar codes, for any binary discrete memoryless channel (B-DMC). In this letter, we will give a description of the main ideas and mechanisms of this kind of codes.
Yichao Lu, Satoshi Goto
openaire +1 more source
IEEE Transactions on Information Theory, 2015
An optimization algorithm for finding a shortening pattern and a set of frozen symbols for polar codes is proposed. The structure of polar codes is exploited to eliminate many equivalent shortening patterns, thus reducing the search space. A reduced-complexity suboptimal algorithm is proposed for finding shortening patterns for long polar codes ...
openaire +1 more source
An optimization algorithm for finding a shortening pattern and a set of frozen symbols for polar codes is proposed. The structure of polar codes is exploited to eliminate many equivalent shortening patterns, thus reducing the search space. A reduced-complexity suboptimal algorithm is proposed for finding shortening patterns for long polar codes ...
openaire +1 more source
Polar-Code Construction of Golay Codes
IEEE Communications Letters, 2018This letter proposes a reinterpretation of the classical binary Golay codes as Polar codes with additional inner permutations and puncturing. This establishes a novel relationship between algebraic codes and codes based on Kronecker products, like polar codes.
Valerio Bioglio, Ingmar Land
openaire +3 more sources
2013 IEEE International Symposium on Information Theory, 2013
We study a family of polar codes whose frozen set is such that it discards the bit channels for which the mutual information falls below a certain (fixed) threshold. We show that if the threshold, which might depend on the code length, is bounded appropriately, a coding theorem can be proved for the underlying polar code.
Jing Guo +2 more
openaire +2 more sources
We study a family of polar codes whose frozen set is such that it discards the bit channels for which the mutual information falls below a certain (fixed) threshold. We show that if the threshold, which might depend on the code length, is bounded appropriately, a coding theorem can be proved for the underlying polar code.
Jing Guo +2 more
openaire +2 more sources
Design of Polar Codes in 5G New Radio
IEEE Communications Surveys and Tutorials, 2021Valerio Bioglio +2 more
exaly
Polar Codes and Their Quantum-Domain Counterparts
IEEE Communications Surveys and Tutorials, 2020Zeynep B Kaykac Eğilmez +2 more
exaly
The Development, Operation and Performance of the 5G Polar Codes
IEEE Communications Surveys and Tutorials, 2020Zeynep B Kaykac Eğilmez +2 more
exaly
Practical Product Code Construction of Polar Codes
IEEE Transactions on Signal Processing, 2020Valerio Bioglio +2 more
exaly