Next Article in Journal
The Influence of Shape on Parallel Self-Assembly
Next Article in Special Issue
Equiprobability, Entropy, Gamma Distributions and Other Geometrical Questions in Multi-Agent Systems
Previous Article in Journal
Economies Evolve by Energy Dispersal
Previous Article in Special Issue
Landauer’s Principle and Divergenceless Dynamical Systems
Open AccessArticle

A Lower-Bound for the Maximin Redundancy in Pattern Coding

CNRS, Telecom ParisTech, Laboratoire Laboratoire Traitement et Communication de l’Information, 75013 Paris, France
Entropy 2009, 11(4), 634-642;
Received: 1 September 2009 / Accepted: 20 October 2009 / Published: 22 October 2009
(This article belongs to the Special Issue Information and Entropy)
We show that the maximin average redundancy in pattern coding is eventually larger than 1.84 (n/log n)1/3 for messages of length n. This improves recent results on pattern redundancy, although it does not fill the gap between known lower- and upper-bounds. The pattern of a string is obtained by replacing each symbol by the index of its first occurrence. The problem of pattern coding is of interest because strongly universal codes have been proved to exist for patterns while universal message coding is impossible for memoryless sources on an infinite alphabet. The proof uses fine combinatorial results on partitions with small summands. View Full-Text
Keywords: universal coding; pattern; minimax universal coding; pattern; minimax
Show Figures

Figure 1

MDPI and ACS Style

Garivier, A. A Lower-Bound for the Maximin Redundancy in Pattern Coding. Entropy 2009, 11, 634-642.

AMA Style

Garivier A. A Lower-Bound for the Maximin Redundancy in Pattern Coding. Entropy. 2009; 11(4):634-642.

Chicago/Turabian Style

Garivier, Aurélien. 2009. "A Lower-Bound for the Maximin Redundancy in Pattern Coding" Entropy 11, no. 4: 634-642.

Find Other Styles

Article Access Map by Country/Region

Only visits after 24 November 2015 are recorded.
Search more from Scilit
Back to TopTop