The following pages link to John Cronan Kieffer (Q1136154):
Displayed 33 items.
- Markov Channels are Asymptotically Mean Stationary (Q3931170) (← links)
- (Q3931305) (← links)
- The Pointwise Ergodic Theorem for Transformations whose Orbits contain or are contained in the Orbits of a Measure-Preserving Transformation (Q3933202) (← links)
- Asymptotically mean stationary channels (Q3942879) (← links)
- Stochastic stability for feedback quantization schemes (Q3955264) (← links)
- The Lebesgue Integral as the Almost Sure Limit of Random Riemann Sums (Q3961711) (← links)
- (Q4011278) (← links)
- A general formula for the capacity of stationary nonanticipatory channels (Q4044446) (← links)
- On the optimum average distortion attainable by fixed-rate coding of a nonergodic source (Q4053475) (← links)
- A lower bound on the probability of decoding error for the finite-state channel (Corresp.) (Q4054913) (← links)
- (Q4057079) (← links)
- On sliding block coding for transmission of a source over a stationary nonanticipatory channel (Q4140860) (← links)
- A generalization of the Pursley-Davisson- Mackenthun universal variable-rate coding theorem (Q4145595) (← links)
- Block coding for an ergodic source relative to a zero-one valued fidelity criterion (Q4166684) (← links)
- A unified approach to weak universal source coding (Q4177462) (← links)
- Variable-length source coding with a cost depending only on the code word length (Q4182410) (← links)
- Strongly consistent code-based identification and order estimation for constrained finite-state model classes (Q4277148) (← links)
- A survey of the theory of source coding with a fidelity criterion (Q4307360) (← links)
- Ergodic behavior of graph entropy (Q4340894) (← links)
- On the redundancy of the fixed-database Lempel-Ziv algorithm for φ-mixing sources (Q4345604) (← links)
- On the performance of data compression algorithms based upon string matching (Q4392484) (← links)
- Universal lossless compression via multilevel pattern matching (Q4501756) (← links)
- Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform. I. Without context models (Q4503584) (← links)
- Grammar-based codes: a new class of universal lossless source codes (Q4503585) (← links)
- Universal lossless data compression with side information by using a conditional MPM grammar transform (Q4544660) (← links)
- An entropy equidistribution property for a measurable partition under the action of an amenable group (Q4769690) (← links)
- Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity (Q4879987) (← links)
- Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm (Q4880007) (← links)
- A Covering Theorem (Q5181918) (← links)
- Solution of an Equation in a Linear Algebra by Means of the Minimal Polynomial (Q5577241) (← links)
- (Q5666449) (← links)
- Strong converses in source coding relative to a fidelity criterion (Q5753869) (← links)
- Sample converses in source coding theory (Q5753870) (← links)