Results 271 to 280 of about 182,933 (316)

Optimal Prefix Codes And Huffman Codes

International Journal of Computer Mathematics, 2003
Existence of the optimal prefix codes is shown in this paper. Relationship between the optimal prefix code and the Huffman code is also discussed. We prove that all Huffman codes are optimal prefix codes and conversely optimal prefix codes need not be Huffman codes.
Dongyang Long, Weijia Jia 0001, Ming Li 0002   +2 more
openaire   +1 more source

On the Optimal Coding

2001
Novel coding schemes are introduced and relationships between optimal codes and Huffman codes are discussed. It is shown that, for finite source alphabets, the Huffman coding is the optimal coding, and conversely the optimal coding needs not to be the Huffman coding.
Dongyang Long, Weijia Jia 0001
openaire   +1 more source

Optimization and the genetic code

Origins of life and evolution of the biosphere, 1989
The present paper will focus on the relation between the structure of the table of the genetic code and the evolution of primitive organisms: it will be shown that the organization of the code table according to an optimization principle based on the notion of resistance to errors can provide a criterium for selection. The ordered aspect of the genetic
openaire   +2 more sources

Optimal codes as Tanner codes with cyclic component codes

Designs, Codes and Cryptography, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tom Høholdt, Fernando Piñero, Peng Zeng 0002   +2 more
openaire   +2 more sources

Simple code optimizations

Software: Practice and Experience, 1983
AbstractProgram optimization has received a great deal of attention for many years, which has resulted in numerous advances in compiler technology. The effectiveness of various simple optimizations has received comparably little attention during the same time period.
openaire   +2 more sources

Optimal Coding and Sampling of Triangulations

Algorithmica, 2003
We present a bijection between the set of plane triangulations (aka. maximal planar graphs) and a simply defined subset of plane trees with two leaves per inner node. The construction takes advantage of the minimal realizer (or Schnyder tree decomposition) of a plane triangulation. This yields a simple interpretation of the formula for the number of
Poulalhon, Dominique, Schaeffer, Gilles
openaire   +2 more sources

Optimal codes (Corresp.)

IEEE Transactions on Information Theory, 1969
Some known results on the nonexistence of linear optimal codes can be very easily proved using results on the weight distribution of such codes.
openaire   +1 more source

Optimization of the Genetic Code

Nature, 1967
THE Atlas of Protein Sequence and Structure compiled by Eck and Dayhoff1 provides an opportunity for preliminary statistical examinations of aspects of the genetic code.
openaire   +2 more sources

Some Topics in Code Optimization

Journal of the ACM, 1974
Many compilers for higher order languages attempt to translate the source code into “good” object code. Cocke and Schwartz have described an algorithm for discovering when the computation of an expression is redundant (common), and when it can be moved to a less frequently executed region of the program.
openaire   +2 more sources

Optimization principles for the neural code

Network: Computation in Neural Systems, 1996
Recent experiments show that the neural codes at work in a wide range of creatures share some common features. At first sight, these observations seem unrelated. However, we show that these features arise naturally in a linear filtered threshold crossing model when we set the threshold to maximize the transmitted information.
openaire   +4 more sources