Prof. Meir Feder

Publications

2000 - 2004

• “Noise amplification of periodic non-uniform sampling"
  D. Seidner and M. Feder
  IEEE Transactions on Signal Processing, Volume 48 No. 1, pp. 275-277, Jan. 2000.
• “Improved Error Exponent for Time-Invariant and Periodically Time-Variant Convolutional Codes"
  N. Shulman and M. Feder,
  IEEE Trans. on Information Theory, Vol.46, No.1, pp. 97-103 Jan. 2000.
• “Vector Sampling Expansion"
  D. Seidner and M. Feder
  IEEE Transactions on Signal Processing, Vol. 48 No. 5, pp. 1401 -1416, May 2000.
• “Static Broadcasting "
  N. Shulman and M. Feder,
  Proc. of the 2000 Inf. Theory Int. Symp (ISIT), Sorrento, Italy, pp. 744 - 748, June 2000.
• “A novel decoder for unknown diversity channels employing space-time codes"
  E. Erez and M. Feder
  Eurasip jour. on Applied Signal processing, No. 3., pp. 267-274, March 2002.
• “Joint Source-Channel Coding of a Gaussian Mixture Source over the Gaussian Broadcast Channel"
  Z. Reznic, R. Zamir and M. Feder
  IEEE Trans. on Information Theory, Vol.48, No.3, pp.776 -781, March 2002.
• “Universal composite hypothesis testing: a competitive minimax approach"
  M. Feder and N. Merhav
  Invited paper,
  IEEE Trans. on Information Theory, Vol.48 No.6 pp.1504-1517, June 2002.
• “Universal linear least squares prediction: upper and lower bounds"
  A. C. Singer, S.S. Kozat, M. Feder
  IEEE Trans. on Information Theory, Vol. 48, No. 8, pp. 2354-2362, Aug. 2002.
• “Improving the Generalized Likelihood Ratio Test for Unknown Linear Gaussian Channels"
  E. Erez and M. Feder
  IEEE Trans. on Information Theory Vol. 49 , No. 4 , pp 919 - 936, April 2003.
• “Bounds on Linear Network Codes"
  M. Feder and D. Ron and A. Tavori
  Electronic Colloqium on Computational Complexity, 28 pages, September 2003.
• “The Uniform Distribution as a Universal Prior"
  N. Shulman and M. Feder
  IEEE Trans. on Information Theory, June 2004.
• “Finite Memory Universal Prediction of Individual Sequences"
  E. Meron and M. Feder,
  IEEE Trans. on Information Theory, July 2004.
• “Bounds on the achievable rates of LDPC codes used over the erasure channel"
  O. Barak, D. Burstyn and M. Feder
  IEEE Trans. on Information Theory, pp. 2483-2489, October 2004.