Results 141 to 150 of about 409,239 (186)
A Novel PTS Technique with Side Information Blind Detector Based on Minimized Error Accumulation for PAPR Reduction in Coded Underwater Acoustic OFDM Systems. [PDF]
Sensors (Basel)Xing S, Wei B, Yu Y, Bai Y, Yin J.
europepmc +1 more source
Preferential Solvation of Zwitterionic Benzo-[f]-Quinolinium Ylids in Binary Solvent Mixtures: Spectral Study and Quantum Chemical Calculations. [PDF]
MoleculesAvadanei MI, Avadanei OG, Dorohoi DO.
europepmc +1 more source
CalVSP: a program for analyzing the molecular surface areas, volumes, and polar surface areas. [PDF]
J CheminformLi Y, Yang D, Shi Q, Zhang W, Sun Q.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Lossless source coding with polar codes
2010 IEEE International Symposium on Information Theory, 2010In this paper lossless compression with polar codes is considered. A polar encoding algorithm is developed and a method to design the code and compute the average compression rate for finite lengths is given. It is shown that the scheme achieves the optimal compression rate asymptotically. Furthermore, the proposed scheme has a very good performance at
HarmS. Cronie, Satish Babu Korada
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.
Guo, Jing +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.
Guo, Jing +2 more
openaire +1 more source
2016
The International Code for Ships Operating in Polar Waters (Polar Code) has been developed to supplement existing IMO instruments in order to provide a more comprehensive set of provisions to address the increased interests and traffic in the polar regions, and the unique operational, environmental and search and rescue concerns peculiar to these ...
openaire +1 more source
The International Code for Ships Operating in Polar Waters (Polar Code) has been developed to supplement existing IMO instruments in order to provide a more comprehensive set of provisions to address the increased interests and traffic in the polar regions, and the unique operational, environmental and search and rescue concerns peculiar to these ...
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
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 ...
J. 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 ...
J. H. Weber +3 more
openaire +1 more source
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