The following pages link to Henry David Pfister (Q2979137):
Displayed 28 items.
- Threshold Saturation for Spatially Coupled LDPC and LDGM Codes on BMS Channels (Q2979138) (← links)
- A Simple Proof of Maxwell Saturation for Coupled Scalar Recursions (Q2983337) (← links)
- Code-Rate Selection, Queueing Behavior, and the Correlated Erasure Channel (Q2989470) (← links)
- Verification Decoding of High-Rate LDPC Codes With Applications in Compressed Sensing (Q2989818) (← links)
- Capacity-approaching bandwidth-efficient coded modulation schemes based on low-density parity-check codes (Q3547026) (← links)
- Capacity-Achieving Ensembles for the Binary Erasure Channel With Bounded Complexity (Q3547478) (← links)
- Accumulate–Repeat–Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel With Bounded Complexity (Q3548176) (← links)
- Determining and Approaching Achievable Rates of Binary Intersymbol Interference Channels Using Multistage Decoding (Q3548205) (← links)
- Approaching Capacity at High Rates with Iterative Hard-Decision Decoding (Q4589405) (← links)
- (Q4665048) (← links)
- The serial concatenation of rate-1 codes through uniform random interleavers (Q4680106) (← links)
- An Information-Theoretic Perspective on Successive Cancellation List Decoding and Polar Code Design (Q5039978) (← links)
- Polar Codes for the Deletion Channel: Weak and Strong Polarization (Q5088382) (← links)
- Kerdock Codes Determine Unitary 2-Designs (Q5138796) (← links)
- Near-Optimal Finite-Length Scaling for Polar Codes Over Large Alphabets (Q5211395) (← links)
- The Replica-Symmetric Prediction for Random Linear Estimation With Gaussian Matrices Is Exact (Q5223930) (← links)
- Analysis of Verification-Based Decoding on the $q$-ary Symmetric Channel for Large $q$ (Q5272301) (← links)
- A Single-Letter Upper Bound on the Feedback Capacity of Unifilar Finite-State Channels (Q5280838) (← links)
- On Multiple Decoding Attempts for Reed–Solomon Codes: A Rate-Distortion Approach (Q5281069) (← links)
- Joint Physical Layer Coding and Network Coding for Bidirectional Relaying (Q5281217) (← links)
- Convergence of Weighted Min-Sum Decoding Via Dynamic Programming on Trees (Q5346104) (← links)
- First-Passage Time and Large-Deviation Analysis for Erasure Channels With Memory (Q5346371) (← links)
- Reed–Muller Codes Achieve Capacity on Erasure Channels (Q5358571) (← links)
- Density Evolution for Deterministic Generalized Product Codes on the Binary Erasure Channel at High Rates (Q5358577) (← links)
- Reed-Muller codes achieve capacity on erasure channels (Q5361869) (← links)
- The capacity of finite-state channels in the high-noise regime (Q5419717) (← links)
- Successive Cancellation Decoding of Single Parity-Check Product Codes: Analysis and Improved Decoding (Q6193561) (← links)
- On Minimal Sets to Destroy the $k$-Core in Random Networks (Q6302754) (← links)