David Burshtein

From MaRDI portal


List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

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


Research outcomes over time


This page was built for person: David Burshtein