On the Error Correction of Iterative Bounded Distance Decoding of Generalized LDPC Codes.

David Burshtein Tel Aviv University, Israel https://www.eng.tau.ac.il/~burstyn/ https://scholar.google.com/citations?user=vsPjofUAAAAJ https://orcid.org/0000-0001-7255-1360

David Burshtein On the Error Correction of Iterative Bounded Distance Decoding of Generalized LDPC Codes. 8380-8390 2025 November 71 IEEE Trans. Inf. Theory 11 https://doi.org/10.1109/TIT.2025.3609965 db/journals/tit/tit71.html#Burshtein25 streams/journals/tit

David Burshtein On the error correction of iterative bounded distance decoding of generalized LDPC codes. 2025 July abs/2507.12073 CoRR https://doi.org/10.48550/arXiv.2507.12073 db/journals/corr/corr2507.html#abs-2507-12073 streams/journals/corr

Efrayim Yanir David Burshtein Sharon Gannot GDiffuSE: Diffusion-based speech enhancement with noise model guidance. 2025 October abs/2510.04157 CoRR https://doi.org/10.48550/arXiv.2510.04157 db/journals/corr/corr2510.html#abs-2510-04157 streams/journals/corr

David Burshtein Eli Bery Semi-Supervised Channel Equalization Using Variational Autoencoders. 19681-19695 2024 December 23 IEEE Trans. Wirel. Commun. 12 https://doi.org/10.1109/TWC.2024.3485991 db/journals/twc/twc23.html#BurshteinB24 streams/journals/twc

David Burshtein Eli Bery Semi-Supervised Variational Inference over Nonlinear Channels. 611-615 2023 SPAWC https://doi.org/10.1109/SPAWC53906.2023.10304430 conf/spawc/2023 db/conf/spawc/spawc2023.html#BurshteinB23

David Burshtein Eli Bery Semi-Supervised Variational Inference over Nonlinear Channels. 2023 abs/2309.11841 CoRR https://doi.org/10.48550/arXiv.2309.11841 db/journals/corr/corr2309.html#abs-2309-11841

Yonatan Urman Guy Mogilevsky David Burshtein Improving Belief Propagation List Decoding of Polar Codes by Post-Processing. 2571-2576 2022 ISIT https://doi.org/10.1109/ISIT50566.2022.9834896 conf/isit/2022 db/conf/isit/isit2022.html#UrmanMB22

Barak Beilin David Burshtein On Polar Coding for Side Information Channels. 673-685 2021 67 IEEE Trans. Inf. Theory 2 https://doi.org/10.1109/TIT.2020.3035658 db/journals/tit/tit67.html#BeilinB21

Yonatan Urman David Burshtein Efficient Maximum Likelihood Decoding of Polar Codes Over the Binary Erasure Channel. 1600-1605 2021 ISIT https://doi.org/10.1109/ISIT45174.2021.9517748 conf/isit/2021 db/conf/isit/isit2021.html#UrmanB21

Guy Mogilevsky David Burshtein Belief Propagation List Ordered Statistics Decoding of Polar Codes. 2021 abs/2102.07994 CoRR https://arxiv.org/abs/2102.07994 db/journals/corr/corr2102.html#abs-2102-07994

Yonatan Urman David Burshtein Efficient Maximum Likelihood Decoding of Polar Codes Over the Binary Erasure Channel. 2021 abs/2106.14753 CoRR https://arxiv.org/abs/2106.14753 db/journals/corr/corr2106.html#abs-2106-14753

Yonatan Urman Guy Mogilevsky David Burshtein Efficient Belief Propagation List Ordered Statistics Decoding of Polar Codes. 2021 abs/2107.05965 CoRR https://arxiv.org/abs/2107.05965 db/journals/corr/corr2107.html#abs-2107-05965

Avi Caciularu David Burshtein Unsupervised Linear and Nonlinear Channel Equalization and Decoding Using Variational Autoencoders. 1003-1018 2020 6 IEEE Trans. Cogn. Commun. Netw. 3 https://doi.org/10.1109/TCCN.2020.2990773 db/journals/tccn/tccn6.html#CaciularuB20

Yonatan Urman David Burshtein Feedback Channel Communication with Low Precision Arithmetic. 2067-2072 2020 ISIT https://doi.org/10.1109/ISIT44484.2020.9174043 conf/isit/2020 db/conf/isit/isit2020.html#UrmanB20

Yonatan Urman David Burshtein Feedback Channel Communication with Low Precision Arithmetic. 2020 abs/2001.03931 CoRR https://arxiv.org/abs/2001.03931 db/journals/corr/corr2001.html#abs-2001-03931

Dina Goldin David Burshtein Performance Bounds of Concatenated Polar Coding Schemes. 7131-7148 2019 65 IEEE Trans. Inf. Theory 11 https://doi.org/10.1109/TIT.2019.2935198 db/journals/tit/tit65.html#GoldinB19

Barak Beilin David Burshtein On Polar Coding for Binary Dirty Paper. 1402-1406 2019 ISIT https://doi.org/10.1109/ISIT.2019.8849333 conf/isit/2019 db/conf/isit/isit2019.html#BeilinB19 Yoav Blum David Burshtein Blind Vocoder Speech Reconstruction using Generative Adversarial Networks. 1-6 2019 WIFS https://doi.org/10.1109/WIFS47025.2019.9035106 conf/wifs/2019 db/conf/wifs/wifs2019.html#BlumB19

Barak Beilin David Burshtein On Polar Coding for Binary Dirty Paper. 2019 abs/1904.02450 CoRR http://arxiv.org/abs/1904.02450 db/journals/corr/corr1904.html#abs-1904-02450

Avi Caciularu David Burshtein Unsupervised Linear and Nonlinear Channel Equalization and Decoding using Variational Autoencoders. 2019 abs/1905.08795 CoRR http://arxiv.org/abs/1905.08795 db/journals/corr/corr1905.html#abs-1905-08795

Eliya Nachmani Elad Marciano Loren Lugosch Warren J. Gross David Burshtein Yair Be'ery Deep Learning Methods for Improved Decoding of Linear Codes. 119-131 2018 12 IEEE J. Sel. Top. Signal Process. 1 https://doi.org/10.1109/JSTSP.2017.2788405 db/journals/jstsp/jstsp12.html#NachmaniMLGBB18

Dina Goldin David Burshtein On the Finite Length Scaling of q-Ary Polar Codes. 7153-7170 2018 64 IEEE Trans. Inf. Theory 11 https://doi.org/10.1109/TIT.2018.2865742 db/journals/tit/tit64.html#GoldinB18

Avi Caciularu David Burshtein Blind Channel Equalization Using Variational Autoencoders. 1-6 2018 ICC Workshops https://doi.org/10.1109/ICCW.2018.8403666 conf/icc/2018w db/conf/icc/icc2018w.html#CaciularuB18

Eliya Nachmani Yaron Bachar Elad Marciano David Burshtein Yair Be'ery Near Maximum Likelihood Decoding with Deep Learning. 2018 abs/1801.02726 CoRR http://arxiv.org/abs/1801.02726 db/journals/corr/corr1801.html#abs-1801-02726

Avi Caciularu David Burshtein Blind Channel Equalization using Variational Autoencoders. 2018 abs/1803.01526 CoRR http://arxiv.org/abs/1803.01526 db/journals/corr/corr1803.html#abs-1803-01526

Dina Goldin David Burshtein Performance bounds of concatenated polar coding schemes. 2603-2607 2017 ISIT https://doi.org/10.1109/ISIT.2017.8007000 conf/isit/2017 db/conf/isit/isit2017.html#GoldinB17

Eliya Nachmani Elad Marciano David Burshtein Yair Be'ery RNN Decoding of Linear Block Codes. 2017 abs/1702.07560 CoRR http://arxiv.org/abs/1702.07560 db/journals/corr/corr1702.html#NachmaniMBB17

Lior Fritz David Burshtein End-to-End MAP Training of a Hybrid HMM-DNN Model. 2017 abs/1703.10356 CoRR http://arxiv.org/abs/1703.10356 db/journals/corr/corr1703.html#FritzB17

Eliya Nachmani Elad Marciano Loren Lugosch Warren J. Gross David Burshtein Yair Be'ery Deep Learning Methods for Improved Decoding of Linear Codes. 2017 abs/1706.07043 CoRR http://arxiv.org/abs/1706.07043 db/journals/corr/corr1706.html#NachmaniMLGBB17

Dina Goldin David Burshtein Performance Bounds of Concatenated Polar Coding Schemes. 2017 abs/1710.08379 CoRR http://arxiv.org/abs/1710.08379 db/journals/corr/corr1710.html#abs-1710-08379

Leonid Geller David Burshtein Bounds on the Belief Propagation Threshold of Non-Binary LDPC Codes. 2639-2657 2016 62 IEEE Trans. Inf. Theory 5 https://doi.org/10.1109/TIT.2016.2539969 db/journals/tit/tit62.html#GellerB16

Eliya Nachmani Yair Be'ery David Burshtein Learning to decode linear codes using deep learning. 341-346 2016 Allerton https://doi.org/10.1109/ALLERTON.2016.7852251 conf/allerton/2016 db/conf/allerton/allerton2016.html#NachmaniBB16 Dina Goldin David Burshtein Block successive cancellation decoding of polarization-based codes. 256-260 2016 ISTC https://doi.org/10.1109/ISTC.2016.7593116 conf/istc/2016 db/conf/istc/istc2016.html#GoldinB16

Eliya Nachmani Yair Be'ery David Burshtein Learning to Decode Linear Codes Using Deep Learning. 2016 abs/1607.04793 CoRR http://arxiv.org/abs/1607.04793 db/journals/corr/corr1607.html#NachmaniBB16

Dina Goldin David Burshtein On the finite length scaling of ternary polar codes. 226-230 2015 ISIT https://doi.org/10.1109/ISIT.2015.7282450 conf/isit/2015 db/conf/isit/isit2015.html#GoldinB15 David Burshtein Coding for asymmetric side information channels with applications to polar codes. 1527-1531 2015 ISIT https://doi.org/10.1109/ISIT.2015.7282711 conf/isit/2015 db/conf/isit/isit2015.html#Burshtein15

Dina Goldin David Burshtein On the Finite Length Scaling of Ternary Polar Codes. 2015 abs/1502.02925 CoRR http://arxiv.org/abs/1502.02925 db/journals/corr/corr1502.html#GoldinB15

Dina Goldin David Burshtein Improved Bounds on the Finite Length Scaling of Polar Codes. 6966-6978 2014 60 IEEE Trans. Inf. Theory 11 https://doi.org/10.1109/TIT.2014.2359197 db/journals/tit/tit60.html#GoldinB14

David Burshtein Dina Goldin On the scaling of the blocklength in some polar coding schemes. 126-130 2014 ISIT https://doi.org/10.1109/ISIT.2014.6874808 conf/isit/2014 db/conf/isit/isit2014.html#BurshteinG14 Dina Goldin David Burshtein Gap to capacity in concatenated Reed-Solomon polar coding scheme. 2992-2996 2014 ISIT https://doi.org/10.1109/ISIT.2014.6875383 conf/isit/2014 db/conf/isit/isit2014.html#GoldinB14

Dina Goldin David Burshtein Iterative Linear Programming Decoding of Nonbinary LDPC Codes With Linear Complexity. 282-300 2013 59 IEEE Trans. Inf. Theory 1 https://doi.org/10.1109/TIT.2012.2211859 db/journals/tit/tit59.html#GoldinB13

David Burshtein Alona Strugatski Polar Write Once Memory Codes. 5088-5101 2013 59 IEEE Trans. Inf. Theory 8 https://doi.org/10.1109/TIT.2013.2255732 db/journals/tit/tit59.html#BurshteinS13

Idan Goldenberg David Burshtein The Approximate Maximum-Likelihood Certificate. 6049-6059 2013 59 IEEE Trans. Inf. Theory 9 https://doi.org/10.1109/TIT.2013.2263462 db/journals/tit/tit59.html#GoldenbergB13

Dina Goldin David Burshtein Improved Bounds on the Finite Length Scaling of Polar Codes. 2013 CoRR http://arxiv.org/abs/1307.5510 abs/1307.5510 db/journals/corr/corr1307.html#GoldinB13

David Burshtein Alona Strugatski Polar write once memory codes. 1972-1976 2012 ISIT https://doi.org/10.1109/ISIT.2012.6283644 conf/isit/2012 db/conf/isit/isit2012.html#BurshteinS12 Leonid Geller David Burshtein Bounds on the belief propagation threshold of non-binary LDPC codes. 357-361 2012 ITW https://doi.org/10.1109/ITW.2012.6404692 conf/itw/2012 db/conf/itw/itw2012.html#GellerB12

David Burshtein Alona Strugatski Polar write once memory codes http://arxiv.org/abs/1207.0782 2012 CoRR abs/1207.0782 db/journals/corr/corr1207.html#abs-1207-0782

Idan Goldenberg David Burshtein Error bounds for repeat-accumulate codes decoded via linear programming. 555-570 2011 5 Adv. Math. Commun. 4 https://doi.org/10.3934/amc.2011.5.555 db/journals/amco/amco5.html#GoldenbergB11

David Burshtein Idan Goldenberg Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance. 7386-7402 2011 57 IEEE Trans. Inf. Theory 11 https://doi.org/10.1109/TIT.2011.2162224 db/journals/tit/tit57.html#BurshteinG11

David Burshtein Idan Goldenberg Efficient methods for bounding the fractional distance of LDPC codes and obtaining fundamental polytopes of nonbinary and generalized codes. 1263-1267 2011 ISIT https://doi.org/10.1109/ISIT.2011.6033739 conf/isit/2011 db/conf/isit/isit2011.html#BurshteinG11 Idan Goldenberg David Burshtein The approximate maximum-likelihood certificate. 1278-1282 2011 ISIT https://doi.org/10.1109/ISIT.2011.6033742 conf/isit/2011 db/conf/isit/isit2011.html#GoldenbergB11

Idan Goldenberg David Burshtein The approximate maximum-likelihood certificate http://arxiv.org/abs/1105.3006 2011 CoRR abs/1105.3006 db/journals/corr/corr1105.html#abs-1105-3006

Ohad Barak Uri Erez David Burshtein Bounds on Rates of LDPC Codes for BEC with Varying Erasure Rate. 2835-2844 2010 58 IEEE Trans. Commun. 10 https://doi.org/10.1109/TCOMM.2010.091710.080631 db/journals/tcom/tcom58.html#BarakEB10

David Burshtein Idan Goldenberg Improved linear programming decoding and bounds on the minimum distance of LDPC codes. 1-5 2010 ITW https://doi.org/10.1109/CIG.2010.5592887 conf/itw/2010 db/conf/itw/itw2010.html#BurshteinG10

David Burshtein Idan Goldenberg Improved linear programming decoding of LDPC codes and bounds on the minimum and fractional distance http://arxiv.org/abs/1012.1425 2010 CoRR abs/1012.1425 db/journals/corr/corr1012.html#abs-1012-1425

Idan Goldenberg David Burshtein Upper bound on error exponent of regular LDPC codes transmitted over the BEC. 2674-2681 2009 55 IEEE Trans. Inf. Theory 6 https://doi.org/10.1109/TIT.2009.2018344 db/journals/tit/tit55.html#GoldenbergB09

David Burshtein Iterative approximate linear programming decoding of LDPC codes with linear complexity. 4835-4859 2009 55 IEEE Trans. Inf. Theory 11 https://doi.org/10.1109/TIT.2009.2030477 db/journals/tit/tit55.html#Burshtein09

Idan Goldenberg David Burshtein Error Bounds for Repeat-Accumulate Codes Decoded via Linear Programming http://arxiv.org/abs/0904.1692 2009 CoRR abs/0904.1692 db/journals/corr/corr0904.html#abs-0904-1692

Amir Bennatan David Burshtein On the Fading-Paper Achievable Region of the Fading MIMO Broadcast Channel. 100-115 2008 54 IEEE Trans. Inf. Theory 1 https://doi.org/10.1109/TIT.2007.911268 db/journals/tit/tit54.html#BennatanB08

David Burshtein On the Error Correction of Regular LDPC Codes Using the Flipping Algorithm. 517-530 2008 54 IEEE Trans. Inf. Theory 2 https://doi.org/10.1109/TIT.2007.913261 db/journals/tit/tit54.html#Burshtein08

Alba Sloin David Burshtein Support Vector Machine Training for Improved Hidden Markov Modeling. 172-188 2008 56 IEEE Trans. Signal Process. 1 https://doi.org/10.1109/TSP.2007.906741 db/journals/tsp/tsp56.html#SloinB08

Ohad Barak Uri Erez David Burshtein Bounds on rates of LDPC codes for BEC with varying erasure rate. 1133-1137 2008 ISIT https://doi.org/10.1109/ISIT.2008.4595164 conf/isit/2008 db/conf/isit/isit2008.html#BarakEB08 David Burshtein Iterative approximate linear programming decoding of LDPC codes with linear complexity. 1498-1502 2008 ISIT https://doi.org/10.1109/ISIT.2008.4595237 conf/isit/2008 db/conf/isit/isit2008.html#Burshtein08

Idan Goldenberg David Burshtein Upper Bound on Error Exponent of Regular LDPC Codes Transmitted over the BEC http://arxiv.org/abs/0803.2460 2008 CoRR abs/0803.2460 db/journals/corr/corr0803.html#abs-0803-2460

Hagai Aronowitz David Burshtein Efficient Speaker Recognition Using Approximated Cross Entropy (ACE). 2033-2043 2007 15 IEEE Trans. Speech Audio Process. 7 https://doi.org/10.1109/TASL.2007.902059 db/journals/taslp/taslp15.html#AronowitzB07

Shay Freundlich David Burshtein Simon Litsyn Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity. 1484-1494 2007 53 IEEE Trans. Inf. Theory 4 https://doi.org/10.1109/TIT.2007.892771 db/journals/tit/tit53.html#FreundlichBL07

Ohad Barak David Burshtein Lower Bounds on the Error Rate of LDPC Code Ensembles. 4225-4236 2007 53 IEEE Trans. Inf. Theory 11 https://doi.org/10.1109/TIT.2007.907448 db/journals/tit/tit53.html#BarakB07

David Burshtein On the error correction of regular LDPC codes using the flipping algorithm. 226-230 2007 ISIT https://doi.org/10.1109/ISIT.2007.4557085 conf/isit/2007 db/conf/isit/isit2007.html#Burshtein07

Amir Bennatan David Burshtein Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels. 549-583 2006 52 IEEE Trans. Inf. Theory 2 https://doi.org/10.1109/TIT.2005.862080 db/journals/tit/tit52.html#BennatanB06

Amir Bennatan David Burshtein Giuseppe Caire Shlomo Shamai Superposition coding for side-information channels. 1872-1889 2006 52 IEEE Trans. Inf. Theory 5 https://doi.org/10.1109/TIT.2006.872985 db/journals/tit/tit52.html#BennatanBCS06

David Burshtein Ohad Barak Upper Bounds on the Error Exponents of LDPC Code Ensembles. 401-405 2006 ISIT https://doi.org/10.1109/ISIT.2006.261699 conf/isit/2006 db/conf/isit/isit2006.html#BurshteinB06 Shay Freundlich David Burshtein Simon Litsyn Approximately Lower Triangular Ensembles of LPDC Codes with Linear Encoding Complexity. 821-825 2006 ISIT https://doi.org/10.1109/ISIT.2006.261728 conf/isit/2006 db/conf/isit/isit2006.html#FreundlichBL06

Amir Bennatan David Burshtein On the Fading Paper Achievable Region of the Fading MIMO Broadcast Channel http://arxiv.org/abs/cs/0610021 2006 CoRR abs/cs/0610021 db/journals/corr/corr0610.html#abs-cs-0610021

Hagai Aronowitz David Burshtein Amihood Amir A Session-GMM Generative Model Using Test Utterance Gaussian Mixture Modeling for Speaker Verification. 733-736 2005 ICASSP (1) https://doi.org/10.1109/ICASSP.2005.1415218 conf/icassp/2005 db/conf/icassp/icassp2005.html#AronowitzBA05 Hagai Aronowitz Dror Irony David Burshtein Modeling intra-speaker variability for speaker recognition. 2177-2180 2005 INTERSPEECH https://doi.org/10.21437/Interspeech.2005-643 conf/interspeech/2005 db/conf/interspeech/interspeech2005.html#AronowitzIB05 Hagai Aronowitz David Burshtein Efficient speaker identification and retrieval. 2433-2436 2005 INTERSPEECH https://doi.org/10.21437/Interspeech.2005-649 conf/interspeech/2005 db/conf/interspeech/interspeech2005.html#AronowitzB05 Amir Bennatan David Burshtein EXIT charts for non-binary LDPC codes over arbitrary discrete-memoryless channels. 37-41 2005 ISIT https://doi.org/10.1109/ISIT.2005.1523288 conf/isit/2005 db/conf/isit/isit2005.html#BennatanB05 Ohad Barak David Burshtein Lower bounds on the spectrum and error rate LDPC code ensembles. 42-46 2005 ISIT https://doi.org/10.1109/ISIT.2005.1523289 conf/isit/2005 db/conf/isit/isit2005.html#BarakB05

Amir Bennatan David Burshtein Design and Analysis of Nonbinary LDPC Codes for Arbitrary Discrete-Memoryless Channels http://arxiv.org/abs/cs/0511040 2005 CoRR abs/cs/0511040 db/journals/corr/corr0511.html#abs-cs-0511040

Assaf Ben-Yishai David Burshtein A discriminative training algorithm for hidden Markov models. 204-217 2004 12 IEEE Trans. Speech Audio Process. 3 https://doi.org/10.1109/TSA.2003.822639 db/journals/taslp/taslp12.html#Ben-YishaiB04

Amir Bennatan David Burshtein On the application of LDPC codes to arbitrary discrete-memoryless channels. 417-438 2004 50 IEEE Trans. Inf. Theory 3 db/journals/tit/tit50.html#BennatanB04 https://doi.org/10.1109/TIT.2004.824917

David Burshtein Gadi Miller Asymptotic Enumeration Methods for Analyzing LDPC Codes. 1115-1131 2004 50 IEEE Trans. Inf. Theory 6 db/journals/tit/tit50.html#BurshteinM04 https://doi.org/10.1109/TIT.2004.828064

Ohad Barak David Burshtein Meir Feder Bounds on achievable rates of LDPC codes used over the binary erasure channel. 2483-2492 2004 50 IEEE Trans. Inf. Theory 10 db/journals/tit/tit50.html#BarakBF04 https://doi.org/10.1109/TIT.2004.834845

David Burshtein Gadi Miller An Efficient Maximum-Likelihood Decoding of LDPC Codes Over the Binary Erasure Channel. 2837-2844 2004 50 IEEE Trans. Inf. Theory 11 db/journals/tit/tit50.html#BurshteinM04a https://doi.org/10.1109/TIT.2004.836694

Sharon Gannot David Burshtein Ehud Weinstein Analysis of the power spectral deviation of the general transfer function GSC. 1115-1120 2004 52 IEEE Trans. Signal Process. 4 https://doi.org/10.1109/TSP.2004.823487 db/journals/tsp/tsp52.html#GannotBW04

Hagai Aronowitz David Burshtein Amihood Amir Speaker indexing in audio archives using test utterance Gaussian mixture modeling. 2004 INTERSPEECH https://doi.org/10.21437/Interspeech.2004-252 conf/interspeech/2004 db/conf/interspeech/interspeech2004.html#AronowitzBA04 609-612 Hagai Aronowitz David Burshtein Amihood Amir Text independent speaker recognition using speaker dependent word spotting. 2004 INTERSPEECH https://doi.org/10.21437/Interspeech.2004-516 conf/interspeech/2004 db/conf/interspeech/interspeech2004.html#AronowitzBA04a 1789-1792 Hagai Aronowitz David Burshtein Amihood Amir Speaker Indexing in Audio Archives Using Gaussian Mixture Scoring Simulation. 243-252 https://doi.org/10.1007/978-3-540-30568-2_21 2004 conf/mlmi/2004 MLMI db/conf/mlmi/mlmi2004.html#AronowitzBA04

Ran Yaniv David Burshtein An enhanced dynamic time warping model for improved estimation of DTW parameters. 216-228 2003 11 IEEE Trans. Speech Audio Process. 3 https://doi.org/10.1109/TSA.2003.811540 db/journals/taslp/taslp11.html#YanivB03

David Burshtein Sharon Gannot Speech enhancement using a mixture-maximum model. 341-351 2002 10 IEEE Trans. Speech Audio Process. 6 https://doi.org/10.1109/TSA.2002.803420 db/journals/taslp/taslp10.html#BurshteinG02

David Burshtein Gadi Miller Bounds on the performance of belief propagation decoding. 112-122 2002 48 IEEE Trans. Inf. Theory 1 db/journals/tit/tit48.html#BurshteinM02 https://doi.org/10.1109/18.971742

David Burshtein Michael Krivelevich Simon Litsyn Gadi Miller Upper bounds on the rate of LDPC Codes. 2437-2449 2002 48 IEEE Trans. Inf. Theory 9 db/journals/tit/tit48.html#BurshteinKLM02 https://doi.org/10.1109/TIT.2002.801408

David Burshtein Doron Rainish Shlomo Shamai David Ben-Eli Fast synchronization method for CDMA communication systems. 2396-2405 2001 19 IEEE J. Sel. Areas Commun. 12 https://doi.org/10.1109/49.974605 db/journals/jsac/jsac19.html#BurshteinRSB01

Yosef Bendel David Burshtein Ofir Shalvi Ehud Weinstein Delayless frequency domain acoustic echo cancellation. 589-597 2001 9 IEEE Trans. Speech Audio Process. 5 https://doi.org/10.1109/89.928923 db/journals/taslp/taslp9.html#BendelBSW01

David Burshtein Gadi Miller Expander graph arguments for message-passing algorithms. 782-790 2001 47 IEEE Trans. Inf. Theory 2 db/journals/tit/tit47.html#BurshteinM01 https://doi.org/10.1109/18.910588

Gadi Miller David Burshtein Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes. 2696-2710 2001 47 IEEE Trans. Inf. Theory 7 db/journals/tit/tit47.html#MillerB01 https://doi.org/10.1109/18.959254

Sharon Gannot David Burshtein Ehud Weinstein Signal enhancement using beamforming and nonstationarity with applications to speech. 1614-1626 2001 49 IEEE Trans. Signal Process. 8 https://doi.org/10.1109/78.934132 db/journals/tsp/tsp49.html#GannotBW01

Jacob Goldberger David Burshtein Horacio Franco Segmental modeling using a continuous mixture of nonparametric models. 262-271 1999 7 IEEE Trans. Speech Audio Process. 3 https://doi.org/10.1109/89.759032 db/journals/taslp/taslp7.html#GoldbergerBF99

David Burshtein Sharon Gannot Speech enhancement using a mixture-maximum model. 1999 EUROSPEECH https://doi.org/10.21437/Eurospeech.1999-653 conf/interspeech/1999 db/conf/interspeech/eurospeech1999.html#BurshteinG99 2591-2594

Jacob Goldberger David Burshtein Scaled random trajectory segment models. 51-73 1998 12 Comput. Speech Lang. 1 https://doi.org/10.1006/csla.1997.0035 db/journals/csl/csl12.html#GoldbergerB98

Sharon Gannot David Burshtein Ehud Weinstein Iterative and sequential Kalman filter-based speech enhancement algorithms. 373-385 1998 6 IEEE Trans. Speech Audio Process. 4 https://doi.org/10.1109/89.701367 db/journals/taslp/taslp6.html#GannotBW98

David Burshtein Typical Error Pattern Recovery of the Hopfield Memory under Error-Tolerant Conditions. 861-865 1998 44 IEEE Trans. Inf. Theory 2 db/journals/tit/tit44.html#Burshtein98 https://doi.org/10.1109/18.661536

David Burshtein Long-term attraction in higher order neural networks. 42-50 1998 9 IEEE Trans. Neural Networks 1 https://doi.org/10.1109/72.655028 https://www.wikidata.org/entity/Q47932574 db/journals/tnn/tnn9.html#Burshtein98

Jacob Goldberger David Burshtein Scaled random segmental models. 809-812 1998 ICASSP https://doi.org/10.1109/ICASSP.1998.675388 conf/icassp/1998 db/conf/icassp/icassp1998.html#GoldbergerB98

Adoram Erell David Burshtein Noise adaptation of HMM speech recognition systems using tied-mixtures in the spectral domain. 72-74 1997 5 IEEE Trans. Speech Audio Process. 1 https://doi.org/10.1109/89.554271 db/journals/taslp/taslp5.html#ErellB97

Sharon Gannot David Burshtein Ehud Weinstein Iterative-batch and sequential algorithms for single microphone speech enhancement. 1215-1218 1997 ICASSP https://doi.org/10.1109/ICASSP.1997.596163 https://doi.ieeecomputersociety.org/10.1109/ICASSP.1997.596163 conf/icassp/1997 db/conf/icassp/icassp1997.html#GannotBW97 Jacob Goldberger David Burshtein Horacio Franco Segmental modeling using a continuous mixture of non-parametric models. 1997 EUROSPEECH https://doi.org/10.21437/Eurospeech.1997-22 conf/interspeech/1997 db/conf/interspeech/eurospeech1997.html#GoldbergerBF97 1195-1198

David Burshtein Robust parametric modeling of durations in hidden Markov models. 240-242 1996 4 IEEE Trans. Speech Audio Process. 3 https://doi.org/10.1109/89.496221 db/journals/taslp/taslp4.html#Burshtein96

David Burshtein Robust parametric modeling of durations in hidden Markov models. 548-551 1995 ICASSP https://doi.org/10.1109/ICASSP.1995.479656 https://doi.ieeecomputersociety.org/10.1109/ICASSP.1995.479656 conf/icassp/1995 db/conf/icassp/icassp1995.html#Burshtein95

David Burshtein Nondirect convergence radius and number of iterations of the Hopfield associative memory. 838-847 1994 40 IEEE Trans. Inf. Theory 3 db/journals/tit/tit40.html#Burshtein94 https://doi.org/10.1109/18.335894

David Burshtein An efficient algorithm for calculating the likelihood and likelihood gradient of ARMA models. 336-340 1993 38 IEEE Trans. Autom. Control. 2 https://doi.org/10.1109/9.250487 db/journals/tac/tac38.html#Burshtein93

David Burshtein Joint maximum likelihood estimation of pitch and AR parameters using the EM algorithm. 797-800 1990 ICASSP https://doi.org/10.1109/ICASSP.1990.115933 conf/icassp/1990 db/conf/icassp/icassp1990.html#Burshtein90 Lalit R. Bahl Raimo Bakis Jerome R. Bellegarda Peter F. Brown David Burshtein Subrata K. Das Peter V. de Souza P. S. Gopalakrishnan Frederick Jelinek Dimitri Kanevsky Robert L. Mercer Arthur Nádas David Nahamoo Michael A. Picheny Large vocabulary natural language continuous speech recognition. 465-467 1989 ICASSP https://doi.org/10.1109/ICASSP.1989.266464 conf/icassp/1989 db/conf/icassp/icassp1989.html#BahlBBBBDSGJKMN89

David Burshtein Ehud Weinstein Confidence intervals for the maximum entropy spectrum. 504-510 1987 35 IEEE Trans. Acoust. Speech Signal Process. 4 https://doi.org/10.1109/TASSP.1987.1165156 db/journals/tsp/tsp35.html#BurshteinW87

David Burshtein Ehud Weinstein Some relations between the various criteria for autoregressive model order determination. 1017-1019 1985 33 IEEE Trans. Acoust. Speech Signal Process. 4 https://doi.org/10.1109/TASSP.1985.1164656 db/journals/tsp/tsp33.html#BurshteinW85

Amihood Amir Hagai Aronowitz Yaron Bachar Lalit R. Bahl Raimo Bakis Ohad Barak Yair Be'ery Barak Beilin Jerome R. Bellegarda David Ben-Eli Assaf Ben-Yishai Yosef Bendel Amir Bennatan Eli Bery Yoav Blum Peter F. Brown Avi Caciularu Giuseppe Caire Subrata K. Das Adoram Erell Uri Erez Meir Feder Horacio Franco Shay Freundlich Lior Fritz Sharon Gannot Leonid Geller Jacob Goldberger Idan Goldenberg Dina Goldin Ponani S. GopalakrishnanP. S. Gopalakrishnan Warren J. Gross Dror Irony Frederick Jelinek Dimitri Kanevsky Michael Krivelevich Simon Litsyn Loren Lugosch Elad Marciano Robert L. Mercer Gadi Miller Guy Mogilevsky Eliya Nachmani Arthur Nádas David Nahamoo Michael PichenyMichael A. Picheny Doron Rainish Ofir Shalvi Shlomo Shamai Alba Sloin Peter V. de Souza Alona Strugatski Yonatan Urman Ehud Weinstein Efrayim Yanir Ran Yaniv