Results 241 to 250 of about 184,294 (277)
Some of the next articles are maybe not open access.
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
Minimum Polarized Distance Codes
IBM Journal of Research and Development, 1961The choice of a code for a given application is influenced by many factors, such as economics, compatibility, and reliability. This paper is concerned solely with the reliability of codes, and shows how, for a given number of bits per character and a given minimum distance, the probability of undetected error in an asymmetric channel may be reduced by ...
openaire +2 more sources
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
1989
Abstract : The POLAR code was written to model charging by large spacecraft in low, polar orbit. This report documents comparisons of POLAR code calculations with flight experiments. Calculations of the plasma wake behind the Shuttle Orbiter are compared with the situ measurements of Murphy et al. 1989. Calculations of the charging of DMSP-7, performed
null T. T. +5 more
openaire +1 more source
Abstract : The POLAR code was written to model charging by large spacecraft in low, polar orbit. This report documents comparisons of POLAR code calculations with flight experiments. Calculations of the plasma wake behind the Shuttle Orbiter are compared with the situ measurements of Murphy et al. 1989. Calculations of the charging of DMSP-7, performed
null T. T. +5 more
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
High-density switchable skyrmion-like polar nanodomains integrated on silicon
Nature, 2022Lu Han +2 more
exaly
The fundamentals and applications of ferroelectric HfO2
Nature Reviews Materials, 2022Uwe Schroeder +2 more
exaly