Henry D. Pfister

Orcid: 0000-0001-5521-4397

Affiliations:
  • Duke University, Department of Electrical & Computer Engineering, Durham, NC, USA


According to our database1, Henry D. Pfister authored at least 148 papers between 2001 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Reed-Muller Codes on BMS Channels Achieve Vanishing Bit-Error Probability for all Rates Below Capacity.
IEEE Trans. Inf. Theory, February, 2024

Quantum State Compression with Polar Codes.
CoRR, 2024

Polar Codes for CQ Channels: Decoding via Belief-Propagation with Quantum Messages.
CoRR, 2024

2023
Successive Cancellation Decoding of Single Parity-Check Product Codes: Analysis and Improved Decoding.
IEEE Trans. Inf. Theory, February, 2023

Belief Propagation Decoding of Quantum LDPC Codes with Guided Decimation.
CoRR, 2023

Data-Driven Neural Polar Codes for Unknown Channels With and Without Memory.
CoRR, 2023

Achieving Capacity on Non-Binary Channels with Generalized Reed-Muller Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Belief-Propagation with Quantum Messages for Polar Codes on Classical-Quantum Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Data-Driven Polar Codes for Unknown Channels With and Without Memory.
Proceedings of the IEEE International Symposium on Information Theory, 2023

2022
Polar Codes for the Deletion Channel: Weak and Strong Polarization.
IEEE Trans. Inf. Theory, 2022

An Information-Theoretic Perspective on Successive Cancellation List Decoding and Polar Code Design.
IEEE Trans. Inf. Theory, 2022

Reinforcement Learning with Neural Networks for Quantum Multiple Hypothesis Testing.
Quantum, 2022

Attacks on Perception-Based Control Systems: Modeling and Fundamental Limits.
CoRR, 2022

Resiliency of Perception-Based Controllers Against Attacks.
Proceedings of the Learning for Dynamics and Control Conference, 2022

Belief Propagation with Quantum Messages for Symmetric Classical-Quantum Channels.
Proceedings of the IEEE Information Theory Workshop, 2022

2021
Physics-Based Deep Learning for Fiber-Optic Communication Systems.
IEEE J. Sel. Areas Commun., 2021

Pruning and Quantizing Neural Belief Propagation Decoders.
IEEE J. Sel. Areas Commun., 2021

Reed-Muller Codes Achieve Capacity on BMS Channels.
CoRR, 2021

Hölder Bounds for Sensitivity Analysis in Causal Reasoning.
CoRR, 2021

A Semiclassical Proof of Duality Between the Classical BSC and the Quantum PSC.
CoRR, 2021

Trellis BMA: Coded Trace Reconstruction on IDS Channels for DNA Storage.
Proceedings of the IEEE International Symposium on Information Theory, 2021

On the Duality Between the BSC and Quantum PSC.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Polar Codes for Channels with Insertions, Deletions, and Substitutions.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Learned Decimation for Neural Belief Propagation Decoders : Invited Paper.
Proceedings of the IEEE International Conference on Acoustics, 2021

2020
Kerdock Codes Determine Unitary 2-Designs.
IEEE Trans. Inf. Theory, 2020

On Optimality of CSS Codes for Transversal T.
IEEE J. Sel. Areas Inf. Theory, 2020

Learned Decimation for Neural Belief Propagation Decoders.
CoRR, 2020

Quantum-Message-Passing Receiver for Quantum-Enhanced Classical Communications.
CoRR, 2020

Bounds on the List Size of Successive Cancellation List Decoding.
Proceedings of the International Conference on Signal Processing and Communications, 2020

Model-Based Machine Learning for Joint Digital Backpropagation and PMD Compensation.
Proceedings of the Optical Fiber Communications Conference and Exhibition, 2020

Efficient Maximum-Likelihood Decoding of Reed-Muller RM(m-3, m) Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Quantum Advantage via Qubit Belief Propagation.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Classical Coding Problem from Transversal T Gates.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Decoding Reed-Muller Codes Using Redundant Code Constraints.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Successive Cancellation Inactivation Decoding for Modified Reed-Muller and eBCH Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Pruning Neural Belief Propagation Decoders.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Adaptive Procedures for Discriminating Between Arbitrary Tensor-Product Quantum States.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
The Replica-Symmetric Prediction for Random Linear Estimation With Gaussian Matrices Is Exact.
IEEE Trans. Inf. Theory, 2019

Near-Optimal Finite-Length Scaling for Polar Codes Over Large Alphabets.
IEEE Trans. Inf. Theory, 2019

Enhancing Capacity of Spatial Multiplexing Systems Using Reconfigurable Cavity-Backed Metasurface Antennas in Clustered MIMO Channels.
IEEE Trans. Commun., 2019

Understanding Phase Transitions via Mutual Information and MMSE.
CoRR, 2019

Logical Clifford Synthesis for Stabilizer Codes.
CoRR, 2019

Revisiting Multi-Step Nonlinearity Compensation with Machine Learning.
CoRR, 2019

Learned Belief-Propagation Decoding with Simple Scaling and SNR Adaptation.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Reinforcement Learning for Channel Coding: Learned Bit-Flipping Decoding.
Proceedings of the 57th Annual Allerton Conference on Communication, 2019

2018
Approaching Miscorrection-Free Performance of Product Codes With Anchor Decoding.
IEEE Trans. Commun., 2018

Adversarial Defense of Image Classification Using a Variational Auto-Encoder.
CoRR, 2018

On Minimal Sets to Destroy the k-Core in Random Networks.
CoRR, 2018

Nonlinear Interference Mitigation via Deep Neural Networks.
Proceedings of the Optical Fiber Communications Conference and Exposition, 2018

What Can Machine Learning Teach Us about Communications?
Proceedings of the IEEE Information Theory Workshop, 2018

On Low-Complexity Decoding of Product Codes for High-Throughput Fiber-Optic Systems.
Proceedings of the 10th IEEE International Symposium on Turbo Codes & Iterative Information Processing, 2018

Decoding Reed-Muller Codes Using Minimum- Weight Parity Checks.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Synthesis of Logical Clifford Operators via Symplectic Geometry.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Mutual Information as a Function of Matrix SNR for Linear Gaussian Channels.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Deep Learning of the Nonlinear Schrödinger Equation in Fiber-Optic Communications.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Wideband Time-Domain Digital Backpropagation via Subband Processing and Deep Learning.
Proceedings of the European Conference on Optical Communication, 2018

ASIC Implementation of Time-Domain Digital Backpropagation with Deep-Learned Chromatic Dispersion Filters.
Proceedings of the European Conference on Optical Communication, 2018

2017
A Single-Letter Upper Bound on the Feedback Capacity of Unifilar Finite-State Channels.
IEEE Trans. Inf. Theory, 2017

Reed-Muller Codes Achieve Capacity on Erasure Channels.
IEEE Trans. Inf. Theory, 2017

Approaching Capacity at High Rates With Iterative Hard-Decision Decoding.
IEEE Trans. Inf. Theory, 2017

Density Evolution for Deterministic Generalized Product Codes on the Binary Erasure Channel at High Rates.
IEEE Trans. Inf. Theory, 2017

Approaching Miscorrection-free Performance of Product and Generalized Product Codes.
CoRR, 2017

Miscorrection-free Decoding of Staircase Codes.
Proceedings of the European Conference on Optical Communication, 2017

2016
Density evolution and error floor analysis for staircase and braided codes.
Proceedings of the Optical Fiber Communications Conference and Exhibition, 2016

Beyond double transitivity: Capacity-achieving cyclic codes on erasure channels.
Proceedings of the 2016 IEEE Information Theory Workshop, 2016

Increasing the rate of spatially-coupled codes via optimized irregular termination.
Proceedings of the 9th International Symposium on Turbo Codes and Iterative Information Processing, 2016

Density evolution for deterministic generalized product codes with higher-order modulation.
Proceedings of the 9th International Symposium on Turbo Codes and Iterative Information Processing, 2016

The replica-symmetric prediction for compressed sensing with Gaussian matrices is exact.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Reed-Muller codes achieve capacity on the quantum erasure channel.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Comparing the bit-MAP and block-MAP decoding thresholds of reed-muller codes on BMS channels.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Deterministic and ensemble-based spatially-coupled product codes.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Delay-Sensitive Communication Over Fading Channels: Queueing Behavior and Code Parameter Selection.
IEEE Trans. Veh. Technol., 2015

On the Performance of Block Codes Over Finite-State Channels in the Rare-Transition Regime.
IEEE Trans. Commun., 2015

Reed-Muller Codes Achieve Capacity on Erasure Channels.
CoRR, 2015

Density Evolution for Deterministic Generalized Product Codes on the Binary Erasure Channel.
CoRR, 2015

On parameter optimization for staircase codes.
Proceedings of the Optical Fiber Communications Conference and Exhibition, 2015

Symmetric product codes.
Proceedings of the 2015 Information Theory and Applications Workshop, 2015

Cyclic polar codes.
Proceedings of the IEEE International Symposium on Information Theory, 2015

On the limits of treating interference as noise for two-user symmetric Gaussian interference channels.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Belief-propagation reconstruction for compressed sensing: Quantization vs. Gaussian approximation.
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

Spatially-coupled codes for write-once memories.
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014
A Simple Proof of Maxwell Saturation for Coupled Scalar Recursions.
IEEE Trans. Inf. Theory, 2014

Threshold Saturation for Spatially Coupled LDPC and LDGM Codes on BMS Channels.
IEEE Trans. Inf. Theory, 2014

Convergence of Weighted Min-Sum Decoding Via Dynamic Programming on Trees.
IEEE Trans. Inf. Theory, 2014

On the Performance of Short Block Codes over Finite-State Channels in the Rare-Transition Regime.
CoRR, 2014

Multilevel lattices based on spatially-coupled LDPC codes with applications.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Spatially-coupled codes for side-information problems.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Code-Rate Selection, Queueing Behavior, and the Correlated Erasure Channel.
IEEE Trans. Inf. Theory, 2013

First-Passage Time and Large-Deviation Analysis for Erasure Channels With Memory.
IEEE Trans. Inf. Theory, 2013

Code Design for the Noisy Slepian-Wolf Problem.
IEEE Trans. Commun., 2013

Delay-Sensitive Communication over Fading Channel: Queueing Behavior and Code Parameter Selection.
CoRR, 2013

Spatially-coupled low density lattices based on construction a with applications to compute-and-forward.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

On the relevance of graph covers and zeta functions for the analysis of SPA decoding of cycle codes.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Spatially-coupled multi-edge type LDPC codes with bounded degrees that achieve capacity on the BEC under BP decoding.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Iterative hard-decision decoding of braided BCH codes for high-speed optical communication.
Proceedings of the 2013 IEEE Global Communications Conference, 2013

2012
Verification Decoding of High-Rate LDPC Codes With Applications in Compressed Sensing.
IEEE Trans. Inf. Theory, 2012

A simple proof of threshold saturation for coupled vector recursions.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

A simple proof of threshold saturation for coupled scalar recursions.
Proceedings of the 7th International Symposium on Turbo Codes and Iterative Information Processing, 2012

Iterative collision resolution for slotted ALOHA: An optimal uncoordinated transmission policy.
Proceedings of the 7th International Symposium on Turbo Codes and Iterative Information Processing, 2012

On the maximum a posteriori decoding thresholds of multiuser systems with erasures.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Threshold saturation of spatially-coupled codes on intersymbol-interference channels.
Proceedings of IEEE International Conference on Communications, 2012

On the queueing behavior of Gilbert-Elliott channels in the rare-transition regime.
Proceedings of the 46th Annual Conference on Information Sciences and Systems, 2012

A proof of threshold saturation for spatially-coupled LDPC codes on BMS channels.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

On the performance of random block codes over finite-state fading channels.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011
Analysis of Verification-Based Decoding on the q -ary Symmetric Channel for Large q.
IEEE Trans. Inf. Theory, 2011

On Multiple Decoding Attempts for Reed-Solomon Codes: A Rate-Distortion Approach.
IEEE Trans. Inf. Theory, 2011

Joint Decoding of LDPC Codes and Finite-State Channels Via Linear-Programming.
IEEE J. Sel. Top. Signal Process., 2011

Spatially-Coupled Codes and Threshold Saturation on Intersymbol-Interference Channels
CoRR, 2011

Universality for the noisy Slepian-Wolf problem via spatial coupling.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Queueing behavior of the Gilbert-Elliott channel: BCH codes and Poisson arrivals.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

An Iterative Joint Linear-Programming Decoding of LDPC Codes and Finite-State Channels.
Proceedings of IEEE International Conference on Communications, 2011

Universal codes for the Gaussian MAC via spatial coupling.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

Large deviations on empirical service for erasure channels with memory.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010
Joint Physical Layer Coding and Network Coding for Bidirectional Relaying.
IEEE Trans. Inf. Theory, 2010

LDPC Code Design for Transmission of Correlated Sources Across Noisy Channels Without CSIT
CoRR, 2010

IMP: A Message-Passing Algorithmfor Matrix Completion
CoRR, 2010

On Multiple Decoding Attempts for Reed-Solomon Codes
CoRR, 2010

Message-Passing Inference on a Factor Graph for Collaborative Filtering
CoRR, 2010

The Capacity of Finite-State Channels in the High-Noise Regime
CoRR, 2010

LDPC codes for rank modulation in flash memories.
Proceedings of the IEEE International Symposium on Information Theory, 2010

On the queueing behavior of random codes over a gilbert-elliot erasure channel.
Proceedings of the IEEE International Symposium on Information Theory, 2010

A rate-distortion exponent approach to multiple decoding attempts for Reed-Solomon codes.
Proceedings of the IEEE International Symposium on Information Theory, 2010

The effect of spatial coupling on compressive sensing.
Proceedings of the 48th Annual Allerton Conference on Communication, 2010

First-passage time analysis for digital communication over erasure channels with delay-sensitive traffic.
Proceedings of the 48th Annual Allerton Conference on Communication, 2010

2009
On the Iterative Decoding of High-Rate LDPC Codes With Applications in Compressed Sensing
CoRR, 2009

Modulation codes for flash memory based on load-balancing theory.
Proceedings of the 47th Annual Allerton Conference on Communication, 2009

Can iterative decoding for erasure correlated sources be universal?
Proceedings of the 47th Annual Allerton Conference on Communication, 2009

A rate-distortion perspective on multiple decoding attempts for Reed-Solomon codes.
Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2008
Girth-10 LDPC Codes Based on 3-D Cyclic Lattices.
IEEE Trans. Veh. Technol., 2008

Joint iterative decoding of LDPC codes for channels with memory and erasure noise.
IEEE J. Sel. Areas Commun., 2008

Joint Physical Layer Coding and Network Coding for Bi-Directional Relaying
CoRR, 2008

2007
Determining and Approaching Achievable Rates of Binary Intersymbol Interference Channels Using Multistage Decoding.
IEEE Trans. Inf. Theory, 2007

Accumulate-Repeat-Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes for the Erasure Channel With Bounded Complexity.
IEEE Trans. Inf. Theory, 2007

Capacity Upper Bounds for the Deletion Channel.
Proceedings of the IEEE International Symposium on Information Theory, 2007

List-Message Passing Achieves Capacity on the q-ary Symmetric Channel for Large q.
Proceedings of the Global Communications Conference, 2007

2006
Implementing interference cancellation to increase the EV-DO Rev A reverse link capacity.
IEEE Commun. Mag., 2006

Link-Level Modeling and Performance of CDMA Interference Cancellation.
Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

2005
Capacity-achieving ensembles for the binary erasure channel with bounded complexity.
IEEE Trans. Inf. Theory, 2005

Capacity-Achieving Ensembles of Accumulate-Repeat-Accumulate Codes for the Erasure Channel with Bounded Complexity
CoRR, 2005

Accumulate-Repeat-Accumulate Codes: Systematic Codes Achieving the Binary Erasure Channel Capacity with Bounded Complexity
CoRR, 2005

Finite-length analysis of a capacity-achieving ensemble for the binary erasure channel.
Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, 2005

2004
Bounds on the decoding complexity of punctured codes on graphs
CoRR, 2004

2003
The serial concatenation of rate-1 codes through uniform random interleavers.
IEEE Trans. Inf. Theory, 2003

Capacity-approaching bandwidth-efficient coded modulation schemes based on low-density parity-check codes.
IEEE Trans. Inf. Theory, 2003

On the low-rate Shannon limit for binary intersymbol interference channels.
IEEE Trans. Commun., 2003

2001
Design of low-density parity-check codes for bandwidth efficient modulation.
Proceedings of the 2001 IEEE Information Theory Workshop, 2001

On the achievable information rates of finite state ISI channels.
Proceedings of the Global Telecommunications Conference, 2001

Multilevel coding with low-density parity-check component codes.
Proceedings of the Global Telecommunications Conference, 2001


  Loading...