The following pages link to Meir Feder (Q1330227):
Displaying 50 items.
- Predictive stochastic complexity and model estimation for finite-state processes (Q1330228) (← links)
- A novel decoder for unknown diversity channels employing space-time codes (Q1607630) (← links)
- Analysis and synthesis of 1/f processes via Shannon wavelets (Q2724233) (← links)
- Universal linear prediction by model order weighting (Q2732868) (← links)
- Vector sampling expansion (Q2734335) (← links)
- A Simple Proof for the Optimality of Randomized Posterior Matching (Q2976789) (← links)
- Collaboration in Multiple Access Channels Requires Synchronization (Q2976920) (← links)
- Generalized Independent Component Analysis Over Finite Alphabets (Q2977023) (← links)
- Non-Random Coding Error Bounds for Lattices (Q2977037) (← links)
- The Random Coding Bound Is Tight for the Average Linear Code or Lattice (Q2977038) (← links)
- On the Diversity-Multiplexing Tradeoff of Unconstrained Multiple-Access Channels (Q2977265) (← links)
- Delay and Redundancy in Lossless Source Coding (Q2986161) (← links)
- Finite-Memory Prediction as Well as the Empirical Mean (Q2986202) (← links)
- Universal Communication—Part II: Channels With Memory (Q2986245) (← links)
- Universal Communication Over Arbitrarily Varying Channels (Q2989202) (← links)
- The Jacobi MIMO Channel (Q2989329) (← links)
- Finite-Dimensional Infinite Constellations (Q2989372) (← links)
- Maximum entropy as a special case of the minimum description length criterion (Corresp.) (Q3029989) (← links)
- (Q3154858) (← links)
- Sequential algorithms for parameter estimation based on the Kullback-Leibler information measure (Q3477842) (← links)
- Bounds on Achievable Rates of LDPC Codes Used Over the Binary Erasure Channel (Q3546531) (← links)
- Finite-Memory Universal Prediction of Individual Sequences (Q3547390) (← links)
- Universal Decoding for Frequency-Selective Fading Channels (Q3547628) (← links)
- The Uniform Distribution as a Universal Prior (Q3547634) (← links)
- Distortion Bounds for Broadcasting With Bandwidth Expansion (Q3548124) (← links)
- Minimax Universal Decoding With an Erasure Option (Q3548849) (← links)
- Finding the Closest Lattice Point by Iterative Slicing (Q3563937) (← links)
- Low-Density Lattice Codes (Q3604506) (← links)
- Parameter estimation of superimposed signals using the EM algorithm (Q3795576) (← links)
- On universal quantization by randomized uniform/lattice quantizers (Q3990779) (← links)
- A note on the competitive optimality of the Huffman code (Q3990780) (← links)
- Universal prediction of individual sequences (Q4014142) (← links)
- Parameter Estimation and Extraction of Helicopter Signals Observed with a Wide-Band Interference (Q4034635) (← links)
- Some properties of sequential predictors for binary Markov sources (Q4277147) (← links)
- Relations between entropy and error probability (Q4307306) (← links)
- Universal schemes for sequential decision from individual data sequences (Q4307330) (← links)
- A generalization of the entropy power inequality with applications (Q4307395) (← links)
- Optimal sequential probability assignment for individual sequences (Q4308773) (← links)
- (Q4473327) (← links)
- Random coding techniques for nonrandom codes (Q4503408) (← links)
- Improved error exponent for time-invariant and periodically time-variant convolutional codes (Q4503520) (← links)
- Large Alphabet Source Coding Using Independent Component Analysis (Q4566507) (← links)
- Linear Independent Component Analysis Over Finite Fields: Algorithms and Bounds (Q4622472) (← links)
- Universal composite hypothesis testing: a competitive minimax approach (Q4674522) (← links)
- Universal linear least squares prediction: upper and lower bounds (Q4677552) (← links)
- Improving the generalized likelihood ratio test for unknown linear gaussian channels (Q4680061) (← links)
- Universal decoding for channels with memory (Q4701153) (← links)
- Universal prediction (Q4701188) (← links)
- On the volume of the Minkowski sum of line sets and the entropy-power inequality (Q4701229) (← links)
- A universal finite memory source (Q4836891) (← links)
