The following pages link to David Burshtein (Q220457):
Displaying 36 items.
- Error bounds for repeat-accumulate codes decoded via linear programming (Q660079) (← links)
- Minimum impurity partitions (Q1206733) (← links)
- Bounds on the Belief Propagation Threshold of Non-Binary LDPC Codes (Q2976850) (← links)
- Improved Bounds on the Finite Length Scaling of Polar Codes (Q2983338) (← links)
- Iterative Linear Programming Decoding of Nonbinary LDPC Codes With Linear Complexity (Q2989459) (← links)
- Bounds on Achievable Rates of LDPC Codes Used Over the Binary Erasure Channel (Q3546531) (← links)
- On the Application of LDPC Codes to Arbitrary Discrete-Memoryless Channels (Q3546558) (← links)
- Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels (Q3546559) (← links)
- Superposition coding for side-information channels (Q3546560) (← links)
- Asymptotic Enumeration Methods for Analyzing LDPC Codes (Q3546624) (← links)
- An Efficient Maximum-Likelihood Decoding of LDPC Codes Over the Binary Erasure Channel (Q3546625) (← links)
- Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity (Q3548869) (← links)
- Lower Bounds on the Error Rate of LDPC Code Ensembles (Q3548960) (← links)
- On the Error Correction of Regular LDPC Codes Using the Flipping Algorithm (Q3604509) (← links)
- On the Fading-Paper Achievable Region of the Fading MIMO Broadcast Channel (Q3604716) (← links)
- Confidence intervals for the maximum entropy spectrum (Q3780878) (← links)
- (Q3983185) (← links)
- On the application of the Wald statistic to order estimation of ARMA models (Q3987136) (← links)
- Typical error pattern recovery of the Hopfield memory under error-tolerant conditions (Q4400307) (← links)
- Expander graph arguments for message-passing algorithms (Q4544520) (← links)
- Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes (Q4544716) (← links)
- Bounds on the performance of belief propagation decoding (Q4544767) (← links)
- On the Finite Length Scaling of <inline-formula> <tex-math notation="LaTeX">$q$ </tex-math> </inline-formula>-Ary Polar Codes (Q4559589) (← links)
- Support Vector Machine Training for Improved Hidden Markov Modeling (Q4567615) (← links)
- Upper bounds on the rate of LDPC codes (Q4677565) (← links)
- Nondirect convergence radius and number of iterations of the Hopfield associative memory (Q4838637) (← links)
- On Polar Coding for Side Information Channels (Q4963920) (← links)
- Iterative Approximate Linear Programming Decoding of LDPC Codes With Linear Complexity (Q4974042) (← links)
- Upper Bound on Error Exponent of Regular LDPC Codes Transmitted Over the BEC (Q4975888) (← links)
- Performance Bounds of Concatenated Polar Coding Schemes (Q5211496) (← links)
- Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance (Q5272240) (← links)
- An efficient algorithm for calculating the likelihood and likelihood gradient of ARMA models (Q5288537) (← links)
- The Approximate Maximum-Likelihood Certificate (Q5346345) (← links)
- Polar Write Once Memory Codes (Q5346434) (← links)
- Analysis of the Power Spectral Deviation of the General Transfer Function GSC (Q5354076) (← links)
- Iterative decoding of LDPC codes: some bounds and properties (Q5951417) (← links)
