David Burshtein

From MaRDI portal
Person:220457

Available identifiers

zbMath Open burshtein.davidMaRDI QIDQ220457

List of research outcomes

PublicationDate of PublicationType
On Polar Coding for Side Information Channels2021-02-24Paper
Performance Bounds of Concatenated Polar Coding Schemes2020-01-28Paper
On the Finite Length Scaling of <inline-formula> <tex-math notation="LaTeX">$q$ </tex-math> </inline-formula>-Ary Polar Codes2018-12-04Paper
Support Vector Machine Training for Improved Hidden Markov Modeling2018-06-27Paper
Analysis of the Power Spectral Deviation of the General Transfer Function GSC2017-09-08Paper
Iterative Approximate Linear Programming Decoding of LDPC Codes With Linear Complexity2017-08-08Paper
Upper Bound on Error Exponent of Regular LDPC Codes Transmitted Over the BEC2017-08-08Paper
Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance2017-07-12Paper
Iterative Linear Programming Decoding of Nonbinary LDPC Codes With Linear Complexity2017-06-08Paper
The Approximate Maximum-Likelihood Certificate2017-06-08Paper
Polar Write Once Memory Codes2017-06-08Paper
Improved Bounds on the Finite Length Scaling of Polar Codes2017-05-16Paper
Bounds on the Belief Propagation Threshold of Non-Binary LDPC Codes2017-04-28Paper
Error bounds for repeat-accumulate codes decoded via linear programming2012-01-25Paper
On the Error Correction of Regular LDPC Codes Using the Flipping Algorithm2009-02-24Paper
On the Fading-Paper Achievable Region of the Fading MIMO Broadcast Channel2009-02-24Paper
Bounds on Achievable Rates of LDPC Codes Used Over the Binary Erasure Channel2008-12-21Paper
On the Application of LDPC Codes to Arbitrary Discrete-Memoryless Channels2008-12-21Paper
Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels2008-12-21Paper
Superposition coding for side-information channels2008-12-21Paper
Asymptotic Enumeration Methods for Analyzing LDPC Codes2008-12-21Paper
An Efficient Maximum-Likelihood Decoding of LDPC Codes Over the Binary Erasure Channel2008-12-21Paper
Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity2008-12-21Paper
Lower Bounds on the Error Rate of LDPC Code Ensembles2008-12-21Paper
Upper bounds on the rate of LDPC codes2005-05-11Paper
Expander graph arguments for message-passing algorithms2002-08-04Paper
Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes2002-08-04Paper
Bounds on the performance of belief propagation decoding2002-08-04Paper
Iterative decoding of LDPC codes: some bounds and properties2002-01-06Paper
Typical error pattern recovery of the Hopfield memory under error-tolerant conditions1998-12-03Paper
Nondirect convergence radius and number of iterations of the Hopfield associative memory1995-07-12Paper
An efficient algorithm for calculating the likelihood and likelihood gradient of ARMA models1993-08-16Paper
Minimum impurity partitions1993-04-01Paper
On the application of the Wald statistic to order estimation of ARMA models1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39831851992-06-27Paper
Confidence intervals for the maximum entropy spectrum1987-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: David Burshtein