David Burshtein

List of Publications

Journal Publications

Conference Publications

Home page

Journal Publications

• I. Goldenberg and D. Burshtein, ``Error Bounds for Repeat-Accumulate Codes Decoded via Linear Programming,'' Advances in Mathematics of Communications, vol. 5, no. 4, pp. 555-570, November 2011.

• D. Burshtein and I. Goldenberg, ``Improved linear programming decoding of LDPC codes and bounds on the minimum and fractional distance,'' IEEE Transactions on Information Theory, vol. 57, no. 11, pp. 7386-7402, November 2011.

• O. Barak, U. Erez and D. Burshtein, “Bounds on Rates of LDPC Codes for BEC with Varying Erasure Rate,” IEEE Transactions on Communications, vol. 58, no. 10, pp. 2835-2844, October 2010.

• D. Burshtein, “Iterative Approximate Linear Programming Decoding of LDPC Codes with Linear Complexity,” IEEE Transactions on Information Theory, vol. 55, no. 11, pp. 4835-4859, November 2009.

• I. Goldenberg and D. Burshtein, “Upper bound on Error Exponent of Regular LDPC Codes Transmitted over the BEC,” IEEE Transactions on Information Theory, vol. 55, no. 6, pp. 2674-2681, June 2009.

• D. Burshtein, “On the Error Correction of Regular LDPC Codes using the Flipping Algorithm,” IEEE Transactions on Information Theory, vol. 54, no. 2, pp. 517-530, February 2008.

• A. Bennatan and D. Burshtein, “On the Fading Paper Achievable Region of the Fading MIMO Broadcast Channel,” IEEE Transactions on Information Theory, vol. 54, no. 1, pp. 100-115, January 2008.

• A. Sloin and D. Burshtein, “Support Vector Machine Training for Improved Hidden Markov Modeling,” IEEE Transactions on Signal Processing, vol. 56, no. 1, pp. 172-188, January 2008.

• O. Barak and D. Burshtein, “Lower Bounds on the Spectrum and Error Rate of LDPC Code Ensembles,” IEEE Transactions on Information Theory, volume 53, no. 11, pp. 4225-4236, November 2007.

• H. Aronowitz and D. Burshtein, “Efficient Speaker Recognition Using Approximated Cross Entropy (ACE),” IEEE Transactions on Audio, Speech and Language Processing, Special issue on Speaker and Language Recognition, volume 15, no. 7, pp. 2033-2043, September 2007.

• S. Freundlich, D. Burshtein and S. N. Litsyn, “Approximately Lower Triangular Ensembles of LPDC Codes with Linear Encoding Complexity,” IEEE Transactions on Information Theory, volume 53, no. 4, pp. 1484-1494, April 2007.

• A. Bennatan, D. Burshtein, G. Caire and S. Shamai, “Superposition coding for side-information channels,” IEEE Transactions on Information Theory, volume 52, no. 5, pp. 1872-1889, May 2006.

• A. Bennatan and D. Burshtein, “Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels,” IEEE Transactions on Information Theory, volume 52, no. 2, pp. 549-583, February 2006. LDPC simulation programs, EXIT design programs.

• D. Burshtein and G. Miller, “An efficient maximum likelihood decoding of LDPC codes over the binary erasure channel,” IEEE Transactions on Information Theory, volume 50, no. 11, pp. 2837-2844, November 2004.

• O. Barak, D. Burshtein and M. Feder, “Bounds on achievable rates of LDPC codes used over the binary erasure channel,” IEEE Transactions on Information Theory, volume 50, no. 10, pp. 2483-2489, October 2004.

• D. Burshtein and G. Miller, “Asymptotic enumeration methods for analyzing LDPC codes,” IEEE Transactions on Information Theory, volume 50, no. 6, pp. 1115-1131, June 2004.

• S. Gannot, D. Burshtein and E. Weinstein, “Analysis of the power spectral deviation of the general transfer function GSC,” IEEE Transactions on Signal Processing, volume 52, no. 4, pp. 1115-1120, April 2004.

• A. Bennatan and D. Burshtein, “On the application of LDPC codes to arbitrary discrete-memoryless channels,” IEEE Transactions on Information Theory, volume 50, no. 3, pp. 417-438, March 2004.

• A. Ben-Yishai and D. Burshtein, “A discriminative training algorithm for hidden Markov models,” IEEE Transactions on Speech and Audio Processing, volume 12, no. 3, pp. 204-217, May 2004.

• R. Yaniv and D. Burshtein, “An enhanced dynamic time warping model for improved estimation of DTW parameters,” IEEE Transactions on Speech and Audio Processing, volume 11, no. 3, pp. 216-228, May 2003.

• D. Burshtein and S. Gannot, “Speech enhancement using a mixture-maximum model,” IEEE Transactions on Speech and Audio Processing, volume 10, no. 6, pp. 341-351, September 2002.

• D. Burshtein, M. Krivelevich, S. Litsyn and G. Miller, “Upper bounds on the rate of LDPC codes,” IEEE Transactions on Information Theory, volume 48, no. 9, pp. 2437-2449, September 2002.

• D. Burshtein and G. Miller, “Bounds on the performance of belief propagation decoding,” IEEE Transactions on Information Theory, volume 48, no. 1, pp. 112-122, January 2002.

• D. Burshtein, D. Rainish, S. Shamai and D. Ben-Eli, “Fast synchronization method for CDMA communication systems,” IEEE Journal on Selected Areas in Communications, volume 19, no. 12, pp. 2396-2405, December 2001.

• D. Burshtein and G. Miller, “Iterative decoding of LDPC codes: some bounds and properties,” Physica A, volume 302, pp. 35-43, December 2001.

• G. Miller and D. Burshtein, “Bounds on the Maximum Likelihood decoding error probability of LDPC codes,” IEEE Transactions on Information Theory, volume 47, no. 7, pp. 2696-2710, November 2001.

• S. Gannot, D. Burshtein and E. Weinstein, “Signal enhancement using beamforming and non-stationarity with applications to speech,” IEEE Transactions on Signal Processing, volume 49, pp. 1614-1626, August 2001.

• Y. Bendel, D. Burshtein, O. Shalvi and E.Weinstein, “Delayless frequency domain acoustic echo cancellation,” IEEE Transactions on Speech and Audio Processing, volume 9, pp. 589-597, July 2001.

• D. Burshtein and G. Miller, “Expander graph arguments for message passing algorithms,” IEEE Transactions on Information Theory, volume 47, pp. 782-790, February 2001.

• J. Goldberger, D. Burshtein and H. Franco, “Segmental modeling using a continuous mixture of non-parametric models,” IEEE Transactions on Speech and Audio Processing, volume 7, pp. 262-271, May 1999.

• J. Goldberger and D. Burshtein, “Scaled random trajectory segment models,” Computer Speech and Language, volume 12, pp. 51-73, March 1998.

• S. Gannot, D. Burshtein and E. Weinstein, “Iterative and sequential Kalman-filter-based speech enhancement algorithms,” IEEE Transactions on Speech and Audio Processing, volume 6, no. 4, pp. 373-385, July 1998.

• D. Burshtein, “Typical error pattern recovery of the Hopfield memory under error-tolerant conditions,” IEEE Transactions on Information Theory, volume 44, no. 2, pp. 861-865, March 1998.

• D. Burshtein, “Long term attraction in higher order neural networks,” IEEE Transactions on Neural Networks, volume 9, no. 1, pp. 42-50, January 1998.

• A. Erell and D. Burshtein, “Noise adaptation of HMM speech recognition systems using tied-mixtures in the spectral domain,” IEEE Transactions on Speech and Audio Processing, volume 5, pp. 72-74, January 1997.

• D. Burshtein, “Robust parametric modeling of durations in hidden Markov models,” IEEE Transactions on Speech and Audio Processing, volume 4, pp. 240-242, May 1996.

• D. Robinson, M. Tieder, H. Halperin, D. Burshtein and Z. Nevo, “Maffucci's syndrome - the result of neural abnormalities?,” Cancer, volume 74, pp. 949-957, August 1994.

• D. Burshtein, “Nondirect convergence radius and number of iterations of the Hopfield associative memory,” IEEE Transactions on Information Theory, volume 40, pp. 838-847, May 1994.

• D. Burshtein, “An efficient algorithm for calculating the likelihood and likelihood gradient of ARMA models,” IEEE Transactions on Automatic Control, volume 38, pp. 336-340, February 1993.

• D. Burshtein, V. Della Pietra, D. Kanevsky and A. Nadas, “Minimum impurity partitions,” The Annals of Statistics, volume 20, September 1992.

• D. Burshtein, “Joint modeling and maximum likelihood estimation of pitch and LPC parameters,” Journal of the Acoustical Society of America, volume 91, pp. 1531-1537, March 1992

• D. Burshtein, V. Della Pietra, D. Kanevsky and A. Nadas, “Splitting theorems for classification and regression trees,” Comptes Rendus de l'academie des sciences, t. 313, series I, pp. 537-540, October 1991.

• D. Burshtein and E. Weinstein, “On the application of the Wald statistic to order estimation of ARMA models,” IEEE Transactions on Automatic Control, volume 36, pp. 1091-1096, September 1991.

• D. Burshtein and E. Weinstein, “Confidence intervals for the maximum entropy spectrum,” IEEE Transactions on Acoustics Speech and Signal Processing, volume 35, pp. 504-510, April 1987.

• D. Burshtein and E. Weinstein, “Some relations between the various criteria for autoregressive model order determination,” IEEE Transactions on Acoustics Speech and Signal Processing, volume 33, pp. 1017-1019, August 1985.

Some Recent Conference Publications

• I. Goldenberg and D. Burshtein, “The Approximate Maximum-Likelihood Certificate,” The IEEE International Symposium on Information Theory (ISIT-2011), Saint Petersburg, Russia, July 2011.

• D. Burshtein and I. Goldenberg, “Efficient methods for bounding the fractional distance of LDPC codes and obtaining fundamental polytopes of nonbinary and generalized codes,” The IEEE International Symposium on Information Theory (ISIT-2011), Saint Petersburg, Russia, July 2011.

• D. Goldin and D. Burshtein, “Approximate Iterative Linear Programming Decoding of LDPC Codes over GF(q) with Linear Complexity," The IEEE 26’th Convention of Electrical and Electronics Engineers in Israel, Eilat, November 2010.

• I. Goldenberg and D. Burshtein, “Error Bounds for Repeat-Accumulate Codes Decoded via Linear Programming," The 6'th International Symposium on Turbo Codes and Iterative Information Processing, Brest, France, September 2010.

• D. Burshtein and I. Goldenberg, “Improved Linear Programming Decoding and Bounds on the Minimum Distance of LDPC Codes," invited session on LDPC codes organized by S. Litsyn and D. Burshtein, The IEEE Information Theory Workshop, Dublin, Ireland, August 2010.

• O. Levi and D. Burshtein, “Bounds on the Thresholds of Non-binary LDPC Codes," The IEEE 25’th Convention of Electrical and Electronics Engineers in Israel, Eilat, December 2008.

• D. Burshtein, “On the Correction of a Fixed Fraction of Errors in LDPC Codes using Iterative Decoding Algorithms," invited plenary talk, The 5'th International Symposium on Turbo Codes and Related Topics, Lausanne, Switzerland, September 2008.

• I. Goldenberg and D. Burshtein, “Upper Bound on the Error Exponent of Regular LDPC Codes Transmitted over the BEC," The 5'th International Symposium on Turbo Codes and Related Topics, Lausanne, Switzerland, September 2008.

• D. Burshtein, “Linear Complexity Approximate LP Decoding of LDPC Codes: Generalizations and Improvements," The 5'th International Symposium on Turbo Codes and Related Topics, Lausanne, Switzerland, September 2008.

• D. Burshtein, “Iterative Approximate Linear Programming Decoding of LDPC Codes with Linear Complexity," The IEEE International Symposium on Information Theory (ISIT-2008), Toronto, Canada, July 2008.

• O. Barak, U. Erez and D. Burshtein, “Bounds on Rates of LDPC Codes for BEC with Varying Erasure Rate," The IEEE International Symposium on Information Theory (ISIT-2008), Toronto, Canada, July 2008.

• D. Burshtein, "On the error correction of regular LDPC codes using the flipping algorithm,'' The IEEE International Symposium on Information Theory (ISIT-2007), Nice, France, June 2007.

• A. Bennatan and D. Burshtein, "On the Fading Paper Achievable Region of the Fading MIMO,'' invited talk, The 44th Annual Allerton Conference on Communication, Control and Computing, the University of Illinois, September 2006.

• O. Barak and D. Burshtein, “Upper Bounds on the Error Exponents of LDPC Code Ensembles,” The IEEE International Symposium on Information Theory (ISIT-2006), Seattle, July 2006.

• S. Freundlich, D. Burshtein and S. N. Litsyn, “Approximately Lower Triangular Ensembles of LPDC Codes with Linear Encoding Complexity,” The IEEE International Symposium on Information Theory (ISIT-2006), Seattle, July 2006.

• A. Bennatan and D. Burshtein, “EXIT charts for non-binary LDPC codes over arbitrary discrete memoryless channels,” The IEEE International Symposium on Information Theory (ISIT-2005), Adelaide, Australia, September 2005. LDPC simulation programs, Simulation Programs.

• O. Barak and D. Burshtein, “Lower Bounds on the Spectrum and Error Rate of LDPC Code Ensembles,” The IEEE International Symposium on Information Theory (ISIT-2005), Adelaide, Australia, September 2005.

• A. Bennatan, D. Burshtein, G. Caire and S. Shamai, “Superposition coding for Gaussian dirty paper, ” The 2004 International Symposium on Information Theory and its Applications (ISITA 2004), Parma, Italy, October 2004.

• G. Caire, A. Bennatan, D. Burshtein and S. Shamai, “Superposition coding for Gaussian dirty paper,” The 23^rd IEEE Convention of Electrical and Electronics Engineers in Israel (IEEEI 2004), Herzlia, Israel, September 2004.

• G. Caire, A. Bennatan, D. Burshtein and S. Shamai, “Coding schemes for the binary symmetric channel with known interference,” invited talk, The 41^st Allerton Conference, the University of Illinois, October 2003.

• A. Bennatan and D. Burshtein, “Iterative Decoding of LDPC Codes over Arbitrary Discrete-Memoryless Channels,” invited talk, The 41^st Allerton Conference, the University of Illinois, October 2003.

• D. Burshtein and G. Miller, “An efficient maximum likelihood decoding of LDPC codes over the binary erasure channel,” The 3^rd Asia-Europe workshop on Information theory, Kamogawa, Japan, June 2003.

• A. Bennatan and D. Burshtein, “On the application of LDPC codes to arbitrary discrete-memoryless channels,” The IEEE International Symposium on Information Theory (ISIT-2003).

• G. Caire, D. Burshtein and S. Shamai, “LDPC coding for interference mitigation at the transmitter,” invited talk, The 40^th Allerton Conference, the University of Illinois, October 2002.

• D. Burshtein and G. Miller, “The application of asymptotic enumeration to the analysis of LDPC codes," invited talk, The 40^th Allerton Conference, the University of Illinois, October 2002.

• D. Burshtein, M. Krivelevich, S. Litsyn and G. Miller, “Upper bounds on the rate of LDPC codes,” The IEEE International Symposium on Information Theory (ISIT-2002), p. 28, Lausanne, Switzerland, July 2002.