164 citations · 1.2k across the 72 of their papers we have counts for
72 papers · 1 filter
Achieving Capacity on Non-Binary Channels with Generalized Reed-Muller Codes
Galen Reeves, Henry D. Pfister
Recently, the authors showed that Reed-Muller (RM) codes achieve capacity on binary memoryless symmetric (BMS) channels with respect to bit error rate. This paper extends that work…
Belief Propagation with Quantum Messages for Symmetric Classical-Quantum Channels
S. Brandsen, Avijit Mandal, Henry D. Pfister
Belief propagation (BP) is a classical algorithm that approximates the marginal distribution associated with a factor graph by passing messages between adjacent nodes in the graph.…
Reed-Muller Codes on BMS Channels Achieve Vanishing Bit-Error Probability for All Rates Below Capacity
Galen Reeves, Henry D. Pfister
This paper considers the performance of Reed-Muller (RM) codes transmitted over binary memoryless symmetric (BMS) channels under bitwise maximum-a-posteriori (bit-MAP) decoding. It…
Trellis BMA: Coded Trace Reconstruction on IDS Channels for DNA Storage
Sundara Rajan Srinivasavaradhan, Sivakanth Gopi, Henry D. Pfister +1
Sequencing a DNA strand, as part of the read process in DNA storage, produces multiple noisy copies which can be combined to produce better estimates of the original strand; this i…
A Semiclassical Proof of Duality Between the Classical BSC and the Quantum PSC
Narayanan Rengaswamy, Henry D. Pfister
In 2018, Renes [IEEE Trans. Inf. Theory, vol. 64, no. 1, pp. 577-592 (2018)] (arXiv:1701.05583) developed a general theory of channel duality for classical-input quantum-output (CQ…
An Information-Theoretic Perspective on Successive Cancellation List Decoding and Polar Code Design
Mustafa Cemil Coşkun, Henry D. Pfister
This work identifies information-theoretic quantities that are closely related to the required list size on average for successive cancellation list (SCL) decoding to implement max…