David Burshtein

Available identifiers

zbMath Open burshtein.davidMaRDI QIDQ220457

List of research outcomes

Publication	Date of Publication	Type
On Polar Coding for Side Information Channels	2021-02-24	Paper
Performance Bounds of Concatenated Polar Coding Schemes	2020-01-28	Paper
On the Finite Length Scaling of <inline-formula> <tex-math notation="LaTeX">$q$ </tex-math> </inline-formula>-Ary Polar Codes	2018-12-04	Paper
Support Vector Machine Training for Improved Hidden Markov Modeling	2018-06-27	Paper
Analysis of the Power Spectral Deviation of the General Transfer Function GSC	2017-09-08	Paper
Iterative Approximate Linear Programming Decoding of LDPC Codes With Linear Complexity	2017-08-08	Paper
Upper Bound on Error Exponent of Regular LDPC Codes Transmitted Over the BEC	2017-08-08	Paper
Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance	2017-07-12	Paper
Iterative Linear Programming Decoding of Nonbinary LDPC Codes With Linear Complexity	2017-06-08	Paper
The Approximate Maximum-Likelihood Certificate	2017-06-08	Paper
Polar Write Once Memory Codes	2017-06-08	Paper
Improved Bounds on the Finite Length Scaling of Polar Codes	2017-05-16	Paper
Bounds on the Belief Propagation Threshold of Non-Binary LDPC Codes	2017-04-28	Paper
Error bounds for repeat-accumulate codes decoded via linear programming	2012-01-25	Paper
On the Error Correction of Regular LDPC Codes Using the Flipping Algorithm	2009-02-24	Paper
On the Fading-Paper Achievable Region of the Fading MIMO Broadcast Channel	2009-02-24	Paper
Bounds on Achievable Rates of LDPC Codes Used Over the Binary Erasure Channel	2008-12-21	Paper
On the Application of LDPC Codes to Arbitrary Discrete-Memoryless Channels	2008-12-21	Paper
Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels	2008-12-21	Paper
Superposition coding for side-information channels	2008-12-21	Paper
Asymptotic Enumeration Methods for Analyzing LDPC Codes	2008-12-21	Paper
An Efficient Maximum-Likelihood Decoding of LDPC Codes Over the Binary Erasure Channel	2008-12-21	Paper
Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity	2008-12-21	Paper
Lower Bounds on the Error Rate of LDPC Code Ensembles	2008-12-21	Paper
Upper bounds on the rate of LDPC codes	2005-05-11	Paper
Expander graph arguments for message-passing algorithms	2002-08-04	Paper
Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes	2002-08-04	Paper
Bounds on the performance of belief propagation decoding	2002-08-04	Paper
Iterative decoding of LDPC codes: some bounds and properties	2002-01-06	Paper
Typical error pattern recovery of the Hopfield memory under error-tolerant conditions	1998-12-03	Paper
Nondirect convergence radius and number of iterations of the Hopfield associative memory	1995-07-12	Paper
An efficient algorithm for calculating the likelihood and likelihood gradient of ARMA models	1993-08-16	Paper
Minimum impurity partitions	1993-04-01	Paper
On the application of the Wald statistic to order estimation of ARMA models	1992-06-28	Paper
https://portal.mardi4nfdi.de/entity/Q3983185	1992-06-27	Paper
Confidence intervals for the maximum entropy spectrum	1987-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: David Burshtein