Results 181 to 190 of about 524,250 (218)
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
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 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
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
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
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
Computer, 2016
Tech companies required to comply with controversial regulations in foreign countries as a cost of doing business there must trade off the potential economic benefits with the risk of long-term harm.
openaire +1 more source
Tech companies required to comply with controversial regulations in foreign countries as a cost of doing business there must trade off the potential economic benefits with the risk of long-term harm.
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
Distributed Source Coding Using Raptor Codes for Hidden Markov Sources
IEEE Transactions on Signal Processing, 2008Interest in distributed source coding (DSC) has increased in recent years due to the development of wireless networks. In this paper we propose a solution based on a new rateless class of codes, the Raptor codes. In real applications (where the data source length and the correlation between the sources may vary), rateless codes can be naturally adapted
Maria Fresia +2 more
openaire +1 more source
Coding Combinatorial Sources With Costs
IEEE Transactions on Information Theory, 2003Summary: We consider coding infinite sequences of a finite alphabet. The source is defined as a set of sequences (combinatorial source). The problem is to minimize the worst asymptotic compression ratio between each sequence and its coding output among the sequences in the combinatorial source.
Joe Suzuki, Boris Ryabko
openaire +1 more source