Results 231 to 240 of about 9,694,734 (272)
Some of the next articles are maybe not open access.

Structural phylogenetics unravels the evolutionary diversification of communication systems in gram-positive bacteria and their viruses

bioRxiv
Recent advances in AI-based protein structure modeling have yielded remarkable progress in predicting protein structures. Since structures are constrained by their biological function, their geometry tends to evolve more slowly than the underlying amino ...
David Moi   +5 more
semanticscholar   +1 more source

Error-Correcting Codes for Combinatorial Composite DNA

International Symposium on Information Theory
Data storage in DNA is developing as a possible solution for archival digital data. Recently, to further increase the potential capacity of DNA-based data storage systems, the combinatorial composite DNA synthesis method was suggested.
Omer Sabary   +5 more
semanticscholar   +1 more source

Multiple-Mode Sparse Superposed Code With Low Block Error Rate for Short Packet URLLC

IEEE Communications Letters
Sparse superposed code (SSC) is one of the most promising techniques to support the ultra-reliable and low-latency communication (URLLC). Compared with the conventional sparse vector code (SVC), quadrature amplitude modulation (QAM) symbols are exploited
Linjie Yang, Pingzhi Fan
semanticscholar   +1 more source

Information rates of stationary ergodic finite-alphabet sources

IEEE Transactions on Information Theory, 1971
The generalized Shannon lower bound to the rate-distortion function R(D) for stationary sources with memory is extended to a wide class of distortion measures involving no symmetry conditions. The lower bound R_{L} (D) is a reasonably simple function of the entropy and marginal probabilities of the source and the per-letter distortion measure ...
openaire   +2 more sources

Deterministic Preparation of Dicke States

International Symposium on Fundamentals of Computation Theory, 2019
The Dicke state $|D_k^n\rangle$ is an equal-weight superposition of all $n$-qubit states with Hamming Weight $k$ (i.e. all strings of length $n$ with exactly $k$ ones over a binary alphabet).
Andreas Bärtschi, S. Eidenbenz
semanticscholar   +1 more source

Optimizing Estimated Directed Information over Discrete Alphabets

2022 IEEE International Symposium on Information Theory (ISIT), 2022
Dor Tsur   +3 more
openaire   +1 more source

Simultaneous Wireless Information and Power Transfer with Finite-Alphabet Inputs

Wireless Personal Communications, 2017
Simultaneous wireless information and power transfer (SWIPT) is a promising solution to carry energy as well as information at the same time for wireless networks. In this paper, we consider a precoding matrix design for multiple-input multiple-output (MIMO) SWIPT systems with finite-alphabet inputs.
Feng Ke   +3 more
openaire   +1 more source

Information divergences and the curious case of the binary alphabet

2014 IEEE International Symposium on Information Theory, 2014
Four problems related to information divergence measures defined on finite alphabets are considered. In three of the cases we consider, we illustrate a contrast which arises between the binary-alphabet and larger-alphabet settings. This is surprising in some instances, since characterizations for the larger-alphabet settings do not generalize their ...
Jiantao Jiao   +4 more
openaire   +1 more source

An application of informational divergence to Huffman codes

IEEE Transactions on Information Theory, 1982
G. Longo, Guglielmo Galasso
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy