Henry Pfister | Scholars@Duke

Henry Pfister
Professor in the Department of Electrical and Computer Engineering

Henry D. Pfister received his Ph.D. in electrical engineering in 2003 from the University of California, San Diego and is currently a professor in the Electrical and Computer Engineering Department of Duke University with a secondary appointment in Mathematics. Prior to that, he was a professor at Texas A&M University (2006-2014), a post-doctoral fellow at the École Polytechnique Fédérale de Lausanne (2005-2006), and a senior engineer at Qualcomm Corporate R&D in San Diego (2003-2004).

He received the NSF Career Award in 2008 and a Texas A&M ECE Department Outstanding Professor Award in 2010. He is a coauthor of the 2007 IEEE COMSOC best paper in Signal Processing and Coding for Data Storage and a coauthor of a 2016 Symposium on the Theory of Computing (STOC) best paper. He served as an Associate Editor for the IEEE Transactions on Information Theory (2013-2016) and a Distinguished Lecturer of the IEEE Information Theory Society (2015-2016).

His current research interests include information theory, communications, probabilistic graphical models, machine learning, and deep neural networks.

Current Research Interests

Information theory, communications, probabilistic graphical models, machine learning, and deep neural networks

Current Appointments & Affiliations

Professor in the Department of Electrical and Computer Engineering, Electrical and Computer Engineering, Pratt School of Engineering 2019
Associate Professor of Mathematics, Mathematics, Trinity College of Arts & Sciences 2016

Contact Information

140 Science Dr., 305 Gross Hall, Durham, NC 27708
90984, 315 Gross Hall, Durham, NC 27708
henry.pfister@duke.edu (919) 660-5288

Background
Education, Training, & Certifications
- Ph.D., University of California at San Diego 2003
Duke Appointment History
- Associate Professor in the Department of Electrical and Computer Engineering, Electrical and Computer Engineering, Pratt School of Engineering 2015 - 2019
- Associate Professor in the Department of Electrical and Computer Engineering, Electrical and Computer Engineering, Pratt School of Engineering 2014 - 2015
Recognition
In the News
- SEP 17, 2014
  
  Pratt's Henry Pfister: Inferring Answers through Graphical Models
Awards & Honors
Expertise
Subject Headings
Research
Selected Grants
- CIF: Small: Improving Quantum Computing and Classical Communication using Discrete Sets of Unitary Matrices awarded by National Science Foundation 2019 - 2022
- FET: Small: Efficient Inference Tools for Quantum Systems: Algorithms, Applications, and Analysis awarded by National Science Foundation 2019 - 2022
- FET: Small: Efficient Inference Tools for Quantum Systems: Algorithms, Applications, and Analysis awarded by National Science Foundation 2019 - 2022
- HDR TRIPODS: Innovations in Data Science: Integrating Stochastic Modeling, Data Representation, and Algorithms awarded by National Science Foundation 2019 - 2022
- CIF: Small: Capacity via Symmetry awarded by National Science Foundation 2017 - 2020
- Collaborative Research: Advanced Coding Techniques for Next-Generation Optical Communications awarded by National Science Foundation 2016 - 2019
- CIF:Small: Design and Analysis of Spatially-Coupled Coding Systems awarded by Texas A&M University 2015 - 2017
- CIF: Small: Collaborative Research: Design and Analysis of Novel Compressed Sensing Algorithms via Connections with Coding Theory awarded by National Science Foundation 2014 - 2016
- Request for Support for U.S. Participants of the 2015 Workshop on Sensing and Analysis of High-Demensional Data awarded by National Science Foundation 2015 - 2016
Industry Relationships
- Geometric Data Analysis
- Microsoft Corporation
Publications & Artistic Works
Selected Publications
- Academic Articles
  - Carpi, Fabrizio, Christian Hager, Marco Martalo, Riccardo Raheli, and Henry D. Pfister. “Reinforcement Learning for Channel Coding: Learned Bit-Flipping Decoding.” 2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton), September 2019. https://doi.org/10.1109/allerton.2019.8919799.
    Full Text
  - Pfister, Henry D., and Rudiger L. Urbanke. “Near-Optimal Finite-Length Scaling for Polar Codes Over Large Alphabets.” Ieee Transactions on Information Theory 65, no. 9 (September 2019): 5643–55. https://doi.org/10.1109/tit.2019.2915595.
    Full Text
  - Rengaswamy, N., R. Calderbank, and H. D. Pfister. “Unifying the Clifford hierarchy via symmetric matrices over rings.” Physical Review A 100, no. 2 (August 7, 2019). https://doi.org/10.1103/PhysRevA.100.022304.
    Full Text
  - Can, T., N. Rengaswamy, R. Calderbank, and H. D. Pfister. “Kerdock Codes Determine Unitary 2-Designs.” Ieee International Symposium on Information Theory Proceedings 2019-July (July 1, 2019): 2908–12. https://doi.org/10.1109/ISIT.2019.8849504.
    Full Text
  - Lian, M., F. Carpi, C. Hager, and H. D. Pfister. “Learned Belief-Propagation Decoding with Simple Scaling and SNR Adaptation.” Ieee International Symposium on Information Theory Proceedings 2019-July (July 1, 2019): 161–65. https://doi.org/10.1109/ISIT.2019.8849419.
    Full Text
  - Tal, I., H. D. Pfister, A. Fazeli, and A. Vardy. “Polar Codes for the Deletion Channel: Weak and Strong Polarization.” Ieee International Symposium on Information Theory Proceedings 2019-July (July 1, 2019): 1362–66. https://doi.org/10.1109/ISIT.2019.8849705.
    Full Text
  - Reeves, G., and H. D. Pfister. “The Replica-Symmetric Prediction for Random Linear Estimation With Gaussian Matrices Is Exact.” Ieee Transactions on Information Theory 65, no. 4 (April 1, 2019): 2252–83. https://doi.org/10.1109/TIT.2019.2891664.
    Full Text
  - Schmidt, Christian, Henry D. Pfister, and Lenka Zdeborová. “Minimal sets to destroy the k-core in random networks..” Physical Review. E 99, no. 2–1 (February 2019). https://doi.org/10.1103/physreve.99.022310.
    Full Text
  - Yoo, I., M. F. Imani, T. Sleasman, H. D. Pfister, and D. R. Smith. “Enhancing Capacity of Spatial Multiplexing Systems Using Reconfigurable Cavity-Backed Metasurface Antennas in Clustered MIMO Channels.” Ieee Transactions on Communications 67, no. 2 (February 1, 2019): 1070–84. https://doi.org/10.1109/TCOMM.2018.2876899.
    Full Text
  - Sheikh, A., A. GraellAmat, G. Liva, C. Häger, and H. D. Pfister. “On Low-Complexity Decoding of Product Codes for High-Throughput Fiber-Optic Systems.” International Symposium on Turbo Codes and Iterative Information Processing, Istc 2018-December (January 23, 2019). https://doi.org/10.1109/ISTC.2018.8625279.
    Full Text
  - Lian, M., C. Häger, and H. D. Pfister. “What can machine learning teach us about communications?.” 2018 Ieee Information Theory Workshop, Itw 2018, January 15, 2019. https://doi.org/10.1109/ITW.2018.8613331.
    Full Text
  - Fougstedt, C., C. Häger, L. Svensson, H. D. Pfister, and P. Larsson-Edefors. “ASIC Implementation of Time-Domain Digital Backpropagation with Deep-Learned Chromatic Dispersion Filters.” European Conference on Optical Communication, Ecoc 2018-September (November 14, 2018). https://doi.org/10.1109/ECOC.2018.8535430.
    Full Text
  - Häger, C., and H. D. Pfister. “Wideband Time-Domain Digital Backpropagation via Subband Processing and Deep Learning.” European Conference on Optical Communication, Ecoc 2018-September (November 14, 2018). https://doi.org/10.1109/ECOC.2018.8535251.
    Full Text
  - Hager, C., and H. D. Pfister. “Deep Learning of the Nonlinear Schrödinger Equation in Fiber-Optic Communications.” Ieee International Symposium on Information Theory Proceedings 2018-June (August 15, 2018): 1590–94. https://doi.org/10.1109/ISIT.2018.8437734.
    Full Text
  - Santi, E., C. Hager, and H. D. Pfister. “Decoding Reed-Muller Codes Using Minimum- Weight Parity Checks.” Ieee International Symposium on Information Theory Proceedings 2018-June (August 15, 2018): 1296–1300. https://doi.org/10.1109/ISIT.2018.8437637.
    Full Text
  - Rengaswamy, N, Calderbank, R, Pfister, HD, and Kadhe, S. "Synthesis of Logical Clifford Operators via Symplectic Geometry." Ieee International Symposium on Information Theory Proceedings 2018-June (August 15, 2018): 791-795. Full Text
  - Hager, C., and H. D. Pfister. “Approaching Miscorrection-Free Performance of Product Codes with Anchor Decoding.” Ieee Transactions on Communications 66, no. 7 (July 1, 2018): 2797–2808. https://doi.org/10.1109/TCOMM.2018.2816073.
    Full Text
  - Häger, C., and H. D. Pfister. “Nonlinear interference mitigation via deep neural networks.” Optics Infobase Conference Papers Part F84-OFC 2018 (January 1, 2018). https://doi.org/10.1364/OFC.2018.W3A.4.
    Full Text
  - Häger, C., and H. D. Pfister. “Miscorrection-free Decoding of Staircase Codes.” European Conference on Optical Communication, Ecoc 2017-September (September 21, 2017): 1–3. https://doi.org/10.1109/ECOC.2017.8345919.
    Full Text
  - Charbonneau, Patrick, Yue Cathy Li, Henry D. Pfister, and Sho Yaida. “Cycle-expansion method for the Lyapunov exponent, susceptibility, and higher moments..” Physical Review. E 96, no. 3–1 (September 18, 2017). https://doi.org/10.1103/physreve.96.032129.
    Full Text Open Access Copy
  - Jian, Y. Y., H. D. Pfister, and K. R. Narayanan. “Approaching Capacity at High Rates with Iterative Hard-Decision Decoding.” Ieee Transactions on Information Theory 63, no. 9 (September 1, 2017): 5752–73. https://doi.org/10.1109/TIT.2017.2717838.
    Full Text
  - Kudekar, S., S. Kumar, M. Mondelli, H. D. Pfister, E. Sasoǧlu, and R. L. Urbanke. “Reed-muller codes achieve capacity on erasure channels.” Ieee Transactions on Information Theory 63, no. 7 (July 1, 2017): 4298–4316. https://doi.org/10.1109/TIT.2017.2673829.
    Full Text
  - Häger, Christian, and Henry D. Pfister. “Approaching Miscorrection-free Performance of Product and Generalized Product Codes..” Corr abs/1711.07805 (2017).
  - Hamidi-Sepehr, F., J. F. Chamberland, and H. D. Pfister. “On the Performance of Block Codes over Finite-State Channels in the Rare-Transition Regime.” Ieee Transactions on Communications 63, no. 11 (November 1, 2015): 3974–90. https://doi.org/10.1109/TCOMM.2015.2478794.
    Full Text
  - Hamidi-Sepehr, F., H. D. Pfister, and J. F. Chamberland. “Delay-Sensitive Communication over Fading Channels: Queueing Behavior and Code Parameter Selection.” Ieee Transactions on Vehicular Technology 64, no. 9 (September 1, 2015): 3957–70. https://doi.org/10.1109/TVT.2014.2365181.
    Full Text
  - Kumar, S., A. J. Young, N. Macris, and H. D. Pfister. “Threshold saturation for spatially coupled LDPC and LDGM codes on BMS channels.” Ieee Transactions on Information Theory 60, no. 12 (December 1, 2014): 7389–7415. https://doi.org/10.1109/TIT.2014.2360692.
    Full Text
  - Jian, Y. Y., and H. D. Pfister. “Convergence of weighted min-sum decoding via dynamic programming on trees.” Ieee Transactions on Information Theory 60, no. 2 (January 1, 2014): 943–63. https://doi.org/10.1109/TIT.2013.2290303.
    Full Text
  - Yedla, A., Y. Y. Jian, P. S. Nguyen, and H. D. Pfister. “A simple proof of maxwell saturation for coupled scalar recursions.” Ieee Transactions on Information Theory 60, no. 11 (January 1, 2014): 6943–65. https://doi.org/10.1109/TIT.2014.2352296.
    Full Text
  - Kumar, S., J. F. Chamberland, and H. D. Pfister. “First-passage time and large-deviation analysis for erasure channels with memory.” Ieee Transactions on Information Theory 59, no. 9 (August 28, 2013): 5547–65. https://doi.org/10.1109/TIT.2013.2260593.
    Full Text
  - Yedla, A., H. D. Pfister, and K. R. Narayanan. “Code design for the noisy Slepian-Wolf problem.” Ieee Transactions on Communications 61, no. 6 (June 1, 2013): 2535–45. https://doi.org/10.1109/TCOMM.2013.032713.120002A.
    Full Text
  - Parag, P., J. F. Chamberland, H. D. Pfister, and K. Narayanan. “Code-rate selection, queueing behavior, and the correlated erasure channel.” Ieee Transactions on Information Theory 59, no. 1 (January 7, 2013): 397–407. https://doi.org/10.1109/TIT.2012.2216501.
    Full Text
  - Yedla, Arvind, Henry D. Pfister, and Krishna R. Narayanan. “Code Design for the Noisy Slepian-Wolf Problem..” Ieee Trans. Communications 61 (2013): 2535–45.
  - Zhang, F., and H. D. Pfister. “Verification decoding of high-rate ldpc codes with applications in compressed sensing.” Ieee Transactions on Information Theory 58, no. 8 (July 23, 2012): 5042–58. https://doi.org/10.1109/TIT.2012.2201344.
    Full Text
  - Kim, B. H., and H. D. Pfister. “Joint decoding of LDPC codes and finite-state channels via linear-programming.” Ieee Journal on Selected Topics in Signal Processing 5, no. 8 (December 1, 2011): 1563–76. https://doi.org/10.1109/JSTSP.2011.2165525.
    Full Text
  - Zhang, F., and H. D. Pfister. “Analysis of verification-based decoding on the q-ary symmetric channel for large q.” Ieee Transactions on Information Theory 57, no. 10 (October 1, 2011): 6754–70. https://doi.org/10.1109/TIT.2011.2165813.
    Full Text
  - Nguyen, P. S., H. D. Pfister, and K. R. Narayanan. “On multiple decoding attempts for Reed - Solomon codes: A rate-distortion approach.” Ieee Transactions on Information Theory 57, no. 2 (February 1, 2011): 668–91. https://doi.org/10.1109/TIT.2010.2095202.
    Full Text
  - Wilson, M. P., K. Narayanan, H. D. Pfister, and A. Sprintson. “Joint physical layer coding and network coding for bidirectional relaying.” Ieee Transactions on Information Theory 56, no. 11 (November 1, 2010): 5641–54. https://doi.org/10.1109/TIT.2010.2068750.
    Full Text
  - Zhang, F., X. Mao, W. Zhou, and H. D. Pfister. “Girth-10 LDPC codes based on 3-D cyclic lattices.” Ieee Transactions on Vehicular Technology 57, no. 2 (March 1, 2008): 1049–60. https://doi.org/10.1109/TVT.2007.905622.
    Full Text
  - Pfister, H. D., and I. Sason. “Accumulate-repeat-accumulate codes: Capacity-achieving ensembles of systematic codes for the erasure channel with bounded complexity.” Ieee Transactions on Information Theory 53, no. 6 (June 1, 2007): 2088–2115. https://doi.org/10.1109/TIT.2007.896873.
    Full Text
  - Hou, J., J. E. Smee, H. D. Pfister, and S. Tomasin. “Implementing interference cancellation to increase the EV-DO Rev A reverse link capacity.” Ieee Communications Magazine 44, no. 2 (February 1, 2006): 96–102. https://doi.org/10.1109/MCOM.2006.1593551.
    Full Text
  - Pfister, Henry D., Igal Sason, and Rüdiger L. Urbanke. “Capacity-achieving ensembles for the binary erasure channel with bounded complexity..” Ieee Trans. Information Theory 51 (2005): 2352–79.
  - Soriaga, Joseph B., Henry D. Pfister, and Paul H. Siegel. “On the low-rate Shannon limit for binary intersymbol interference channels..” Ieee Trans. Communications 51 (2003): 1962–64.
  - Häger, Christian, Henry D. Pfister, Rick M. Bütler, Gabriele Liga, and Alex Alvarado. “Revisiting Multi-Step Nonlinearity Compensation with Machine Learning,” n.d.
    Link to Item
  - Luo, Yi, and Henry Pfister. “Adversarial Defense of Image Classification Using a Variational Auto-Encoder,” n.d.
    Link to Item
- Digital Publications
  - Häger, C., H. D. Pfister, A. GraellAmat, and F. Brännström. “Density evolution for deterministic generalized product codes on the binary erasure channel at high rates,” July 1, 2017. https://doi.org/10.1109/TIT.2017.2689783.
    Full Text
  - Kumar, Santhosh, Andrew J. Young, Nicolas Macris, and Henry D. Pfister. “A Proof of Threshold Saturation for Spatially-Coupled LDPC Codes on BMS Channels,” 2013.
  - Nguyen, Phong S., Arvind Yedla, Henry D. Pfister, and Krishna R. Narayanan. “Spatially-Coupled Codes and Threshold Saturation on Intersymbol-Interference Channels,” 2011.
  - Kim, Byung-Hak, Arvind Yedla, and Henry D. Pfister. “Message-Passing Inference on a Factor Graph for Collaborative Filtering,” 2010.
  - Kim, Byung-Hak, and Henry D. Pfister. “An Iterative Joint Linear-Programming Decoding of LDPC Codes and Finite-State Channels,” 2010.
  - Nguyen, Phong S., Henry D. Pfister, and Krishna R. Narayanan. “On Multiple Decoding Attempts for Reed-Solomon Codes,” 2010.
  - Pfister, Henry D. “The Capacity of Finite-State Channels in the High-Noise Regime,” 2010.
  - Zhang, Fan, and Henry D. Pfister. “On the Iterative Decoding of High-Rate LDPC Codes With Applications in Compressed Sensing,” 2009.
  - Pfister, Henry D., and Igal Sason. “Capacity-Achieving Ensembles of Accumulate-Repeat-Accumulate Codes for the Erasure Channel with Bounded Complexity,” 2005.
  - Pfister, Henry D., Igal Sason, and Rüdiger L. Urbanke. “Bounds on the decoding complexity of punctured codes on graphs,” 2004.
- Conference Papers
  - Reeves, G., H. D. Pfister, and A. Dytso. “Mutual Information as a Function of Matrix SNR for Linear Gaussian Channels.” In Ieee International Symposium on Information Theory Proceedings, 2018-June:1754–58, 2018. https://doi.org/10.1109/ISIT.2018.8437326.
    Full Text
  - Hager, C., and H. D. Pfister. “Nonlinear interference mitigation via deep neural networks.” In 2018 Optical Fiber Communications Conference and Exposition, Ofc 2018 Proceedings, 1–3, 2018.
  - Sabag, O., H. H. Permuter, and H. D. Pfister. “A single-letter upper bound on the feedback capacity of unifilar finite-state channels.” In Ieee Transactions on Information Theory, 63:1392–1409, 2017. https://doi.org/10.1109/TIT.2016.2636851.
    Full Text
  - Sabag, O., H. H. Permuter, and H. D. Pfister. “Single-letter bounds on the feedback capacity of unifilar finite-state channels.” In 2016 Ieee International Conference on the Science of Electrical Engineering, Icsee 2016, 2017. https://doi.org/10.1109/ICSEE.2016.7806200.
    Full Text
  - Kumar, S., R. Calderbank, and H. D. Pfister. “Beyond double transitivity: Capacity-achieving cyclic codes on erasure channels.” In 2016 Ieee Information Theory Workshop, Itw 2016, 241–45, 2016. https://doi.org/10.1109/ITW.2016.7606832.
    Full Text
  - Hager, C., A. G. I. Amat, H. D. Pfister, and F. Brannstrom. “Density evolution for deterministic generalized product codes with higher-order modulation.” In International Symposium on Turbo Codes and Iterative Information Processing, Istc, 2016-October:236–40, 2016. https://doi.org/10.1109/ISTC.2016.7593112.
    Full Text
  - Sanatkar, M. R., and H. D. Pfister. “Increasing the rate of spatially-coupled codes via optimized irregular termination.” In International Symposium on Turbo Codes and Iterative Information Processing, Istc, 2016-October:31–35, 2016. https://doi.org/10.1109/ISTC.2016.7593071.
    Full Text
  - Hager, C., H. D. Pfister, A. Graell I Amat, and F. Brannstrom. “Deterministic and ensemble-based spatially-coupled product codes.” In Ieee International Symposium on Information Theory Proceedings, 2016-August:2114–18, 2016. https://doi.org/10.1109/ISIT.2016.7541672.
    Full Text
  - Kudekar, S., S. Kumar, M. Mondelli, H. D. Pfister, and R. Urbankez. “Comparing the bit-MAP and block-MAP decoding thresholds of reed-muller codes on BMS channels.” In Ieee International Symposium on Information Theory Proceedings, 2016-August:1755–59, 2016. https://doi.org/10.1109/ISIT.2016.7541600.
    Full Text
  - Kumar, S., R. Calderbank, and H. D. Pfister. “Reed-muller codes achieve capacity on the quantum erasure channel.” In Ieee International Symposium on Information Theory Proceedings, 2016-August:1750–54, 2016. https://doi.org/10.1109/ISIT.2016.7541599.
    Full Text
  - Pfister, H. D., and R. Urbanke. “Near-optimal finite-length scaling for polar codes over large alphabets.” In Ieee International Symposium on Information Theory Proceedings, 2016-August:215–19, 2016. https://doi.org/10.1109/ISIT.2016.7541292.
    Full Text
  - Reeves, G., and H. D. Pfister. “The replica-symmetric prediction for compressed sensing with Gaussian matrices is exact.” In Ieee International Symposium on Information Theory Proceedings, 2016-August:665–69, 2016. https://doi.org/10.1109/ISIT.2016.7541382.
    Full Text
  - Sabag, O., H. H. Permuter, and H. D. Pfister. “A single-letter upper bound on the feedback capacity of unifilar finite-state channels.” In Ieee International Symposium on Information Theory Proceedings, 2016-August:310–14, 2016. https://doi.org/10.1109/ISIT.2016.7541311.
    Full Text
  - Hager, C., H. D. Pfister, A. G. Amat, and F. Brannstrom. “Density evolution and error floor analysis for staircase and braided codes.” In 2016 Optical Fiber Communications Conference and Exhibition, Ofc 2016, 2016.
  - Kudekar, S., H. D. Pfister, S. Kumar, E. Şaşoǧlu, M. Mondelli, and R. Urbanke. “Reed-Muller codes achieve capacity on erasure channels.” In Proceedings of the Annual Acm Symposium on Theory of Computing, 19-21-June-2016:658–69, 2016. https://doi.org/10.1145/2897518.2897584.
    Full Text
  - Kumar, S., A. Vem, K. Narayanan, and H. D. Pfister. “Spatially-coupled codes for write-once memories.” In 2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015, 125–31, 2016. https://doi.org/10.1109/ALLERTON.2015.7446994.
    Full Text
  - Lian, M., and H. D. Pfister. “Belief-propagation reconstruction for compressed sensing: Quantization vs. Gaussian approximation.” In 2015 53rd Annual Allerton Conference on Communication, Control, and Computing, Allerton 2015, 1106–13, 2016. https://doi.org/10.1109/ALLERTON.2015.7447132.
    Full Text
  - Kudekar, Shrinivas, Santhosh Kumar, Marco Mondelli, Henry D. Pfister, Eren Sasoglu, and Rüdiger L. Urbanke. “Reed-Muller codes achieve capacity on erasure channels..” In Stoc, edited by Daniel Wichs and Yishay Mansour, 658–69. ACM, 2016.
  - Pfister, H. D., S. K. Emmadi, and K. Narayanan. “Symmetric product codes.” In 2015 Information Theory and Applications Workshop, Ita 2015 Conference Proceedings, 282–90, 2015. https://doi.org/10.1109/ITA.2015.7309002.
    Full Text
  - Li, S., Y. C. Huang, T. Liu, and H. D. Pfister. “On the limits of treating interference as noise for two-user symmetric Gaussian interference channels.” In Ieee International Symposium on Information Theory Proceedings, 2015-June:1711–15, 2015. https://doi.org/10.1109/ISIT.2015.7282748.
    Full Text
  - Rengaswamy, N., and H. D. Pfister. “Cyclic polar codes.” In Ieee International Symposium on Information Theory Proceedings, 2015-June:1287–91, 2015. https://doi.org/10.1109/ISIT.2015.7282663.
    Full Text
  - Hager, C., A. G. I. Amat, H. D. Pfister, A. Alvarado, F. Brannstrom, and E. Agrell. “On parameter optimization for staircase codes.” In Conference on Optical Fiber Communication, Technical Digest Series, Vol. 2015-June, 2015.
  - Häger, C., A. G. i Amat, H. D. Pfister, A. Alvarado, F. Brännström, and E. Agrell. “On parameter optimization for staircase codes.” In Optical Fiber Communication Conference, Ofc 2015, 2015.
  - Kumar, S., A. Vem, K. Narayanan, and H. D. Pfister. “Spatially-coupled codes for side-information problems.” In Ieee International Symposium on Information Theory Proceedings, 516–20, 2014. https://doi.org/10.1109/ISIT.2014.6874886.
    Full Text
  - Pfister, H. D., and K. R. Narayanan. “An introduction to spatially-coupled codes via practical examples.” In 2014 31th Ursi General Assembly and Scientific Symposium, Ursi Gass 2014, 2014. https://doi.org/10.1109/URSIGASS.2014.6929240.
    Full Text
  - Vem, A., Y. C. Huang, K. R. Narayanan, and H. D. Pfister. “Multilevel lattices based on spatially-coupled LDPC codes with applications.” In Ieee International Symposium on Information Theory Proceedings, 2336–40, 2014. https://doi.org/10.1109/ISIT.2014.6875251.
    Full Text
  - Obata, N., Y. Y. Jian, K. Kasai, and H. D. Pfister. “Spatially-coupled multi-edge type LDPC codes with bounded degrees that achieve capacity on the BEC under BP decoding.” In Ieee International Symposium on Information Theory Proceedings, 2433–37, 2013. https://doi.org/10.1109/ISIT.2013.6620663.
    Full Text
  - Pfister, H. D., and P. O. Vontobel. “On the relevance of graph covers and zeta functions for the analysis of SPA decoding of cycle codes.” In Ieee International Symposium on Information Theory Proceedings, 3000–3004, 2013. https://doi.org/10.1109/ISIT.2013.6620776.
    Full Text
  - Tunali, N. E., K. R. Narayanan, and H. D. Pfister. “Spatially-coupled low density lattices based on construction a with applications to compute-and-forward.” In 2013 Ieee Information Theory Workshop, Itw 2013, 2013. https://doi.org/10.1109/ITW.2013.6691275.
    Full Text
  - Jian, Y. Y., H. D. Pfister, K. R. Narayanan, R. Rao, and R. Mazahreh. “Iterative hard-decision decoding of braided BCH codes for high-speed optical communication.” In Globecom Ieee Global Telecommunications Conference, 2376–81, 2013. https://doi.org/10.1109/GLOCOM.2013.6831429.
    Full Text
  - Narayanan, K. R., and H. D. Pfister. “Iterative collision resolution for slotted ALOHA: An optimal uncoordinated transmission policy.” In International Symposium on Turbo Codes and Iterative Information Processing, Istc, 136–39, 2012. https://doi.org/10.1109/ISTC.2012.6325214.
    Full Text
  - Yedla, A., Y. Y. Jian, P. S. Nguyen, and H. D. Pfister. “A simple proof of threshold saturation for coupled scalar recursions.” In International Symposium on Turbo Codes and Iterative Information Processing, Istc, 51–55, 2012. https://doi.org/10.1109/ISTC.2012.6325197.
    Full Text
  - Hamidi-Sepehr, F., J. F. Chamberland, and H. D. Pfister. “On the performance of random block codes over finite-state fading channels.” In 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012, 17–25, 2012. https://doi.org/10.1109/Allerton.2012.6483194.
    Full Text
  - Kumar, S., A. J. Young, N. Maoris, and H. D. Pfister. “A proof of threshold saturation for spatially-coupled LDPC codes on BMS channels.” In 2012 50th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2012, 176–84, 2012. https://doi.org/10.1109/Allerton.2012.6483215.
    Full Text
  - Nguyen, P. S., A. Yedla, H. D. Pfister, and K. R. Narayanan. “Threshold saturation of spatially-coupled codes on intersymbol-interference channels.” In Ieee International Conference on Communications, 2181–86, 2012. https://doi.org/10.1109/ICC.2012.6364433.
    Full Text
  - Yedla, A., Y. Y. Jian, P. S. Nguyen, and H. D. Pfister. “A simple proof of threshold saturation for coupled vector recursions.” In 2012 Ieee Information Theory Workshop, Itw 2012, 25–29, 2012. https://doi.org/10.1109/ITW.2012.6404671.
    Full Text
  - Hamidi-Sepehr, F., H. D. Pfister, and J. F. Chamberland. “On the queueing behavior of Gilbert-Elliott channels in the rare-transition regime.” In 2012 46th Annual Conference on Information Sciences and Systems, Ciss 2012, 2012. https://doi.org/10.1109/CISS.2012.6310913.
    Full Text
  - Jian, Y. Y., H. D. Pfister, and K. R. Narayanan. “Approaching capacity at high rates with iterative hard-decision decoding.” In Ieee International Symposium on Information Theory Proceedings, 2696–2700, 2012. https://doi.org/10.1109/ISIT.2012.6284009.
    Full Text
  - Nguyen, P. S., A. Yedla, H. D. Pfister, and K. R. Narayanan. “On the maximum a posteriori decoding thresholds of multiuser systems with erasures.” In Ieee International Symposium on Information Theory Proceedings, 2701–5, 2012. https://doi.org/10.1109/ISIT.2012.6284013.
    Full Text
  - Xia, Z., G. H. Huff, J. F. Chamberland, H. Pfister, and R. Bhattacharya. “Direction of arrival estimation using canonical and crystallographic volumetric element configurations.” In Proceedings of 6th European Conference on Antennas and Propagation, Eucap 2012, 1436–39, 2012. https://doi.org/10.1109/EuCAP.2012.6206123.
    Full Text
  - Hamidi-Sepehr, Fatemeh, Jean-François Chamberland, and Henry D. Pfister. “On the performance of random block codes over finite-state fading channels..” In Allerton Conference, 17–25. IEEE, 2012.
  - Jian, Yung-Yih, Henry D. Pfister, and Krishna R. Narayanan. “Approaching capacity at high rates with iterative hard-decision decoding..” In Isit, 2696–2700. IEEE, 2012.
  - Yedla, Arvind, Yung-Yih Jian, Phong S. Nguyen, and Henry D. Pfister. “A simple proof of threshold saturation for coupled vector recursions..” In Itw, 25–29. IEEE, 2012.
  - Kumar, S., J. F. Chamberland, and H. D. Pfister. “Large deviations on empirical service for erasure channels with memory.” In 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011, 1641–48, 2011. https://doi.org/10.1109/Allerton.2011.6120365.
    Full Text
  - Yedla, A., P. S. Nguyen, H. D. Pfister, and K. R. Narayanan. “Universal codes for the Gaussian MAC via spatial coupling.” In 2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011, 1801–8, 2011. https://doi.org/10.1109/Allerton.2011.6120387.
    Full Text
  - Hamidi-Sepehr, F., Y. Cai, H. D. Pfister, and J. F. Chamberland. “Queueing behavior of the Gilbert-Elliott channel: BCH codes and Poisson arrivals.” In Ieee International Symposium on Information Theory Proceedings, 1806–10, 2011. https://doi.org/10.1109/ISIT.2011.6033861.
    Full Text
  - Yedla, A., H. D. Pfister, and K. R. Narayanan. “Universality for the noisy Slepian-Wolf problem via spatial coupling.” In Ieee International Symposium on Information Theory Proceedings, 2567–71, 2011. https://doi.org/10.1109/ISIT.2011.6034032.
    Full Text
  - Kim, B. H., and H. D. Pfister. “An iterative joint linear-programming decoding of LDPC codes and finite-state channels.” In Ieee International Conference on Communications, 2011. https://doi.org/10.1109/icc.2011.5962814.
    Full Text
  - Yedla, Arvind, Henry D. Pfister, and Krishna R. Narayanan. “Universality for the noisy Slepian-Wolf problem via spatial coupling..” In Isit, edited by Alexander Kuleshov, Vladimir M. Blinovsky, and Anthony Ephremides, 2567–71. IEEE, 2011.
  - Yedla, Arvind, Phong S. Nguyen, Henry D. Pfister, and Krishna R. Narayanan. “Universal codes for the Gaussian MAC via spatial coupling..” In Allerton, 1801–8. IEEE, 2011.
  - Chamberland, J. F., H. Pfister, and S. Shakkottai. “First-passage time analysis for digital communication over erasure channels with delay-sensitive traffic.” In 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010, 399–405, 2010. https://doi.org/10.1109/ALLERTON.2010.5706934.
    Full Text
  - Kudekar, S., and H. D. Pfister. “The effect of spatial coupling on compressive sensing.” In 2010 48th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2010, 347–53, 2010. https://doi.org/10.1109/ALLERTON.2010.5706927.
    Full Text
  - Jian, Y. Y., and H. D. Pfister. “Convergence of weighted min-sum decoding via dynamic programming on coupled trees.” In 6th International Symposium on Turbo Codes and Iterative Information Processing, Istc 2010, 487–91, 2010. https://doi.org/10.1109/ISTC.2010.5613901.
    Full Text
  - Kim, B. H., A. Yedla, and H. D. Pfister. “IMP: A message-passing algorithm for matrix completion.” In 6th International Symposium on Turbo Codes and Iterative Information Processing, Istc 2010, 462–66, 2010. https://doi.org/10.1109/ISTC.2010.5613803.
    Full Text
  - Yedla, A., H. D. Pfister, and K. R. Narayanan. “LDPC code design for transmission of correlated sources across noisy channels without CSIT.” In 6th International Symposium on Turbo Codes and Iterative Information Processing, Istc 2010, 467–71, 2010. https://doi.org/10.1109/ISTC.2010.5613829.
    Full Text
  - Kim, B. H., and H. D. Pfister. “On the joint decoding of LDPC codes and finite-state channels via linear programming.” In Ieee International Symposium on Information Theory Proceedings, 754–58, 2010. https://doi.org/10.1109/ISIT.2010.5513614.
    Full Text
  - Nguyen, P. S., H. D. Pfister, and K. R. Narayanan. “A rate-distortion exponent approach to multiple decoding attempts for Reed-Solomon codes.” In Ieee International Symposium on Information Theory Proceedings, 1095–99, 2010. https://doi.org/10.1109/ISIT.2010.5513703.
    Full Text
  - Parag, P., J. F. Chamberland, H. D. Pfister, and K. R. Narayanan. “On the queueing behavior of random codes over a gilbert-elliot erasure channel.” In Ieee International Symposium on Information Theory Proceedings, 1798–1802, 2010. https://doi.org/10.1109/ISIT.2010.5513296.
    Full Text
  - Zhang, F., H. D. Pfister, and A. Jiang. “LDPC codes for rank modulation in flash memories.” In Ieee International Symposium on Information Theory Proceedings, 859–63, 2010. https://doi.org/10.1109/ISIT.2010.5513603.
    Full Text
  - Parag, P., J. F. Chamberland, H. Pfister, and K. Narayanan. “Code rate, queueing behavior and the correlated erasure channel.” In Ieee Information Theory Workshop 2010, Itw 2010, 2010. https://doi.org/10.1109/ITWKSPS.2010.5503186.
    Full Text
  - Kim, Byung-Hak, and Henry D. Pfister. “On the joint decoding of LDPC codes and finite-state channels via linear programming..” In Isit, 754–58. IEEE, 2010.
  - Nguyen, Phong S., Henry D. Pfister, and Krishna R. Narayanan. “A rate-distortion exponent approach to multiple decoding attempts for Reed-Solomon codes..” In Isit, 1095–99. IEEE, 2010.
  - Parag, Parimal, Jean-François Chamberland, Henry D. Pfister, and Krishna R. Narayanan. “On the queueing behavior of random codes over a gilbert-elliot erasure channel..” In Isit, 1798–1802. IEEE, 2010.
  - Maduike, D., H. D. Pfister, and A. Sprintson. “Design and implementation of physical-layer network-coding protocols.” In Conference Record Asilomar Conference on Signals, Systems and Computers, 781–87, 2009. https://doi.org/10.1109/ACSSC.2009.5469964.
    Full Text
  - Nguyen, P. S., H. D. Pfister, and K. R. Narayanan. “A rate-distortion perspective on multiple decoding attempts for Reed-Solomon codes.” In 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009, 1235–42, 2009. https://doi.org/10.1109/ALLERTON.2009.5394533.
    Full Text
  - Yedla, A., H. D. Pfister, and K. R. Narayanan. “Can iterative decoding for erasure correlated sources be universal?.” In 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009, 408–15, 2009. https://doi.org/10.1109/ALLERTON.2009.5394794.
    Full Text
  - Zhang, F., and H. D. Pfister. “Modulation codes for flash memory based on load-balancing theory.” In 2009 47th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2009, 1039–46, 2009. https://doi.org/10.1109/ALLERTON.2009.5394880.
    Full Text
  - Wang, C. W., and H. D. Pfister. “Upper bounds on the MAP threshold of iterative decoding systems with erasure noise.” In 2008 5th International Symposium on Turbo Codes and Related Topics, Turbocoding, 7–12, 2008. https://doi.org/10.1109/TURBOCODING.2008.4658664.
    Full Text
  - Zhang, F., and H. D. Pfister. “Compressed sensing and linear codes over real numbers.” In 2008 Information Theory and Applications Workshop Conference Proceedings, Ita, 558–61, 2008. https://doi.org/10.1109/ITA.2008.4601055.
    Full Text
  - Pfister, H. D., and P. H. Siegel. “Joint iterative decoding of LDPC codes for channels with memory and erasure noise.” In Ieee Journal on Selected Areas in Communications, 26:320–37, 2008. https://doi.org/10.1109/JSAC.2008.080209.
    Full Text
  - Zhang, Fan, and Henry D. Pfister. “Compressed Sensing and Linear Codes over Real Numbers.” In 2008 Information Theory and Applications Workshop, 278–81. IEEE, 2008.
    Link to Item
  - Diggavi, S., M. Mitzenmacher, and H. D. Pfister. “Capacity upper bounds for the deletion channel.” In Ieee International Symposium on Information Theory Proceedings, 1716–20, 2007. https://doi.org/10.1109/ISIT.2007.4557469.
    Full Text
  - Fan, Z., and H. D. Pfister. “List-message passing achieves capacity on the q-ary symmetric channel for large q.” In Globecom Ieee Global Telecommunications Conference, 283–87, 2007. https://doi.org/10.1109/GLOCOM.2007.60.
    Full Text
  - Soriaga, J. B., H. D. Pfister, and P. H. Siegel. “Determining and approaching achievable rates of binary intersymbol interference channels using multistage decoding.” In Ieee Transactions on Information Theory, 53:1416–29, 2007. https://doi.org/10.1109/TIT.2007.892778.
    Full Text
  - Zhang, Fan, and Henry D. Pfister. “List-Message Passing Achieves Capacity on the q-ary Symmetric Channel for Large q..” In Globecom, 283–87. IEEE, 2007.
  - Hou, J., J. E. Smee, J. B. Soriaga, J. Chen, and H. D. Pfister. “Link-level modeling and performance of CDMA interference cancellation.” In Globecom Ieee Global Telecommunications Conference, 2006. https://doi.org/10.1109/GLOCOM.2006.661.
    Full Text
  - Sason, I., and H. D. Pfister. “Recent results on capacity-achieving codes for the erasure channel with bounded complexity.” In Ieee Convention of Electrical and Electronics Engineers in Israel, Proceedings, 339–43, 2006. https://doi.org/10.1109/EEEI.2006.321096.
    Full Text
  - Sason, Igal, and Henry D. Pfister. “Recent results on capacity-achieving codes for the erasure channel with bounded complexity.” In 2006 Ieee 24th Convention of Electrical & Electronics Engineers in Israel, 343-+. IEEE, 2006.
    Link to Item
  - Pfister, H. D. “Finite-length analysis of a capacity-achieving ensemble for the binary erasure channel.” In Proceedings of the Ieee Itsoc Information Theory Workshop 2005 on Coding and Complexity, Itw2005, 166–70, 2005. https://doi.org/10.1109/ITW.2005.1531880.
    Full Text
  - Pfister, H. D., I. Sason, and R. Urbanke. “Capacity-achieving ensembles for the binary erasure channel with bounded complexity.” In Ieee Transactions on Information Theory, 51:2352–79, 2005. https://doi.org/10.1109/TIT.2005.850079.
    Full Text
  - Pfister, H. D., and I. Sason. “Accumulate-repeat-accumulate codes: Systematic codes achieving the binary erasure channel capacity with bounded complexity.” In 43rd Annual Allerton Conference on Communication, Control and Computing 2005, 1:30–44, 2005.
  - Pfister, H., I. Sason, and R. Urbanke. “Capacity-achieving ensembles for the binary erasure channel with bounded complexity.” In Ieee Convention of Electrical and Electronics Engineers in Israel, Proceedings, 110–13, 2004.
  - Pfister, H., I. Sason, and R. Urbanke. “Capacity-achieving ensembles for the binary erasure channel with bounded complexity.” In Ieee International Symposium on Information Theory Proceedings, 2004.
  - Soriaga, J. B., H. D. Pfister, and P. H. Siegel. “On the low-rate shannon limit for binary intersymbol interference channels.” In Ieee Transactions on Communications, 51:1962–64, 2003. https://doi.org/10.1109/TCOMM.2003.820724.
    Full Text
  - Hou, J., P. H. Siegel, L. B. Milstein, and H. D. Pfister. “Capacity-Approaching Bandwidth-Efficient Coded Modulation Schemes Based on Low-Density Parity-Check Codes.” In Ieee Transactions on Information Theory, 49:2141-2155+2322, 2003. https://doi.org/10.1109/TIT.2003.815777.
    Full Text
  - Pfister, H. D., and P. H. Siegel. “The serial concatenation of rate-1 codes through uniform random interleaves.” In Ieee Transactions on Information Theory, 49:1425–38, 2003. https://doi.org/10.1109/TIT.2003.811907.
    Full Text
  - Askar, N. K., S. C. Lin, H. D. Pfister, G. E. Rogerson, and D. S. Furuno. “Spectral keying/spl trade/: A novel modulation scheme for UWB systems.” In 2003 Ieee Conference on Ultra Wideband Systems and Technologies, Uwbst 2003 Conference Proceedings, 418–22, 2003. https://doi.org/10.1109/UWBST.2003.1267876.
    Full Text
  - Soriaga, J. B., H. D. Pfister, and P. H. Siegel. “On approaching the capacity of finite-state intersymbol interference channels.” In Information, Coding and Mathematics, edited by M. Blaum, P. G. Farrell, and H. C. A. VanTilborg, 687:365–78. KLUWER ACADEMIC PUBLISHERS, 2002.
    Link to Item
  - Hou, J., P. H. Siegel, L. B. Milstein, and H. D. Pfister. “Multilevel coding with low-density parity-check component codes.” In Conference Record / Ieee Global Telecommunications Conference, 2:1016–20, 2001.
  - Pfister, H. D., J. B. Soriaga, and P. H. Siegel. “On the achievable information rates of finite state ISI channels.” In Conference Record / Ieee Global Telecommunications Conference, 5:2992–96, 2001.
  - Hou, J., P. H. Siegel, L. B. Milstein, and H. D. Pfister. “Design of low-density parity-check codes for bandwidth efficient modulation.” In Proceedings 2001 Ieee Information Theory Workshop, Itw 2001, 24–26, 2001. https://doi.org/10.1109/ITW.2001.955124.
    Full Text
  - Oberg, M., H. D. Pfister, and P. H. Siegel. “Parity-accumulate codes for magnetic recording.” In Digests of the Intermag Conference, 2000.
  - PFISTER, H. L., and H. D. PFISTER. “NONCONTACT BODY MEASUREMENT FOR AUTOMATED APPAREL MANUFACTURING.” In Factory Automation and Information Management, edited by M. M. AHMAD and W. G. SULLIVAN, 529–36. CRC PRESS INC, 1991.
    Link to Item
Teaching & Mentoring
Recent Courses

Some information on this profile has been compiled automatically from Duke databases and external sources. (Our About page explains how this works.) If you see a problem with the information, please write to Scholars@Duke and let us know. We will reply promptly.

Education, Training, & Certifications

Duke Appointment History

In the News

Awards & Honors

Subject Headings

Selected Grants

Industry Relationships

Selected Publications

Academic Articles

Digital Publications

Conference Papers

Recent Courses