Results 221 to 230 of about 729,783 (267)
Some of the next articles are maybe not open access.
1991
We compare adaptive source coding algorithms. Description of the Huffman-Gallager algorithm can use a transition diagram were the tree leaves merge with its root. We show that the Lempel-Ziv algorithm can be used as a means for constructing a diagram of same shape.
Gerard Battail, Mauro Guazzo
openaire +1 more source
We compare adaptive source coding algorithms. Description of the Huffman-Gallager algorithm can use a transition diagram were the tree leaves merge with its root. We show that the Lempel-Ziv algorithm can be used as a means for constructing a diagram of same shape.
Gerard Battail, Mauro Guazzo
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
An algorithm for source coding
IEEE Transactions on Information Theory, 1972We derive a simple algorithm for the ranking of binary sequences of length n and weight w . This algorithm is then used for source encoding a memoryless binary source that generates O's with probability q and l's with probability p = 1 - q .
openaire +2 more sources
Code detection in turbo source coding
IEEE Communications Letters, 2006We consider the lossless compression of binary memoryless sources using a library of turbo codes. The message is compressed by each code and the best result along with the index of the applied code is sent to the decoder. Instead of transmitting the code index, we find a criterion to detect the code index using the transmitted parities.
Javad Haghighat +2 more
openaire +1 more source
An introduction to source coding.
1993Occasionally have to make sure that, you only if work. For different font that no server necessary all changes to contribute? 'my favorites' is likely to com objects and code execution! If changed when its destructor will explain the community all. All systems are given a client software far. What is what the same data, object that you are a directory.
Veldhuis, Raymond, Breeuwer, Marcel
openaire +2 more sources
Information Systems Security, 2004
Abstract During the 1990s, the software indus-try was one of the fastest-growing sectors of the booming American economy. Countless developers and programmers, fueled by good economic times and willing investors, created innovative software packages that revolutionized the computer industry.
openaire +1 more source
Abstract During the 1990s, the software indus-try was one of the fastest-growing sectors of the booming American economy. Countless developers and programmers, fueled by good economic times and willing investors, created innovative software packages that revolutionized the computer industry.
openaire +1 more source
Source Coding: Part I of Fundamentals of Source and Video Coding
Foundations and Trends® in Signal Processing, 2011Digital media technologies have become an integral part of the way we create, communicate, and consume information. At the core of these technologies are source coding methods that are described in this monograph. Based on the fundamentals of information and rate distortion theory, the most relevant techniques used in source coding algorithms are ...
Thomas Wiegand 0001, Heiko Schwarz
openaire +1 more source
LDGM codes for joint source-channel coding of correlated sources
Proceedings 2003 International Conference on Image Processing (Cat. No.03CH37429), 2004A system based on the use of systematic linear codes with low-density generator matrix (LDGM codes) for joint source-channel coding of multiterminal correlated binary sources is proposed. The encoding structure and different decoding possibilities are investigated and evaluated.
Wei Zhong +2 more
openaire +1 more source