default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Burshtein
Person information
- affiliation: Tel Aviv University, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c39]David Burshtein, Eli Bery:
Semi-Supervised Variational Inference over Nonlinear Channels. SPAWC 2023: 611-615- [i23]David Burshtein, Eli Bery:
Semi-Supervised Variational Inference over Nonlinear Channels. CoRR abs/2309.11841 (2023) - 2022
- [c38]Yonatan Urman, Guy Mogilevsky, David Burshtein:
Improving Belief Propagation List Decoding of Polar Codes by Post-Processing. ISIT 2022: 2571-2576 - 2021
- [j49]Barak Beilin
, David Burshtein:
On Polar Coding for Side Information Channels. IEEE Trans. Inf. Theory 67(2): 673-685 (2021) - [c37]Yonatan Urman, David Burshtein:
Efficient Maximum Likelihood Decoding of Polar Codes Over the Binary Erasure Channel. ISIT 2021: 1600-1605 - [i22]Guy Mogilevsky, David Burshtein:
Belief Propagation List Ordered Statistics Decoding of Polar Codes. CoRR abs/2102.07994 (2021) - [i21]Yonatan Urman, David Burshtein:
Efficient Maximum Likelihood Decoding of Polar Codes Over the Binary Erasure Channel. CoRR abs/2106.14753 (2021) - [i20]Yonatan Urman, Guy Mogilevsky, David Burshtein:
Efficient Belief Propagation List Ordered Statistics Decoding of Polar Codes. CoRR abs/2107.05965 (2021) - 2020
- [j48]Avi Caciularu, David Burshtein:
Unsupervised Linear and Nonlinear Channel Equalization and Decoding Using Variational Autoencoders. IEEE Trans. Cogn. Commun. Netw. 6(3): 1003-1018 (2020) - [c36]Yonatan Urman, David Burshtein:
Feedback Channel Communication with Low Precision Arithmetic. ISIT 2020: 2067-2072 - [i19]Yonatan Urman, David Burshtein:
Feedback Channel Communication with Low Precision Arithmetic. CoRR abs/2001.03931 (2020)
2010 – 2019
- 2019
- [j47]Dina Goldin, David Burshtein:
Performance Bounds of Concatenated Polar Coding Schemes. IEEE Trans. Inf. Theory 65(11): 7131-7148 (2019) - [c35]Barak Beilin, David Burshtein:
On Polar Coding for Binary Dirty Paper. ISIT 2019: 1402-1406 - [c34]Yoav Blum, David Burshtein:
Blind Vocoder Speech Reconstruction using Generative Adversarial Networks. WIFS 2019: 1-6 - [i18]Barak Beilin, David Burshtein:
On Polar Coding for Binary Dirty Paper. CoRR abs/1904.02450 (2019) - [i17]Avi Caciularu, David Burshtein:
Unsupervised Linear and Nonlinear Channel Equalization and Decoding using Variational Autoencoders. CoRR abs/1905.08795 (2019) - 2018
- [j46]Eliya Nachmani, Elad Marciano, Loren Lugosch, Warren J. Gross, David Burshtein, Yair Be'ery:
Deep Learning Methods for Improved Decoding of Linear Codes. IEEE J. Sel. Top. Signal Process. 12(1): 119-131 (2018) - [j45]Dina Goldin, David Burshtein:
On the Finite Length Scaling of q-Ary Polar Codes. IEEE Trans. Inf. Theory 64(11): 7153-7170 (2018) - [c33]Avi Caciularu, David Burshtein:
Blind Channel Equalization Using Variational Autoencoders. ICC Workshops 2018: 1-6 - [i16]Eliya Nachmani, Yaron Bachar, Elad Marciano, David Burshtein, Yair Be'ery:
Near Maximum Likelihood Decoding with Deep Learning. CoRR abs/1801.02726 (2018) - [i15]Avi Caciularu, David Burshtein:
Blind Channel Equalization using Variational Autoencoders. CoRR abs/1803.01526 (2018) - 2017
- [c32]Dina Goldin, David Burshtein:
Performance bounds of concatenated polar coding schemes. ISIT 2017: 2603-2607 - [i14]Eliya Nachmani, Elad Marciano, David Burshtein, Yair Be'ery:
RNN Decoding of Linear Block Codes. CoRR abs/1702.07560 (2017) - [i13]Lior Fritz, David Burshtein:
End-to-End MAP Training of a Hybrid HMM-DNN Model. CoRR abs/1703.10356 (2017) - [i12]Eliya Nachmani, Elad Marciano, Loren Lugosch, Warren J. Gross, David Burshtein, Yair Be'ery:
Deep Learning Methods for Improved Decoding of Linear Codes. CoRR abs/1706.07043 (2017) - [i11]Dina Goldin, David Burshtein:
Performance Bounds of Concatenated Polar Coding Schemes. CoRR abs/1710.08379 (2017) - 2016
- [j44]Leonid Geller, David Burshtein:
Bounds on the Belief Propagation Threshold of Non-Binary LDPC Codes. IEEE Trans. Inf. Theory 62(5): 2639-2657 (2016) - [c31]Eliya Nachmani, Yair Be'ery, David Burshtein:
Learning to decode linear codes using deep learning. Allerton 2016: 341-346 - [c30]Dina Goldin, David Burshtein:
Block successive cancellation decoding of polarization-based codes. ISTC 2016: 256-260 - [i10]Eliya Nachmani, Yair Be'ery, David Burshtein:
Learning to Decode Linear Codes Using Deep Learning. CoRR abs/1607.04793 (2016) - 2015
- [c29]Dina Goldin, David Burshtein:
On the finite length scaling of ternary polar codes. ISIT 2015: 226-230 - [c28]David Burshtein:
Coding for asymmetric side information channels with applications to polar codes. ISIT 2015: 1527-1531 - [i9]Dina Goldin, David Burshtein:
On the Finite Length Scaling of Ternary Polar Codes. CoRR abs/1502.02925 (2015) - 2014
- [j43]Dina Goldin, David Burshtein:
Improved Bounds on the Finite Length Scaling of Polar Codes. IEEE Trans. Inf. Theory 60(11): 6966-6978 (2014) - [c27]David Burshtein, Dina Goldin:
On the scaling of the blocklength in some polar coding schemes. ISIT 2014: 126-130 - [c26]Dina Goldin, David Burshtein:
Gap to capacity in concatenated Reed-Solomon polar coding scheme. ISIT 2014: 2992-2996 - 2013
- [j42]Dina Goldin, David Burshtein:
Iterative Linear Programming Decoding of Nonbinary LDPC Codes With Linear Complexity. IEEE Trans. Inf. Theory 59(1): 282-300 (2013) - [j41]David Burshtein, Alona Strugatski:
Polar Write Once Memory Codes. IEEE Trans. Inf. Theory 59(8): 5088-5101 (2013) - [j40]Idan Goldenberg, David Burshtein:
The Approximate Maximum-Likelihood Certificate. IEEE Trans. Inf. Theory 59(9): 6049-6059 (2013) - [i8]Dina Goldin, David Burshtein:
Improved Bounds on the Finite Length Scaling of Polar Codes. CoRR abs/1307.5510 (2013) - 2012
- [c25]David Burshtein, Alona Strugatski:
Polar write once memory codes. ISIT 2012: 1972-1976 - [c24]Leonid Geller, David Burshtein:
Bounds on the belief propagation threshold of non-binary LDPC codes. ITW 2012: 357-361 - [i7]David Burshtein, Alona Strugatski:
Polar write once memory codes. CoRR abs/1207.0782 (2012) - 2011
- [j39]Idan Goldenberg, David Burshtein:
Error bounds for repeat-accumulate codes decoded via linear programming. Adv. Math. Commun. 5(4): 555-570 (2011) - [j38]David Burshtein, Idan Goldenberg:
Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance. IEEE Trans. Inf. Theory 57(11): 7386-7402 (2011) - [c23]David Burshtein, Idan Goldenberg:
Efficient methods for bounding the fractional distance of LDPC codes and obtaining fundamental polytopes of nonbinary and generalized codes. ISIT 2011: 1263-1267 - [c22]Idan Goldenberg, David Burshtein:
The approximate maximum-likelihood certificate. ISIT 2011: 1278-1282 - [i6]Idan Goldenberg, David Burshtein:
The approximate maximum-likelihood certificate. CoRR abs/1105.3006 (2011) - 2010
- [j37]Ohad Barak, Uri Erez, David Burshtein:
Bounds on Rates of LDPC Codes for BEC with Varying Erasure Rate. IEEE Trans. Commun. 58(10): 2835-2844 (2010) - [c21]David Burshtein, Idan Goldenberg:
Improved linear programming decoding and bounds on the minimum distance of LDPC codes. ITW 2010: 1-5 - [i5]David Burshtein, Idan Goldenberg:
Improved linear programming decoding of LDPC codes and bounds on the minimum and fractional distance. CoRR abs/1012.1425 (2010)
2000 – 2009
- 2009
- [j36]Idan Goldenberg, David Burshtein:
Upper bound on error exponent of regular LDPC codes transmitted over the BEC. IEEE Trans. Inf. Theory 55(6): 2674-2681 (2009) - [j35]David Burshtein:
Iterative approximate linear programming decoding of LDPC codes with linear complexity. IEEE Trans. Inf. Theory 55(11): 4835-4859 (2009) - [i4]Idan Goldenberg, David Burshtein:
Error Bounds for Repeat-Accumulate Codes Decoded via Linear Programming. CoRR abs/0904.1692 (2009) - 2008
- [j34]Amir Bennatan, David Burshtein:
On the Fading-Paper Achievable Region of the Fading MIMO Broadcast Channel. IEEE Trans. Inf. Theory 54(1): 100-115 (2008) - [j33]David Burshtein:
On the Error Correction of Regular LDPC Codes Using the Flipping Algorithm. IEEE Trans. Inf. Theory 54(2): 517-530 (2008) - [j32]Alba Sloin, David Burshtein:
Support Vector Machine Training for Improved Hidden Markov Modeling. IEEE Trans. Signal Process. 56(1): 172-188 (2008) - [c20]Ohad Barak, Uri Erez, David Burshtein:
Bounds on rates of LDPC codes for BEC with varying erasure rate. ISIT 2008: 1133-1137 - [c19]David Burshtein:
Iterative approximate linear programming decoding of LDPC codes with linear complexity. ISIT 2008: 1498-1502 - [i3]Idan Goldenberg, David Burshtein:
Upper Bound on Error Exponent of Regular LDPC Codes Transmitted over the BEC. CoRR abs/0803.2460 (2008) - 2007
- [j31]Hagai Aronowitz, David Burshtein:
Efficient Speaker Recognition Using Approximated Cross Entropy (ACE). IEEE Trans. Speech Audio Process. 15(7): 2033-2043 (2007) - [j30]Shay Freundlich, David Burshtein, Simon Litsyn:
Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity. IEEE Trans. Inf. Theory 53(4): 1484-1494 (2007) - [j29]Ohad Barak, David Burshtein:
Lower Bounds on the Error Rate of LDPC Code Ensembles. IEEE Trans. Inf. Theory 53(11): 4225-4236 (2007) - [c18]David Burshtein:
On the error correction of regular LDPC codes using the flipping algorithm. ISIT 2007: 226-230 - 2006
- [j28]Amir Bennatan, David Burshtein:
Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels. IEEE Trans. Inf. Theory 52(2): 549-583 (2006) - [j27]Amir Bennatan, David Burshtein, Giuseppe Caire, Shlomo Shamai:
Superposition coding for side-information channels. IEEE Trans. Inf. Theory 52(5): 1872-1889 (2006) - [c17]David Burshtein, Ohad Barak:
Upper Bounds on the Error Exponents of LDPC Code Ensembles. ISIT 2006: 401-405 - [c16]Shay Freundlich, David Burshtein, Simon Litsyn:
Approximately Lower Triangular Ensembles of LPDC Codes with Linear Encoding Complexity. ISIT 2006: 821-825 - [i2]Amir Bennatan, David Burshtein:
On the Fading Paper Achievable Region of the Fading MIMO Broadcast Channel. CoRR abs/cs/0610021 (2006) - 2005
- [c15]Hagai Aronowitz, David Burshtein, Amihood Amir:
A Session-GMM Generative Model Using Test Utterance Gaussian Mixture Modeling for Speaker Verification. ICASSP (1) 2005: 733-736 - [c14]Hagai Aronowitz, Dror Irony, David Burshtein:
Modeling intra-speaker variability for speaker recognition. INTERSPEECH 2005: 2177-2180 - [c13]Hagai Aronowitz, David Burshtein:
Efficient speaker identification and retrieval. INTERSPEECH 2005: 2433-2436 - [c12]Amir Bennatan, David Burshtein:
EXIT charts for non-binary LDPC codes over arbitrary discrete-memoryless channels. ISIT 2005: 37-41 - [c11]Ohad Barak, David Burshtein:
Lower bounds on the spectrum and error rate LDPC code ensembles. ISIT 2005: 42-46 - [i1]Amir Bennatan, David Burshtein:
Design and Analysis of Nonbinary LDPC Codes for Arbitrary Discrete-Memoryless Channels. CoRR abs/cs/0511040 (2005) - 2004
- [j26]Assaf Ben-Yishai, David Burshtein:
A discriminative training algorithm for hidden Markov models. IEEE Trans. Speech Audio Process. 12(3): 204-217 (2004) - [j25]Amir Bennatan, David Burshtein:
On the application of LDPC codes to arbitrary discrete-memoryless channels. IEEE Trans. Inf. Theory 50(3): 417-438 (2004) - [j24]David Burshtein, Gadi Miller:
Asymptotic Enumeration Methods for Analyzing LDPC Codes. IEEE Trans. Inf. Theory 50(6): 1115-1131 (2004) - [j23]Ohad Barak, David Burshtein, Meir Feder:
Bounds on achievable rates of LDPC codes used over the binary erasure channel. IEEE Trans. Inf. Theory 50(10): 2483-2492 (2004) - [j22]David Burshtein, Gadi Miller:
An Efficient Maximum-Likelihood Decoding of LDPC Codes Over the Binary Erasure Channel. IEEE Trans. Inf. Theory 50(11): 2837-2844 (2004) - [j21]Sharon Gannot, David Burshtein, Ehud Weinstein:
Analysis of the power spectral deviation of the general transfer function GSC. IEEE Trans. Signal Process. 52(4): 1115-1120 (2004) - [c10]Hagai Aronowitz, David Burshtein, Amihood Amir:
Speaker indexing in audio archives using test utterance Gaussian mixture modeling. INTERSPEECH 2004: 609-612 - [c9]Hagai Aronowitz, David Burshtein, Amihood Amir:
Text independent speaker recognition using speaker dependent word spotting. INTERSPEECH 2004: 1789-1792 - [c8]Hagai Aronowitz, David Burshtein, Amihood Amir:
Speaker Indexing in Audio Archives Using Gaussian Mixture Scoring Simulation. MLMI 2004: 243-252 - 2003
- [j20]Ran Yaniv, David Burshtein:
An enhanced dynamic time warping model for improved estimation of DTW parameters. IEEE Trans. Speech Audio Process. 11(3): 216-228 (2003) - 2002
- [j19]David Burshtein, Sharon Gannot:
Speech enhancement using a mixture-maximum model. IEEE Trans. Speech Audio Process. 10(6): 341-351 (2002) - [j18]David Burshtein, Gadi Miller:
Bounds on the performance of belief propagation decoding. IEEE Trans. Inf. Theory 48(1): 112-122 (2002) - [j17]David Burshtein, Michael Krivelevich, Simon Litsyn, Gadi Miller:
Upper bounds on the rate of LDPC Codes. IEEE Trans. Inf. Theory 48(9): 2437-2449 (2002) - 2001
- [j16]David Burshtein, Doron Rainish, Shlomo Shamai, David Ben-Eli:
Fast synchronization method for CDMA communication systems. IEEE J. Sel. Areas Commun. 19(12): 2396-2405 (2001) - [j15]Yosef Bendel, David Burshtein, Ofir Shalvi, Ehud Weinstein:
Delayless frequency domain acoustic echo cancellation. IEEE Trans. Speech Audio Process. 9(5): 589-597 (2001) - [j14]David Burshtein, Gadi Miller:
Expander graph arguments for message-passing algorithms. IEEE Trans. Inf. Theory 47(2): 782-790 (2001) - [j13]Gadi Miller, David Burshtein:
Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes. IEEE Trans. Inf. Theory 47(7): 2696-2710 (2001) - [j12]Sharon Gannot, David Burshtein, Ehud Weinstein:
Signal enhancement using beamforming and nonstationarity with applications to speech. IEEE Trans. Signal Process. 49(8): 1614-1626 (2001)
1990 – 1999
- 1999
- [j11]Jacob Goldberger, David Burshtein, Horacio Franco:
Segmental modeling using a continuous mixture of nonparametric models. IEEE Trans. Speech Audio Process. 7(3): 262-271 (1999) - [c7]David Burshtein, Sharon Gannot:
Speech enhancement using a mixture-maximum model. EUROSPEECH 1999: 2591-2594 - 1998
- [j10]Jacob Goldberger, David Burshtein:
Scaled random trajectory segment models. Comput. Speech Lang. 12(1): 51-73 (1998) - [j9]Sharon Gannot, David Burshtein, Ehud Weinstein:
Iterative and sequential Kalman filter-based speech enhancement algorithms. IEEE Trans. Speech Audio Process. 6(4): 373-385 (1998) - [j8]David Burshtein:
Typical Error Pattern Recovery of the Hopfield Memory under Error-Tolerant Conditions. IEEE Trans. Inf. Theory 44(2): 861-865 (1998) - [j7]David Burshtein:
Long-term attraction in higher order neural networks. IEEE Trans. Neural Networks 9(1): 42-50 (1998) - [c6]Jacob Goldberger, David Burshtein:
Scaled random segmental models. ICASSP 1998: 809-812 - 1997
- [j6]Adoram Erell, David Burshtein:
Noise adaptation of HMM speech recognition systems using tied-mixtures in the spectral domain. IEEE Trans. Speech Audio Process. 5(1): 72-74 (1997) - [c5]Sharon Gannot, David Burshtein, Ehud Weinstein:
Iterative-batch and sequential algorithms for single microphone speech enhancement. ICASSP 1997: 1215-1218 - [c4]Jacob Goldberger, David Burshtein, Horacio Franco:
Segmental modeling using a continuous mixture of non-parametric models. EUROSPEECH 1997: 1195-1198 - 1996
- [j5]David Burshtein:
Robust parametric modeling of durations in hidden Markov models. IEEE Trans. Speech Audio Process. 4(3): 240-242 (1996) - 1995
- [c3]David Burshtein:
Robust parametric modeling of durations in hidden Markov models. ICASSP 1995: 548-551 - 1994
- [j4]David Burshtein:
Nondirect convergence radius and number of iterations of the Hopfield associative memory. IEEE Trans. Inf. Theory 40(3): 838-847 (1994) - 1993
- [j3]David Burshtein:
An efficient algorithm for calculating the likelihood and likelihood gradient of ARMA models. IEEE Trans. Autom. Control. 38(2): 336-340 (1993) - 1990
- [c2]David Burshtein:
Joint maximum likelihood estimation of pitch and AR parameters using the EM algorithm. ICASSP 1990: 797-800
1980 – 1989
- 1989
- [c1]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. ICASSP 1989: 465-467 - 1987
- [j2]David Burshtein, Ehud Weinstein:
Confidence intervals for the maximum entropy spectrum. IEEE Trans. Acoust. Speech Signal Process. 35(4): 504-510 (1987) - 1985
- [j1]David Burshtein, Ehud Weinstein:
Some relations between the various criteria for autoregressive model order determination. IEEE Trans. Acoust. Speech Signal Process. 33(4): 1017-1019 (1985)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-19 23:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
