Results 251 to 260 of about 2,006,345 (293)
Some of the next articles are maybe not open access.

Universal variable length code for DCT coding

Proceedings 2000 International Conference on Image Processing (Cat. No.00CH37101), 2002
A new technique for entropy coding named universal VLC (i.e., UVLC) was developed and applied to the motion vector. It was shown that UVLC for motion vector coding provides good performance in terms of coding efficiency as well as error resiliency. In this paper UVLC for DCT coefficient coding is presented. The features of the scheme are: (1) adaptable
Yuji Itoh, Ngai-Man Cheung
openaire   +2 more sources

Coding the Universe

2022
This paper analyzes the case that the Universe is a result of the hypothesis of the existence of the universe. The Universe is a result of an internal infinity and external infinity, then for an external observer of the Universe we never existed, but for an internal observer, we exist for infinity time.
openaire   +1 more source

Alternating coding for universal variable length code

Proceedings 2003 International Conference on Image Processing (Cat. No.03CH37429), 2004
Variable length code (VLC) is used in a large variety of lossless compression applications. A specially designed VLC, called "universal variable length code" (UVLC), is utilized in the latest video coding standard H.26L under development. In this work we propose a new coding method under the name "alternating coding" (ALT coding) and apply it to the ...
Shang Xue, Bengt Oelmann
openaire   +2 more sources

Universal Hashing and Geometric Codes

Designs, Codes and Cryptography, 1997
A universal class of hash functions is, grosso modo, a collection of hash functions such that a random choice of a function in the set yields a low probability that any two distinct inputs will collide. The concept is due to Carter and Wegman, and has numerous applications. (See the introduction to [\textit{D. R.
openaire   +2 more sources

The genetic code is not universal

BioSystems
Recently, a new genetic code with 62 sense codons, coding for 21 amino acids, and only 2 termination codons has been identified in archaea. The authors argue that the appearance of this variant of the genetic code is due to the relatively recent and complete recoding of all UAG stop codons to codons encoding for pyrrolysine.
openaire   +3 more sources

Universal coding of nonstationary sources

IEEE Transactions on Information Theory, 2000
Summary: We investigate the performance of the Lempel-Ziv incremental parsing scheme on nonstationary sources [\textit{J. Ziv} and \textit{A. Lempel}, ibid. 24, 530-536 (1978; Zbl 0392.94004)]. We show that it achieves the best rate achievable by a finite-state block coder for the nonstationary source.
Karthik Visweswariah   +2 more
openaire   +2 more sources

Quasi-Universal BATS Code

IEEE Transactions on Vehicular Technology, 2017
Batched sparse (BATS) code is a class of temporal network code that achieves near-optimal tradeoff between network throughput and coding length for multi-hop erasure networks. However, the performance of the traditional BATS code degrades dramatically when the designed degree distribution does not match the actual channel condition.
Xiaoli Xu 0001   +3 more
openaire   +2 more sources

On universal LDPC code ensembles

2010 IEEE International Symposium on Information Theory, 2010
A universal design of low-density parity-check (LDPC) code ensembles which enables to operate reliably over various channels is of great theoretical and practical interest. This paper considers the universality of LDPC code ensembles over multitude memoryless binary-input output-symmetric (MBIOS) channels, addressing their universality under belief ...
Igal Sason, Boaz Shuval
openaire   +1 more source

Universal Coding of Zipf Distributions

2003
Background. One of the best known results in information theory says that a data sequence x 1,x 2,...,x n produced by independent random draws from a fixed distribution P over a discrete domain can be compressed into a binary sequence, or code whose expected length is at most nH(P)+1 bits, where H(P) = − ∑ i P i logP i is the entropy of P.
Yoav Freund   +3 more
openaire   +1 more source

Universal coding and universal prediction

Proceedings of IEEE International Symposium on Information Theory, 2002
We consider predicting the next outcome x/sub n+1/ from the past sequence x/sub 1//sup n/, n=0,1...,1 for a given binary sequence x/sub 1//sup /spl infin//. We establish a rigorous framework of universal prediction based on another universal coding which was set up by Davisson.
openaire   +1 more source

Home - About - Disclaimer - Privacy