Meir Feder, Neri Merhav Universal Coding for Arbitrarily Varying Sources and for Hierarchies of Model Classes. [Citation Graph (0, 0)][DBLP] Data Compression Conference, 1995, pp:82-91 [Conf]
Eado Meron, Meir Feder Optimal Finite State Universal Coding of Individual Sequences. [Citation Graph (0, 0)][DBLP] Data Compression Conference, 2004, pp:332-341 [Conf]
Daniel Manor, Meir Feder An Iterative Technique for Universal Lossy Compression of Individual Sequences. [Citation Graph (0, 0)][DBLP] Data Compression Conference, 1997, pp:141-150 [Conf]
Ram Zamir, Meir Feder Universal Coding of Band-Limited Sources by Sampling and Dithered Quantization. [Citation Graph (0, 0)][DBLP] Data Compression Conference, 1992, pp:329-338 [Conf]
E. Erez, Meir Feder Improving the generalized likelihood ratio test for unknown linear Gaussian channels. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2003, v:49, n:4, pp:919-936 [Journal]
Meir Feder Maximum entropy as a special case of the minimum description length criterion. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1986, v:32, n:6, pp:847-0 [Journal]
Meir Feder Gambling using a finite state machine. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1991, v:37, n:5, pp:1459-0 [Journal]
Meir Feder A note on the competitive optimality of the Huffman code. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1992, v:38, n:2, pp:436-0 [Journal]
Neri Merhav, Meir Feder Universal schemes for sequential decision from individual data sequences. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:4, pp:1280-1292 [Journal]
Neri Merhav, Meir Feder A strong version of the redundancy-capacity theorem of universal coding. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1995, v:41, n:3, pp:714-722 [Journal]
Eado Meron, Meir Feder Finite-memory universal prediction of individual sequences. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2004, v:50, n:7, pp:1506-1523 [Journal]
Zvi Reznic, Ram Zamir, Meir Feder Joint source-channel coding of a Gaussian mixture source over the Gaussian broadcast channel. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2002, v:48, n:3, pp:776-781 [Journal]
Ofer Shayevitz, Meir Feder Universal decoding for frequency-selective fading channels. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2005, v:51, n:8, pp:2770-2790 [Journal]
Nadav Shulman, Meir Feder Improved error exponent for time-invariant and periodically time-variant convolutional codes. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2000, v:46, n:1, pp:97-103 [Journal]
Ram Zamir, Meir Feder On universal quantization by randomized uniform/lattice quantizers. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1992, v:38, n:2, pp:428-0 [Journal]
Ram Zamir, Meir Feder A generalization of the entropy power inequality with applications. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1993, v:39, n:5, pp:1723-0 [Journal]
Ram Zamir, Meir Feder Rate-distortion performance in coding bandlimited sources by sampling and dithered quantization. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1995, v:41, n:1, pp:141-154 [Journal]
Ram Zamir, Meir Feder Information rates of pre/post-filtered dithered quantizers. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1340-1353 [Journal]
Ram Zamir, Meir Feder On the Volume of the Minkowski Sum of Line Sets and the Entropy-Power Inequality. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 1998, v:44, n:7, pp:3039-3043 [Journal]
Neri Merhav, Meir Feder Minimax Universal Decoding With an Erasure Option. [Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2007, v:53, n:5, pp:1664-1675 [Journal]