Results 171 to 180 of about 524,250 (218)
Some of the next articles are maybe not open access.
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.
J D Gibson
exaly +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.
J D Gibson
exaly +2 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 +1 more source
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 +1 more source
Source coding for dependent sources
2012 IEEE Information Theory Workshop, 2012In this work, we address the capacity region of multi-source multi-terminal network communication problems, and study the change in capacity when one moves form independent to dependent source information. Specifically, we ask whether the trade off between capacity and source independence is of continuous nature.
Michael Langberg, Michelle Effros
openaire +1 more source
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
2011 IEEE International Symposium on Information Theory Proceedings, 2011
A coding problem, over a slotted system, is introduced where the sender has to transmit one out of several packets to the receiver, but learns the request only at the beginning of each slot with prior statistical information about which packet is needed at the receiver.
Onur Güngör 0002 +3 more
openaire +1 more source
A coding problem, over a slotted system, is introduced where the sender has to transmit one out of several packets to the receiver, but learns the request only at the beginning of each slot with prior statistical information about which packet is needed at the receiver.
Onur Güngör 0002 +3 more
openaire +1 more source
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.
David L. Neuhoff, R. Kent Gilbert
openaire +1 more source
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.
David L. Neuhoff, R. Kent Gilbert
openaire +1 more source
2009 IEEE International Symposium on Information Theory, 2009
We show that any comparison-based merging algorithm can be naturally mapped into a source coder via a conversion function introduced here. By applying this function over some well known merging algorithms, namely Binary Merging and Recursive Merging, we show that they are closely related to a runlength-based coder with Rice coding and to the Binary ...
Bruno Tenório Ávila +1 more
openaire +1 more source
We show that any comparison-based merging algorithm can be naturally mapped into a source coder via a conversion function introduced here. By applying this function over some well known merging algorithms, namely Binary Merging and Recursive Merging, we show that they are closely related to a runlength-based coder with Rice coding and to the Binary ...
Bruno Tenório Ávila +1 more
openaire +1 more source
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 ...
Toby Berger +2 more
openaire +2 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 ...
Toby Berger +2 more
openaire +2 more sources
Proceedings of the ITI 2009 31st International Conference on Information Technology Interfaces, 2009
Learning programming languages and developing software is important part of curricula at many educational institutions. Directly connected to that is a peer-to-peer sharing of program's source codes which is not always allowed. The article discusses the problem of plagiarism, especially the source code plagiarism and presents an excerpt of the results ...
Dejan Sraka, Branko Kaucic
openaire +1 more source
Learning programming languages and developing software is important part of curricula at many educational institutions. Directly connected to that is a peer-to-peer sharing of program's source codes which is not always allowed. The article discusses the problem of plagiarism, especially the source code plagiarism and presents an excerpt of the results ...
Dejan Sraka, Branko Kaucic
openaire +1 more source
IEEE Transactions on Information Theory, 1971
The encoding of a source whose probability distribution varies arbitrarily from letter to letter is considered. The problem is formulated as a two-person statistical game. The exponential rate of growth with block length of the minimum number of codewords needed to achieve a specified fidelity with respect to a single-letter distortion measure is ...
openaire +2 more sources
The encoding of a source whose probability distribution varies arbitrarily from letter to letter is considered. The problem is formulated as a two-person statistical game. The exponential rate of growth with block length of the minimum number of codewords needed to achieve a specified fidelity with respect to a single-letter distortion measure is ...
openaire +2 more sources