Results 271 to 280 of about 88,443 (295)
Some of the next articles are maybe not open access.
2013 Information Theory and Applications Workshop (ITA), 2013
Balanced bipolar codes consist of sequences in which the symbols ‘−1’ and ‘+1’ appear equally often. Several generalizations to larger alphabets have been considered in literature. For example, for the q-ary alphabet {−q + 1, −q + 3, …, q − 1}, known concepts are symbol balancing, i.e., all alphabet symbols appear equally often in each codeword, and ...
Jos H. Weber +3 more
openaire +1 more source
Balanced bipolar codes consist of sequences in which the symbols ‘−1’ and ‘+1’ appear equally often. Several generalizations to larger alphabets have been considered in literature. For example, for the q-ary alphabet {−q + 1, −q + 3, …, q − 1}, known concepts are symbol balancing, i.e., all alphabet symbols appear equally often in each codeword, and ...
Jos H. Weber +3 more
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
exaly +3 more sources
2015 IEEE International Symposium on Information Theory (ISIT), 2015
Arikan introduced polar codes in 2009 and proved that they achieve the symmetric capacity, under low-complexity successive cancellation decoding, of any binary-input discrete memoryless channel. Arikan's construction is based on the Kronecker product of 2-by-2 matrices and it was extended to larger matrices by Sasoglu et al. in 2010.
Narayanan Rengaswamy, Henry D. Pfister
openaire +1 more source
Arikan introduced polar codes in 2009 and proved that they achieve the symmetric capacity, under low-complexity successive cancellation decoding, of any binary-input discrete memoryless channel. Arikan's construction is based on the Kronecker product of 2-by-2 matrices and it was extended to larger matrices by Sasoglu et al. in 2010.
Narayanan Rengaswamy, Henry D. Pfister
openaire +1 more source
2016 IEEE Asia Pacific Conference on Circuits and Systems (APCCAS), 2016
A variation on channel polarization coding is presented. In standard channel polarization coding the code length is an integral power of two. Our scheme allows modifying the code at the graph definition level to an arbitrary blocklength. Working at the graph definition level of the code enables the utilization of the newly produced codes for every ...
openaire +1 more source
A variation on channel polarization coding is presented. In standard channel polarization coding the code length is an integral power of two. Our scheme allows modifying the code at the graph definition level to an arbitrary blocklength. Working at the graph definition level of the code enables the utilization of the newly produced codes for every ...
openaire +1 more source
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
Nature Reviews Molecular Cell Biology, 2004
Cell polarization is used both to mediate physical fates, as, for example, in orientated cell migration, and to specify differential phenotypic fates, as in the asymmetric division of stem cells. Strikingly, the same sets of conserved proteins are used throughout the Metazoa for these purposes.
openaire +2 more sources
Cell polarization is used both to mediate physical fates, as, for example, in orientated cell migration, and to specify differential phenotypic fates, as in the asymmetric division of stem cells. Strikingly, the same sets of conserved proteins are used throughout the Metazoa for these purposes.
openaire +2 more sources
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
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 +1 more source
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 +1 more source