The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Meir Feder: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Meir Feder
    Learning to Communicate via Unknown Channel (Abstract). [Citation Graph (0, 0)][DBLP]
    COLT, 1998, pp:79- [Conf]
  2. Neri Merhav, Meir Feder
    Universal Sequential Learning and Decision from Individual Data Sequences. [Citation Graph (0, 0)][DBLP]
    COLT, 1992, pp:413-427 [Conf]
  3. Raz Barequet, Meir Feder
    SICLIC: A Simple Inter-Color Lossless Image Coder. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1999, pp:501-510 [Conf]
  4. 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]
  5. Meir Feder, Andrew C. Singer
    Universal Data Compression and Linear Prediction. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1998, pp:511-520 [Conf]
  6. Amir Ingber, Meir Feder
    Non-Asymptotic Design of Finite State Universal Predictors for Individual Sequences. [Citation Graph (0, 0)][DBLP]
    DCC, 2006, pp:3-12 [Conf]
  7. Neri Merhav, Meir Feder
    The Minimax Redundancy is a Lower Bound for Most Sources. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1994, pp:52-61 [Conf]
  8. 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]
  9. 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]
  10. Doron Rajwan, Meir Feder
    Universal Finite Memory Machines for Coding Binary Sequences. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 2000, pp:113-122 [Conf]
  11. 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]
  12. Ram Zamir, Meir Feder
    On Lattice Quantization Noise. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1994, pp:380-389 [Conf]
  13. Amir Ingber, Meir Feder
    Power Preserving 2: 1 Bandwidth Reduction Mappings. [Citation Graph (0, 0)][DBLP]
    DCC, 2007, pp:385- [Conf]
  14. Ofer Shayevitz, Eado Meron, Meir Feder, Ram Zamir
    Bounds on Redundancy in Constrained Delay Arithmetic Coding. [Citation Graph (0, 0)][DBLP]
    DCC, 2007, pp:133-142 [Conf]
  15. Eitan Federovsky, Meir Feder, Shlomo Weiss
    Branch Prediction Based on Universal Data Compression Algorithms. [Citation Graph (0, 0)][DBLP]
    ISCA, 1998, pp:62-72 [Conf]
  16. Yossi Azar, Meir Feder, Eyal Lubetzky, Doron Rajwan, Nadav Shulman
    The Multicast Bandwidth Advantage in Serving a Web Site. [Citation Graph (0, 0)][DBLP]
    Networked Group Communication, 2001, pp:88-99 [Conf]
  17. Meir Feder, Dana Ron, Ami Tavory
    Bounds on Linear Codes for Network Multicast [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:033, pp:- [Journal]
  18. Eli Shusterman, Meir Feder
    Image compression via improved quadtree decomposition algorithms. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Image Processing, 1994, v:3, n:2, pp:207-215 [Journal]
  19. O. Barak, David Burshtein, Meir Feder
    Bounds on achievable rates of LDPC codes used over the binary erasure channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:10, pp:2483-2492 [Journal]
  20. 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]
  21. 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]
  22. 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]
  23. 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]
  24. Meir Feder, Amos Lapidoth
    Universal Decoding for Channels with Memory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:5, pp:1726-1745 [Journal]
  25. Meir Feder, Neri Merhav
    Universal composite hypothesis testing: A competitive minimax approach. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:6, pp:1504-1517 [Journal]
  26. Meir Feder, Neri Merhav
    Relations between entropy and error probability. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:1, pp:259-0 [Journal]
  27. Meir Feder, Neri Merhav
    Hierarchical universal coding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:5, pp:1354-1364 [Journal]
  28. Meir Feder, Neri Merhav, Michael Gutman
    Universal prediction of individual sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:4, pp:1258-1270 [Journal]
  29. Meir Feder, Neri Merhav, Michael Gutman
    Correction to 'Universal prediction of individual sequences' (Jul 92 1258-1270). [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:1, pp:285- [Journal]
  30. 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]
  31. 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]
  32. Neri Merhav, Meir Feder
    Universal Prediction. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:6, pp:2124-2147 [Journal]
  33. Neri Merhav, Meir Feder, Michael Gutman
    Some properties of sequential predictors for binary Markov sources. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:3, pp:887-892 [Journal]
  34. 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]
  35. 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]
  36. 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]
  37. 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]
  38. Nadav Shulman, Meir Feder
    The Uniform Distribution as a Universal Prior. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:6, pp:1356-1362 [Journal]
  39. Nadav Shulman, Meir Feder
    Random coding techniques for nonrandom codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:6, pp:2101-2104 [Journal]
  40. Andrew C. Singer, Suleyman S. Kozat, Meir Feder
    Universal linear least squares prediction: Upper and lower bounds. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:8, pp:2354-2362 [Journal]
  41. Marcelo J. Weinberger, Neri Merhav, Meir Feder
    Optimal sequential probability assignment for individual sequences. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:2, pp:384-396 [Journal]
  42. Marcelo J. Weinberger, Jorma Rissanen, Meir Feder
    A universal finite memory source. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:3, pp:643-652 [Journal]
  43. 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]
  44. 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]
  45. 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]
  46. Ram Zamir, Meir Feder
    On lattice quantization noise. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:4, pp:1152-1159 [Journal]
  47. 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]
  48. 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]
  49. Zvi Reznic, Meir Feder, Ram Zamir
    Distortion Bounds for Broadcasting With Bandwidth Expansion. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:8, pp:3778-3788 [Journal]
  50. 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]
  51. Naftali Sommer, Meir Feder, Ofir Shalvi
    Low Density Lattice Codes [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  52. Neri Merhav, Meir Feder
    Universal decoding with an erasure option [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  53. Ofer Shayevitz, Ram Zamir, Meir Feder
    Bounded expected delay in arithmetic coding [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  54. A Lower Bound on the Redundancy of Arithmetic-Type Delay Constrained Coding. [Citation Graph (, )][DBLP]


  55. The Posterior Matching Feedback Scheme for Joint Source-Channel Coding with Bandwidth Expansion. [Citation Graph (, )][DBLP]


  56. Signal Codes [Citation Graph (, )][DBLP]


  57. Achieving the Empirical Capacity Using Feedback Part I: Memoryless Additive Models [Citation Graph (, )][DBLP]


  58. Communication over Individual Channels [Citation Graph (, )][DBLP]


  59. Feedback Communication over Individual Channels [Citation Graph (, )][DBLP]


  60. Power Adaptive Feedback Communication over an Additive Individual Noise Sequence Channel [Citation Graph (, )][DBLP]


  61. Optimal Feedback Communication via Posterior Matching [Citation Graph (, )][DBLP]


  62. An Achievable Rate for the MIMO Individual Channel [Citation Graph (, )][DBLP]


  63. Parallel Bit Interleaved Coded Modulation [Citation Graph (, )][DBLP]


Search in 0.016secs, Finished in 0.018secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002