| Publication | Date of Publication | Type |
|---|
Data-driven neural polar decoders for unknown channels with and without memory
IEEE Transactions on Information Theory | 2025-01-23 | Paper |
Attacks on perception-based control systems: modeling and fundamental limits
IEEE Transactions on Automatic Control | 2025-01-21 | Paper |
Reed-Muller codes on BMS channels achieve vanishing bit-error probability for all rates below capacity
IEEE Transactions on Information Theory | 2024-07-22 | Paper |
Successive Cancellation Decoding of Single Parity-Check Product Codes: Analysis and Improved Decoding
IEEE Transactions on Information Theory | 2024-03-18 | Paper |
An Information-Theoretic Perspective on Successive Cancellation List Decoding and Polar Code Design
IEEE Transactions on Information Theory | 2022-10-11 | Paper |
Polar Codes for the Deletion Channel: Weak and Strong Polarization
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
Kerdock Codes Determine Unitary 2-Designs
IEEE Transactions on Information Theory | 2020-12-04 | Paper |
Near-Optimal Finite-Length Scaling for Polar Codes Over Large Alphabets
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
The Replica-Symmetric Prediction for Random Linear Estimation With Gaussian Matrices Is Exact
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
| On Minimal Sets to Destroy the $k$-Core in Random Networks | 2018-06-08 | Paper |
Approaching Capacity at High Rates with Iterative Hard-Decision Decoding
IEEE Transactions on Information Theory | 2017-11-10 | Paper |
Reed-Muller codes achieve capacity on erasure channels
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Reed–Muller Codes Achieve Capacity on Erasure Channels
IEEE Transactions on Information Theory | 2017-09-21 | Paper |
Density Evolution for Deterministic Generalized Product Codes on the Binary Erasure Channel at High Rates
IEEE Transactions on Information Theory | 2017-09-21 | Paper |
Joint Physical Layer Coding and Network Coding for Bidirectional Relaying
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
A Single-Letter Upper Bound on the Feedback Capacity of Unifilar Finite-State Channels
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
On Multiple Decoding Attempts for Reed–Solomon Codes: A Rate-Distortion Approach
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Analysis of Verification-Based Decoding on the $q$-ary Symmetric Channel for Large $q$
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Verification Decoding of High-Rate LDPC Codes With Applications in Compressed Sensing
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Code-Rate Selection, Queueing Behavior, and the Correlated Erasure Channel
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Convergence of Weighted Min-Sum Decoding Via Dynamic Programming on Trees
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
First-Passage Time and Large-Deviation Analysis for Erasure Channels With Memory
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
A Simple Proof of Maxwell Saturation for Coupled Scalar Recursions
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Threshold Saturation for Spatially Coupled LDPC and LDGM Codes on BMS Channels
IEEE Transactions on Information Theory | 2017-05-02 | Paper |
The capacity of finite-state channels in the high-noise regime
Entropy of Hidden Markov Processes and Connections to Dynamical Systems | 2014-06-11 | Paper |
Capacity-approaching bandwidth-efficient coded modulation schemes based on low-density parity-check codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Accumulate–Repeat–Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel With Bounded Complexity
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Capacity-Achieving Ensembles for the Binary Erasure Channel With Bounded Complexity
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Determining and Approaching Achievable Rates of Binary Intersymbol Interference Channels Using Multistage Decoding
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
The serial concatenation of rate-1 codes through uniform random interleavers
IEEE Transactions on Information Theory | 2005-06-01 | Paper |
| scientific article; zbMATH DE number 2154519 (Why is no real title available?) | 2005-04-09 | Paper |
