Results 321 to 330 of about 9,687,121 (384)
The importance of redistribution process of ill-defined deaths in national mortality database. [PDF]
Arch Public HealthScohy A +3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
The rate-distortion function for source coding with side information at the decoder
IEEE Transactions on Information Theory, 1976Let \{(X_{k}, Y_{k}) \}^{ \infty}_{k=1} be a sequence of independent drawings of a pair of dependent random variables X, Y . Let us say that X takes values in the finite set \cal X .
A. Wyner, J. Ziv
semanticscholar +1 more source
Magicoder: Source Code Is All You Need
arXiv.org, 2023We introduce Magicoder, a series of fully open-source (code, weights, and data) Large Language Models (LLMs) for code that significantly closes the gap with top code models while having no more than 7B parameters.
Yuxiang Wei +4 more
semanticscholar +1 more source
IEEE Transactions on Information Theory, 1998
Summary: Lossy coding of speech, high-quality audio, still images, and video is commonplace today. However, in 1948, few lossy compression systems were in service. Shannon introduced and developed the theory of source coding with a fidelity criterion, also called rate-distortion theory.
Toby Berger, Jerry D. Gibson
openaire +2 more sources
Summary: Lossy coding of speech, high-quality audio, still images, and video is commonplace today. However, in 1948, few lossy compression systems were in service. Shannon introduced and developed the theory of source coding with a fidelity criterion, also called rate-distortion theory.
Toby Berger, Jerry D. Gibson
openaire +2 more sources
IEEE Transactions on Information Theory, 1972
Summary: Source encoding techniques based on permutation codes are investigated. For a broad class of distortion measures it is shown that optimum encoding of a source permutation code is easy to instrument even for very long block lengths. Also, the nonparametric nature of permutation encoding is well suited to situations involving unknown source ...
Frederick Jelinek +2 more
openaire +3 more sources
Summary: Source encoding techniques based on permutation codes are investigated. For a broad class of distortion measures it is shown that optimum encoding of a source permutation code is easy to instrument even for very long block lengths. Also, the nonparametric nature of permutation encoding is well suited to situations involving unknown source ...
Frederick Jelinek +2 more
openaire +3 more sources
IEEE Transactions on Information Theory, 2015
Emerging applications including semantic information processing impose priorities on the possible realizations of information sources, so that not all source sequences are important. This paper proposes an initial framework for optimal lossless compression of subsets of the output of a discrete memoryless source (DMS).
Ebrahim MolavianJazi, Aylin Yener
openaire +3 more sources
Emerging applications including semantic information processing impose priorities on the possible realizations of information sources, so that not all source sequences are important. This paper proposes an initial framework for optimal lossless compression of subsets of the output of a discrete memoryless source (DMS).
Ebrahim MolavianJazi, Aylin Yener
openaire +3 more sources
IEEE Transactions on Information Theory, 1982
For a stationary memoryless source, let \(R_c(D)\) be the optimum rate for encoding the source with causal (i.e., non-anticipatory) encoders with respect to a single letter fidelity criterion at the distortion level \(D\), which the authors show to be the same whether block, sliding-block, or finite-state causal encoders are used.
R. Gilbert, David L. Neuhoff
openaire +2 more sources
For a stationary memoryless source, let \(R_c(D)\) be the optimum rate for encoding the source with causal (i.e., non-anticipatory) encoders with respect to a single letter fidelity criterion at the distortion level \(D\), which the authors show to be the same whether block, sliding-block, or finite-state causal encoders are used.
R. Gilbert, David L. Neuhoff
openaire +2 more sources
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 +2 more sources