The following pages link to Jacob Ziv (Q1346719):
Displaying 50 items.
- On encoding and decoding with two-way head machines (Q1346720) (← links)
- (Q1389277) (redirect page) (← links)
- Inequalities and algorithms for universal data compression (Q1389278) (← links)
- (Q3033695) (← links)
- (Q3033696) (← links)
- Coding theorems for individual sequences (Q3206858) (← links)
- Fixed-rate encoding of individual sequences with side information (Q3328440) (← links)
- A Bayesian approach for classification of Markov sources (Q3361698) (← links)
- Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression (Q3472037) (← links)
- Two-dimensional encoding by finite-state encoders (Q3472039) (← links)
- Variable-to-fixed length codes are better than fixed-to-variable length codes for Markov sources (Q3487279) (← links)
- On the Wyner-Ziv problem for individual sequences (Q3547389) (← links)
- Extremes of Information Combining (Q3547682) (← links)
- Correction to: “An Efficient Universal Prediction Algorithm for Unknown Sources With Limited Training Data” (Q3547890) (← links)
- Constrained Information Combining: Theory and Applications for LDPC Coded Systems (Q3548147) (← links)
- On Context-Tree Prediction of Individual Sequences (Q3548806) (← links)
- Classification With Finite Memory Revisited (Q3549092) (← links)
- On Finite Memory Universal Data Compression and Classification of Individual Sequences (Q3604520) (← links)
- On universal quantization (Q3686622) (← links)
- Universal decoding for finite-state channels (Q3689085) (← links)
- (Q3744087) (← links)
- Achievable rates for a constrained Gaussian channel (Q3799941) (← links)
- Estimating with partial statistics the parameters of ergodic finite Markov sources (Q3830933) (← links)
- Successive decoding scheme for memoryless channels (Q3845685) (← links)
- Distortion-rate theory for individual sequences (Q3869240) (← links)
- Source Coding for Multiple Descriptions (Q3901432) (← links)
- On the power of straight- line computations in finite fields (Q3956397) (← links)
- On the optimal asymptotic performance of universal ordering and of discrimination of individual sequences (Q3990773) (← links)
- Estimating the number of states of a finite-state source (Q3991386) (← links)
- Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm (Q3991388) (← links)
- A sequential algorithm for the universal coding of finite memory sources (Q4008332) (← links)
- When is the generalized likelihood ratio test optimal? (Q4014188) (← links)
- Correction to "Variable-to fixed length codes are better than fixed-to-variable length codes for Markov sources" (Q4034477) (← links)
- On the<tex>epsilon</tex>-entropy and the rate-distortion function of certain non-Gaussian processes (Q4053480) (← links)
- Improved Lower Bounds on Signal Parameter Estimation (Q4054902) (← links)
- (Q4074748) (← links)
- The rate-distortion function for source coding with side information at the decoder (Q4088720) (← links)
- On the Complexity of Finite Sequences (Q4105595) (← links)
- (Q4132408) (← links)
- Improved bounds on the local mean-square error and the bias of parameter estimators (Corresp.) (Q4142505) (← links)
- A universal algorithm for sequential data compression (Q4158937) (← links)
- Compression of individual sequences via variable-rate coding (Q4174617) (← links)
- A measure of relative entropy between individual sequences with application to universal classification (Q4307329) (← links)
- Universal delay estimation for discrete channels (Q4336390) (← links)
- On the amount of statistical side information required for lossy data compression (Q4345605) (← links)
- On fixed-database universal data compression with limited memory (Q4392396) (← links)
- On sliding-window universal data compression with limited memory (Q4392436) (← links)
- On the decoding of convolutional codes on an unknown channel (Q4503455) (← links)
- A universal prediction lemma and applications to universal data compression and prediction (Q4544585) (← links)
- An efficient universal prediction algorithm for unknown sources with limited training data (Q4674534) (← links)
