 | 2009 |
|---|
| 64 |       | Ofer Shayevitz,
Meir Feder:
The Posterior Matching Feedback Scheme for Joint Source-Channel Coding with Bandwidth Expansion.
DCC 2009: 83-92 |
| 63 | | Yuval Lomnitz,
Meir Feder:
Communication over Individual Channels
CoRR abs/0901.1473: (2009) |
| 62 | | Yuval Lomnitz,
Meir Feder:
Feedback Communication over Individual Channels
CoRR abs/0901.1732: (2009) |
| 61 | | Yuval Lomnitz,
Meir Feder:
Power Adaptive Feedback Communication over an Additive Individual Noise Sequence Channel
CoRR abs/0901.1737: (2009) |
| 60 | | Ofer Shayevitz,
Meir Feder:
Optimal Feedback Communication via Posterior Matching
CoRR abs/0909.4828: (2009) |
| 59 | | E. Erez,
Meir Feder:
Improving the multicommodity flow rates with network codes for two sources.
IEEE Journal on Selected Areas in Communications 27(5): 814-824 (2009) |
| 58 | | Ofer Shayevitz,
Meir Feder:
Achieving the Empirical Capacity Using Feedback: Memoryless Additive Models.
IEEE Transactions on Information Theory 55(3): 1269-1295 (2009) |
| 2008 |
|---|
| 57 | | Eado Meron,
Ofer Shayevitz,
Meir Feder,
Ram Zamir:
A Lower Bound on the Redundancy of Arithmetic-Type Delay Constrained Coding.
DCC 2008: 489-498 |
| 56 | | Ofir Shalvi,
Naftali Sommer,
Meir Feder:
Signal Codes
CoRR abs/0806.4773: (2008) |
| 55 | | Ofer Shayevitz,
Meir Feder:
Achieving the Empirical Capacity Using Feedback Part I: Memoryless Additive Models
CoRR abs/0808.4135: (2008) |
| 54 | | Naftali Sommer,
Meir Feder,
Ofir Shalvi:
Low-Density Lattice Codes.
IEEE Transactions on Information Theory 54(4): 1561-1585 (2008) |
| 2007 |
|---|
| 53 | | Ofer Shayevitz,
Eado Meron,
Meir Feder,
Ram Zamir:
Bounds on Redundancy in Constrained Delay Arithmetic Coding.
DCC 2007: 133-142 |
| 52 | | Amir Ingber,
Meir Feder:
Power Preserving 2: 1 Bandwidth Reduction Mappings.
DCC 2007: 385 |
| 51 | | Naftali Sommer,
Meir Feder,
Ofir Shalvi:
Low Density Lattice Codes
CoRR abs/0704.1317: (2007) |
| 50 | | Neri Merhav,
Meir Feder:
Minimax Universal Decoding With an Erasure Option.
IEEE Transactions on Information Theory 53(5): 1664-1675 (2007) |
| 2006 |
|---|
| 49 | | Amir Ingber,
Meir Feder:
Non-Asymptotic Design of Finite State Universal Predictors for Individual Sequences.
DCC 2006: 3-12 |
| 48 | | Neri Merhav,
Meir Feder:
Universal decoding with an erasure option
CoRR abs/cs/0604069: (2006) |
| 47 | | Ofer Shayevitz,
Ram Zamir,
Meir Feder:
Bounded expected delay in arithmetic coding
CoRR abs/cs/0604106: (2006) |
| 46 | | Zvi Reznic,
Meir Feder,
Ram Zamir:
Distortion Bounds for Broadcasting With Bandwidth Expansion.
IEEE Transactions on Information Theory 52(8): 3778-3788 (2006) |
| 2005 |
|---|
| 45 | | Ofer Shayevitz,
Meir Feder:
Universal decoding for frequency-selective fading channels.
IEEE Transactions on Information Theory 51(8): 2770-2790 (2005) |
| 2004 |
|---|
| 44 | | Eado Meron,
Meir Feder:
Optimal Finite State Universal Coding of Individual Sequences.
Data Compression Conference 2004: 332-341 |
| 43 |  | Ohad Barak,
David Burshtein,
Meir Feder:
Bounds on achievable rates of LDPC codes used over the binary erasure channel.
IEEE Transactions on Information Theory 50(10): 2483-2492 (2004) |
| 42 | | Nadav Shulman,
Meir Feder:
The Uniform Distribution as a Universal Prior.
IEEE Transactions on Information Theory 50(6): 1356-1362 (2004) |
| 41 | | Eado Meron,
Meir Feder:
Finite-memory universal prediction of individual sequences.
IEEE Transactions on Information Theory 50(7): 1506-1523 (2004) |
| 2003 |
|---|
| 40 | | Meir Feder,
Dana Ron,
Ami Tavory:
Bounds on Linear Codes for Network Multicast
Electronic Colloquium on Computational Complexity (ECCC) 10(033): (2003) |
| 39 | | E. Erez,
Meir Feder:
Improving the generalized likelihood ratio test for unknown linear Gaussian channels.
IEEE Transactions on Information Theory 49(4): 919-936 (2003) |
| 2002 |
|---|
| 38 | | Zvi Reznic,
Ram Zamir,
Meir Feder:
Joint source-channel coding of a Gaussian mixture source over the Gaussian broadcast channel.
IEEE Transactions on Information Theory 48(3): 776-781 (2002) |
| 37 | | Meir Feder,
Neri Merhav:
Universal composite hypothesis testing: A competitive minimax approach.
IEEE Transactions on Information Theory 48(6): 1504-1517 (2002) |
| 36 | | Andrew C. Singer,
Suleyman S. Kozat,
Meir Feder:
Universal linear least squares prediction: Upper and lower bounds.
IEEE Transactions on Information Theory 48(8): 2354-2362 (2002) |
| 2001 |
|---|
| 35 | | Yossi Azar,
Meir Feder,
Eyal Lubetzky,
Doron Rajwan,
Nadav Shulman:
The Multicast Bandwidth Advantage in Serving a Web Site.
Networked Group Communication 2001: 88-99 |
| 2000 |
|---|
| 34 | | Doron Rajwan,
Meir Feder:
Universal Finite Memory Machines for Coding Binary Sequences.
Data Compression Conference 2000: 113-122 |
| 33 | | Nadav Shulman,
Meir Feder:
Improved error exponent for time-invariant and periodically time-variant convolutional codes.
IEEE Transactions on Information Theory 46(1): 97-103 (2000) |
| 1999 |
|---|
| 32 | | Raz Barequet,
Meir Feder:
SICLIC: A Simple Inter-Color Lossless Image Coder.
Data Compression Conference 1999: 501-510 |
| 31 | | Nadav Shulman,
Meir Feder:
Random coding techniques for nonrandom codes.
IEEE Transactions on Information Theory 45(6): 2101-2104 (1999) |
| 1998 |
|---|
| 30 | | Meir Feder:
Learning to Communicate via Unknown Channel (Abstract).
COLT 1998: 79 |
| 29 | | Meir Feder,
Andrew C. Singer:
Universal Data Compression and Linear Prediction.
Data Compression Conference 1998: 511-520 |
| 28 | | Eitan Federovsky,
Meir Feder,
Shlomo Weiss:
Branch Prediction Based on Universal Data Compression Algorithms.
ISCA 1998: 62-72 |
| 27 | | Meir Feder,
Amos Lapidoth:
Universal Decoding for Channels with Memory.
IEEE Transactions on Information Theory 44(5): 1726-1745 (1998) |
| 26 | | Neri Merhav,
Meir Feder:
Universal Prediction.
IEEE Transactions on Information Theory 44(6): 2124-2147 (1998) |
| 25 | | Ram Zamir,
Meir Feder:
On the Volume of the Minkowski Sum of Line Sets and the Entropy-Power Inequality.
IEEE Transactions on Information Theory 44(7): 3039-3043 (1998) |
| 1997 |
|---|
| 24 | | Daniel Manor,
Meir Feder:
An Iterative Technique for Universal Lossy Compression of Individual Sequences.
Data Compression Conference 1997: 141-150 |
| 1996 |
|---|
| 23 | | Ram Zamir,
Meir Feder:
On lattice quantization noise.
IEEE Transactions on Information Theory 42(4): 1152-1159 (1996) |
| 22 | | Ram Zamir,
Meir Feder:
Information rates of pre/post-filtered dithered quantizers.
IEEE Transactions on Information Theory 42(5): 1340-1353 (1996) |
| 21 | | Meir Feder,
Neri Merhav:
Hierarchical universal coding.
IEEE Transactions on Information Theory 42(5): 1354-1364 (1996) |
| 1995 |
|---|
| 20 | | Meir Feder,
Neri Merhav:
Universal Coding for Arbitrarily Varying Sources and for Hierarchies of Model Classes.
Data Compression Conference 1995: 82-91 |
| 19 | | Ram Zamir,
Meir Feder:
Rate-distortion performance in coding bandlimited sources by sampling and dithered quantization.
IEEE Transactions on Information Theory 41(1): 141-154 (1995) |
| 18 | | Marcelo J. Weinberger,
Jorma Rissanen,
Meir Feder:
A universal finite memory source.
IEEE Transactions on Information Theory 41(3): 643-652 (1995) |
| 17 | | Neri Merhav,
Meir Feder:
A strong version of the redundancy-capacity theorem of universal coding.
IEEE Transactions on Information Theory 41(3): 714-722 (1995) |
| 1994 |
|---|
| 16 | | Ram Zamir,
Meir Feder:
On Lattice Quantization Noise.
Data Compression Conference 1994: 380-389 |
| 15 | | Neri Merhav,
Meir Feder:
The Minimax Redundancy is a Lower Bound for Most Sources.
Data Compression Conference 1994: 52-61 |
| 14 | | Eli Shusterman,
Meir Feder:
Image compression via improved quadtree decomposition algorithms.
IEEE Transactions on Image Processing 3(2): 207-215 (1994) |
| 13 | | Meir Feder,
Neri Merhav:
Relations between entropy and error probability.
IEEE Transactions on Information Theory 40(1): 259- (1994) |
| 12 | | Meir Feder,
Neri Merhav,
Michael Gutman:
Correction to 'Universal prediction of individual sequences' (Jul 92 1258-1270).
IEEE Transactions on Information Theory 40(1): 285 (1994) |
| 11 | | Marcelo J. Weinberger,
Neri Merhav,
Meir Feder:
Optimal sequential probability assignment for individual sequences.
IEEE Transactions on Information Theory 40(2): 384-396 (1994) |
| 1993 |
|---|
| 10 | | Neri Merhav,
Meir Feder,
Michael Gutman:
Some properties of sequential predictors for binary Markov sources.
IEEE Transactions on Information Theory 39(3): 887-892 (1993) |
| 9 | | Neri Merhav,
Meir Feder:
Universal schemes for sequential decision from individual data sequences.
IEEE Transactions on Information Theory 39(4): 1280-1292 (1993) |
| 8 | | Ram Zamir,
Meir Feder:
A generalization of the entropy power inequality with applications.
IEEE Transactions on Information Theory 39(5): 1723- (1993) |
| 1992 |
|---|
| 7 | | Neri Merhav,
Meir Feder:
Universal Sequential Learning and Decision from Individual Data Sequences.
COLT 1992: 413-427 |
| 6 | | Ram Zamir,
Meir Feder:
Universal Coding of Band-Limited Sources by Sampling and Dithered Quantization.
Data Compression Conference 1992: 329-338 |
| 5 | | Ram Zamir,
Meir Feder:
On universal quantization by randomized uniform/lattice quantizers.
IEEE Transactions on Information Theory 38(2): 428- (1992) |
| 4 | | Meir Feder:
A note on the competitive optimality of the Huffman code.
IEEE Transactions on Information Theory 38(2): 436- (1992) |
| 3 | | Meir Feder,
Neri Merhav,
Michael Gutman:
Universal prediction of individual sequences.
IEEE Transactions on Information Theory 38(4): 1258-1270 (1992) |
| 1991 |
|---|
| 2 | | Meir Feder:
Gambling using a finite state machine.
IEEE Transactions on Information Theory 37(5): 1459- (1991) |
| 1986 |
|---|
| 1 | | Meir Feder:
Maximum entropy as a special case of the minimum description length criterion.
IEEE Transactions on Information Theory 32(6): 847- (1986) |
