A combinatorial approach to Golomb forests

@article{Golin2001ACA,
  title={A combinatorial approach to Golomb forests},
  author={Mordecai J. Golin},
  journal={Theor. Comput. Sci.},
  year={2001},
  volume={263},
  pages={283-304}
}
  • M. Golin
  • Published 28 July 2001
  • Computer Science
  • Theor. Comput. Sci.

Algorithms for infinite huffman-codes

TLDR
The approach is to define an infinite weighted graph with the property that the least cost infinite path in the graph corresponds to the optimal code, and show that even though the graph is infinite, the leastcost infinite path has a repetitive structure and that it is therefore possible to not only find this path but to find it relatively efficiently.

Algorithms for Infinite Huffman-Codes (Extended Abstract)

TLDR
An infinite weighted graph is defined with the property that the least cost infinite path in the graph corresponds to the optimal code and it is shown that even though the graph is infinite, the leastcost infinite path has a repetitive structure and that it is therefore possible to not only find this path but to find it relatively efficiently.

Optimal Prefix Codes for Infinite Alphabets With Nonlinear Costs

  • M. Baer
  • Computer Science
    IEEE Transactions on Information Theory
  • 2008
TLDR
Methods for finding codes optimal for beta-exponential means are introduced and one method applies to geometric distributions, while another applies to distributions with lighter tails and both are extended to alphabetic codes.

Infinite-Alphabet Prefix Codes Optimal for ß-Exponential Penalties

  • M. Baer
  • Computer Science
    2007 IEEE International Symposium on Information Theory
  • 2007
TLDR
Methods for finding codes optimal for beta-exponential means are introduced, one of which applies to geometric distributions, while another applies to distributions with lighter tails, and both are extended to minimizing maximum pointwise redundancy.

Infinite-Alphabet Prefix Codes Optimal for beta-Exponential Penalties

TLDR
Methods for finding codes optimal for exponential means of Poisson distributions are introduced, one of which applies to geometric distributions, while another applies to distributions with lighter tails.

IT ] 1 N ov 2 00 5 Integer Coding with Nonlinear Costs

TLDR
Algorithms for finding integer codes o ptimal for β-exponential means, which applies to geometric distributions, while another applies to distr ibutions with lighter tails, and both are extended to alphabeti c codes.

Run-Length Encoding in a Finite Universe

TLDR
A simple code is arrived at that allows computing a codeword using only $O(1)$ simple computer operations and machine words, and it is demonstrated experimentally that the resulting representation length is very close to the optimal Huffman code, to the extent that the expected difference is practically negligible.

Automates, énumération et algorithmes

Ces travaux s'inscrivent dans le cadre general de la theorie des automates, de la combinatoire des mots, de la combinatoire enumerative et de l'algorithmique. Ils ont en commun de traiter des

On the Optimal Pairwise Group Testing Algorithm

TLDR
An exhaustive characterization of probabilistic PTA properties is provided by providing an empirical characterization of the basic probabilism properties of the Pairwise Testing Algorithm.

References

SHOWING 1-10 OF 16 REFERENCES

Optimal source codes for geometrically distributed integer alphabets (Corresp.)

An approach is shown for using the Huffman algorithm indirectly to prove the optimality of a code for an infinite alphabet if an estimate concerning the nature of the code can be made. Attention is

Existence of optimal prefix codes for infinite source alphabets

It is proven that for every random variable with a countably infinite set of outcomes and finite entropy there exists an optimal prefix code which can be constructed from Huffman codes for truncated

Huffman coding with an infinite alphabet

TLDR
Two new concepts of the optimality of a prefix D-ary code are introduced, which are shown to be equivalent to that defined in the traditional way for the case where the Shannon entropy H(P) diverges.

Huffman-type codes for infinite source distributions

  • J. Abrahams
  • Computer Science
    Proceedings of IEEE Data Compression Conference (DCC'94)
  • 1994
A new sufficient condition is given for an infinite source distribution to share a minimum average codeword length code with a geometric distribution. Thus some new examples of parametric families of

Optimal source coding for a class of integer alphabets (Corresp.)

  • P. Humblet
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1978
TLDR
The Huffman optimum encoding technique is extended to a class of p(i) including thosewhose tail decreases including those whose tail decreases.

On Finding a Single Defective in Binomial Group Testing

Abstract Kumar and Sobel studied the problem of finding a single defective in an infinite binomial population by group testing. Let E(T) denote the minimum expected number of group tests needed to

A Dichotomous Search for a Geometric Random Variable

TLDR
This paper shows how to compute efficiently and how to approximate the optimal strategy for finding the exact transition time of a two-state system and applications to the problem arise in the areas of quality control and maintenance of communication and supply lines.

A method for the construction of minimum-redundancy codes

  • D. Huffman
  • Computer Science, Business
    Proceedings of the IRE
  • 1952
TLDR
A minimum-redundancy code is one constructed in such a way that the average number of coding digits per message is minimized.

On optimal nested group testing algorithms

Run-length encodings.

TLDR
Run-length encodings are used for determining explicit form of Huffman coding when applied to geometric distribution in the context of discrete geometry.