The following pages link to Meir Feder (Q1330227):
Displaying 16 items.
- A strong version of the redundancy-capacity theorem of universal coding (Q4836898) (← links)
- Rate-distortion performance in coding bandlimited sources by sampling and dithered quantization (Q4840878) (← links)
- On lattice quantization noise (Q4885716) (← links)
- Information rates of pre/post-filtered dithered quantizers (Q4896813) (← links)
- Hierarchical universal coding (Q4896814) (← links)
- Achieving the Empirical Capacity Using Feedback: Memoryless Additive Models (Q4975772) (← links)
- Optimal Sampling of a Bandlimited Noisy Multiple Output Channel (Q5103478) (← links)
- <i>k</i>-Vectors: An Alternating Minimization Algorithm for Learning Regression Functions (Q5138885) (← links)
- Innovation Representation of Stochastic Processes With Application to Causal Inference (Q5211657) (← links)
- Communication Over Individual Channels (Q5272237) (← links)
- Signal Codes: Convolutional Lattice Codes (Q5273482) (← links)
- Optimal Feedback Communication Via Posterior Matching (Q5281015) (← links)
- Efficient Network Code Design for Cyclic Networks (Q5281347) (← links)
- Fundamental Limits of Infinite Constellations in MIMO Fading Channels (Q5346113) (← links)
- Universal Communication—Part I: Modulo Additive Channels (Q5346368) (← links)
- Active learning via predictive normalized maximum likelihood minimization (Q6576729) (← links)
