A source matching approach to finding minimax codes

No abstract is available for this paper.

• Publication year

  1980

• Venue

  IEEE Transactions on Information Theory

• Publication date

  1980-03-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/TIT.1980.1056167
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Minimax codes for finite alphabets (Corresp.)

  1978cited by this paper
• Random coding strategies for minimum entropy

  1975cited by this paper
• Universal codeword sets and representations of the integers

  1975cited by this paper
• Enumerative source encoding

  1973cited by this paper
• Universal noiseless coding

  1973cited by this paper
• Computation of channel capacity and rate-distortion functions

  1972cited by this paper
• An algorithm for source coding

  1972cited by this paper
• Codes based on inaccurate source probabilities

  1971cited by this paper
• Comments on "Sequence time coading for data compression"

  1966cited by this paper
• Sequence time coding for data compression

  1966cited by this paper

• The Universality Lens: Why Even Highly Over-Parametrized Models Learn Well

  2025cites this paper
• Leave-One-Out Learning with Log-Loss

  2025cites this paper
• Constrained Universal Learning Under Misspecification

  2025cites this paper
• Lossy Compression of Individual Sequences Revisited: Fundamental Limits of Finite-State Encoders

  2024cites this paper
• Combining Batch and Online Prediction

  2024cites this paper
• Permutation Invariant Individual Batch Learning

  2023cites this paper
• Unconditionally Secure Ciphers with a Short Key for a Source with Unknown Statistics

  2023cites this paper
• Markov chain entropy games and the geometry of their Nash equilibria

  2023cites this paper
• A Universal Random Coding Ensemble for Sample-Wise Lossy Compression

  2022cites this paper
• An Information Quantity in Pure State Models

  2022cites this paper
• Sequential prediction under log-loss and misspecification

  2021cites this paper
• A New Code for Encoding All Monotone Sources With a Fixed Large Alphabet Size

  2020cites this paper
• Consistent estimation of the number of regimes in Markov-switching autoregressive models

  2020cites this paper
• Reporting Bayes factors or probabilities to decision makers of unknown loss functions

  2019cites this paper
• Conditional Rényi Divergence Saddlepoint and the Maximization of α-Mutual Information

  2019cites this paper
• Universal Supervised Learning for Individual Data

  2018cites this paper
• Universal Batch Learning with Log-Loss

  2018cites this paper
• Dictionary Learning and Sparse Coding on Statistical Manifolds

  2018cites this paper
• Redundancy Capacity Theorem for On-Line Learning Under a Certain Form of Hypotheses Class

  2018cites this paper
• Tail Redundancy and its Characterization of Compression of Memoryless Sources

  2018cites this paper
• Redundancy of Lossless Data Compression for Known Sources by Analytic Methods

  2017cites this paper
• Exact Minimax Predictive Density Estimation and MDL

  2017cites this paper
• The Rényi Capacity and Center

  2016cites this paper
• The Most Likely Optimal Symmetric RVLC

  2015cites this paper
• Estimation and Compression over Large Alphabets Electrical Engineering (communication Theory and Systems) Efficient Compression of Distributions with a Few Modes . . . . 26

  2015cites this paper
• Electrical Engineering (Communication Theory and Systems)

  2014cites this paper
• On the Structure of the Minimum Average Redundancy Code for Monotone Sources

  2014cites this paper
• Universal Enumerative Coding for Tree Models

  2014cites this paper
• Inference after checking multiple Bayesian models for data conflict and applications to mitigating the influence of rejected priors

  2014cites this paper
• Efficient compression of monotone and m-modal distributions

  2014cites this paper
• Information utility: quantifying the total psychometric information provided by a measure.

  2013cites this paper
• Variable Length Lossless Coding for Variational Distance Class: An Optimal Merging Algorithm

  2012cites this paper
• Game-theoretic probability combination with applications to resolving conflicts between statistical methods

  2012influential citation
• Proceedings of the Fifth Workshop on Information Theoretic Methods in Science and Engineering

  2012cites this paper
• INFORMATION-THEORETIC PROBABILITY COMBINATION WITH APPLICATIONS TO RECONCILING STATISTICAL METHODS

  2012cites this paper
• Results on the redundancy of universal compression for finite-length sequences

  2011cites this paper
• Minimum Redundancy Coding for Uncertain Sources

  2011cites this paper
• Resolving conflicts between statistical methods by probability combination: Application to empirical Bayes analyses of genomic data

  2011influential citation
• Optimal Merging Algorithms for Lossless Codes With Generalized Criteria

  2011cites this paper
• Lossless coding with generalized criteria

  2011cites this paper
• Characterizing the redundancy ofuniversal source coding for finite-length sequences

  2011cites this paper
• Redundancy of exchangeable estimators

  2010cites this paper
• Stochastic complexity, channel capacity, and universal portfolio

  2010cites this paper
• Bayesian predictive densities based on latent information priors

  2010cites this paper
• Universal coding for distributions over co-trees

  2009cites this paper
• Average Redundancy for Known Sources: Ubiquitous Trees in Source Coding

  2008cites this paper
• Universal Coding on Infinite Alphabets: Exponentially Decreasing Envelopes

  2008cites this paper
• Intrinsic methods for optimization problems

  2008cites this paper
• THE MDL PRINCIPLE , PENALIZED LIKELIHOODS , AND STATISTICAL RISK

  2008cites this paper
• Finding minimax codes for discrete and continuous classes of sources

  2007cites this paper
• The Minimum Average Code for Finite Memoryless Monotone Sources

  2007influential citation
• Information Theory at the Service of Science

  2007cites this paper
• Universal Source Coding for Monotonic and Fast Decaying Monotonic Distributions

  2007cites this paper
• Guessing Under Source Uncertainty

  2006cites this paper
• Modèles contextuels et alphabets infinis en théorie de l'information

  2006cites this paper
• Guessing Under Source Uncertainty

  2006cites this paper
• The Average Performance of the Minimax Code

  2006influential citation
• Efficient Shape Indexing Using an Information Theoretic Representation

  2005cites this paper
• Using the KL-center for efficient and accurate retrieval of distributions arising from texture images

  2005cites this paper
• /spl alpha/-parallel prior and its properties

  2005cites this paper
• Robust coding for uncertain sources: a minimax approach

  2005cites this paper
• Asymptotically minimax regret for exponential families

  2005cites this paper
• Fusing probability distributions with information theoretic centers and its application to data retrieval

  2005cites this paper
• Information Theory and Statistics: A Tutorial

  2004cites this paper
• Precise minimax redundancy and regret

  2004cites this paper
• Game theory, maximum entropy, minimum discrepancy and robust Bayesian decision theory

  2004cites this paper
• Exact minimax strategies for predictive density estimation, data compression, and model selection

  2002cites this paper
• The minimum average code for finite memoryless monotone sources

  2002cites this paper
• Análise da Partição Ótima do LZ78

  2001cites this paper
• Model Selection and the Principle of Minimum Description Length

  2001cites this paper
• Some inequalities for information divergence and related measures of discrimination

  2000influential citation
• Information-theoretic determination of minimax rates of convergence

  1999cites this paper
• On the solution of source matching problems

  1999cites this paper
• The Minimum Description Length Principle in Coding and Modeling

  1998cites this paper
• Fifty Years of Shannon Theory

  1998cites this paper
• Asymptotically minimax regret by Bayes mixtures

  1998cites this paper
• Universal Prediction

  1998cites this paper
• MUTUAL INFORMATION, METRIC ENTROPY AND CUMULATIVE RELATIVE ENTROPY RISK

  1997cites this paper
• A general minimax result for relative entropy

  1997influential citation
• Minimax redundancy for the class of memoryless sources

  1997cites this paper
• Asymptotic minimax regret for data compression, gambling, and prediction

  1997cites this paper
• MUTUAL INFORMATION, METRIC ENTROPY, AND RISK IN ESTIMATION OF PROBABILITY DISTRIBUTIONS

  1996cites this paper
• Asymptotic redundancies for universal quantum coding

  1996cites this paper
• Hierarchical universal coding

  1996cites this paper
• Fisher information and stochastic complexity

  1996cites this paper
• rchical Universal CO

  1996cites this paper
• Maxent, Mathematics, and Information Theory

  1996cites this paper
• rmation and Stochastic CO

  1996cites this paper
• A strong version of the redundancy-capacity theorem of universal coding

  1995cites this paper
• On calculating Sakrison's rate distortion function for classes of parameterized sources

  1995cites this paper
• Characterization of the Bayes estimator and the MDL estimator for exponential families

  1995cites this paper
• Jeffreys' prior is asymptotically least favorable under entropy risk

  1994cites this paper
• A relative entropy-based approach to image thresholding

  1994influential citation
• The minimax redundancy is a lower bound for most sources

  1994cites this paper
• Tighter bounds on universal noiseless coding for finite sequences

  1994cites this paper
• Information Bounds for the Risk of Bayesian Predictions and the Redundancy of Universal Codes

  1993cites this paper
• A simple method for calculating the rate distortion function of a source with an unknown parameter

  1993cites this paper
• Source matching problems revisited

  1992cites this paper
• On Numerical Methods of Calculating the Capacity of Continuous-Input Discrete-Output Memoryless Channels

  1990cites this paper
• Two iterative algorithms for finding minimax solutions

  1990cites this paper