|
Publications
Disclaimer
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In general, these works should not be reposted without the explicit permission of the copyright holder.
Recent Talks and Preprints
Journal Papers
A. Buchberger, C. Hager, H. D. Pfister, L. Schmalen, and A. Graell i Amat, “Pruning and quantizing neural belief propagation decoders,” in IEEE J. Select. Areas Commun., 2020.
C. Hager and H. D. Pfister, “Physics-based deep learning for fiber-optic communication systems,” in IEEE J. Select. Areas Commun., vol. 39, no. 1, pp. 280-294, 2020.
R. M. Butler, C. Hager, H. D. Pfister, G. Liga, and A. Alvarado, “Model-based machine learning for joint digital backpropagation and PMD compensation,” in J. Lightwave Technol., 2020.
N. Rengaswamy, R. Calderbank, S. Kadhe, and H. D. Pfister, “Logical Clifford synthesis for stabilizer codes,” in IEEE Transactions on Quantum Engineering, vol. 1, pp. 1-17, 2020.
T. Can, N. Rengaswamy, R. Calderbank, and H. D. Pfister, “Kerdock codes determine unitary 2-designs,” in IEEE Trans. Inform. Theory, vol. 66, no. 10, pp. 6104-6120, 2020.
N. Rengaswamy, R. Calderbank, M. Newman, and H. D. Pfister, “On optimality of CSS codes for transversal T ,” in IEEE J. Sel. Areas in Inf. Theory, vol. 1, no. 2, pp. 499-514, 2020.
V. Oliari, S. Goossens, C. Hager, G. Liga, R. M. Butler, M. van den Hout, S. van der Heide, H. D. Pfister, C. M. Okonkwo, and A. Alvarado, “Revisiting efficient multi-step nonlinearity compensation with machine learning: An experimental demonstration,” in J. Lightwave Technol., 2020. DOI
N. Rengaswamy, R. Calderbank, and H. D. Pfister, “Unifying the Clifford hierarchy via symmetric matrices over rings,” in Phys. Rev. A, vol. 100, no. 2, p. 022304, 2019.
C. Schmidt, H. D. Pfister, and L. Zdeborova, “Minimal sets to destroy the k-core in random networks,” in Phys. Rev. E, vol. 99, no. 2, p. 022310, 2019.
H. D. Pfister and R. Urbanke, “Near-optimal finite-length scaling for polar codes over large alphabets,” in IEEE Trans. Inform. Theory, vol. 65, no. 9, pp. 5643-5655, 2019. DOI
G. Reeves and H. D. Pfister, “The replica-symmetric prediction for random linear estimation with Gaussian matrices is exact,” in IEEE Trans. Inform. Theory, vol. 65, no. 4, pp. 2252-2283, 2019. DOI
I. Yoo, 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,” in IEEE Trans. Commun., 2018. DOI
C. Häager and H. D. Pfister, “Approaching miscorrection-free performance of product and generalized product codes,” in IEEE Trans. Commun., vol. 66, 2018. DOI
P. Charbonneau, Y. C. Li, H. D. Pfister, and S. Yaida, “Cycle-expansion method for the lyapunov exponent, susceptibility, and higher moments,” in Physical Review E, vol. 96, no. 3, p. 032129, 2017.
Y. Y. Jian, H. D. Pfister, and K. R. Narayanan, “Approaching capacity at high rates with iterative hard-decision decoding,” in IEEE Trans. Inform. Theory, vol. 63, pp. 5752-5773, Sept. 2017. DOI
C. Häger, H. D. Pfister, A. Graell i Amat, and F. Brännstrom, “Density evolution for deterministic generalized product codes on the binary erasure channel at high rates,” in IEEE Trans. Inform. Theory, 2017. DOI
S. Kudekar, S. Kumar, M. Mondelli, H. D. Pfister, E. Sasoglu, and R. Urbanke, “Reed-Muller codes achieve capacity on erasure channels,” in IEEE Trans. Inform. Theory, vol. 63, no. 7, pp. 4298-4316, 2017. DOI
O. Sabag, H. H. Permuter, and H. D. Pfister, “A single-letter upper bound on the feedback capacity of unifilar finite-state channels,” in IEEE Trans. Inform. Theory, vol. 63, no. 3, pp. 1392-1409, 2017. DOI
F. Hamidi-Sepehr, J.-F. Chamberland, and H. D. Pfister,
“On the performance of block codes over finite-state channels in the rare-transition regime,”
in IEEE Trans. Commun., vol. 63, pp. 3974-3990, Nov. 2015. DOI
F. Hamidi-Sepehr , H. D. Pfister, and J.-F. Chamberland,
“Delay-sensitive communication over fading channels: Queueing behavior and code parameter selection,”
in IEEE Trans. Vehicular Technology, vol. 64, pp. 3957-3970, Sept. 2015. DOI
S. Kumar, A. J. Young, N. Macris, and H. D. Pfister,
“Threshold saturation for spatially-coupled LDPC and LDGM codes on BMS channels,”
in IEEE Trans. on Inform. Theory, vol. 60, pp. 7389-7415, Dec. 2014. DOI
A. Yedla, Y.-Y. Jian, P. S. Nguyen, and H. D. Pfister,
“A simple proof of Maxwell saturation for coupled scalar recursions,”
in IEEE Trans. on Inform. Theory, vol. 60, pp. 6943-6965, Nov. 2014. DOI
Y.-Y. Jian and H. D. Pfister,
“Convergence of weighted min-sum decoding via dynamic programming on trees,”
in IEEE Trans. on Inform. Theory, vol. 60, pp. 6943-6965, Nov. 2014. DOI
S. Kumar, J.-F. Chamberland, and H. D. Pfister,
“First-passage time and large-deviation analysis for erasure channels with memory,”
in IEEE Trans. Inform. Theory, vol. 59, pp. 5547-5565, Sept. 2013. DOI
A. Yedla, H. D. Pfister, and K. R. Narayanan,
“Code design for the noisy Slepian-Wolf problem,”
in IEEE Trans. Commun., vol. 61, pp. 2535-2545, June 2013. DOI
P. Parag, J.-F. Chamberland, H. D. Pfister, and K. R. Narayanan,
“Code-rate selection, queueing behavior, and the correlated erasure channel,”
in IEEE Trans. on Inform. Theory, vol. 59, pp. 397-407, Jan. 2013. DOI
F. Zhang and H. D. Pfister,
“Verification decoding of high-rate LDPC codes with applications in compressed sensing,”
in IEEE Trans. on Inform. Theory, vol. 58, pp. 5042-5058, Aug. 2012. DOI
Byung-Hak Kim and H. D. Pfister,
“Joint decoding of LDPC codes and finite-state channels via linear programming,”
in IEEE J. Select. Topics in Signal Proc., vol. 5, pp. 1563-1576, Dec. 2011. DOI
F. Zhang and H. D. Pfister,
“Analysis of verification-based decoding on the q-ary symmetric channel for large q,”
in IEEE Trans. on Inform. Theory, vol. 57, pp. 6754-6770, Oct. 2011. arxiv
H. D. Pfister,
“The capacity of finite-state channels in the high-noise regime,”
in Entropy of Hidden Markov Processes and Connections to Dynamical Systems: Papers from the Banff International Research Station Workshop (B. Marcus, K. Petersen, and T. Weissman, eds.),
London Mathematical Society Lecture Note Series,
Cambridge University Press, 2011. arxiv
P. S. Nguyen, H. D. Pfister, and K. R. Narayanan,
“On multiple decoding attempts for Reed-Solomon codes: A rate-distortion approach,”
in IEEE Trans. on Inform. Theory, vol. 57, pp. 668-691, Feb. 2011. arxiv
M. P. Wilson, K. Narayanan, H. D. Pfister, and A. Sprintson,
“Joint physical layer coding and network coding for bi-directional relaying,”
in IEEE Trans. on Inform. Theory, vol. 56, pp. 5641-5654, Nov. 2010. arxiv
H. D. Pfister and P. H. Siegel, “Joint iterative decoding of LDPC codes for
channels with memory and erasure noise,” in
IEEE J. Select. Areas Commun., vol. 26 (2), pp. 320-327,
Feb. 2008. paper
H. D. Pfister and I. Sason, “Accumulate-repeat-accumulate codes: Capacity-achieving ensembles
of systematic codes for the erasure channel with bounded complexity,”
in IEEE Trans. on Inform. Theory, vol. 53 (6), pp. 2088-2115, June 2007. paper
J. B. Soriaga, H. D. Pfister and P. H. Siegel,
“Determining and approaching achievable rates of binary intersymbol interference channels using multistage decoding,”
in IEEE Trans. on Inform. Theory, vol. 53 (4), pp. 1416-1429, April 2007.
paper
J. Hou, J. E. Smee, H. D. Pfister, S. Tomasin, “Implementing interference cancellation
to increase the EV-DO Rev A reverse link capacity,” in IEEE Comm. Magazine,
vol. 44 (2), pp. 58-64, Feb. 2006. paper
H. D. Pfister, I. Sason, and R. Urbanke, “Capacity-achieving ensembles
for the binary erasure channel with bounded complexity,”
in IEEE Trans. on Inform. Theory, vol. 51 (7), pp. 2352-2379, July 2005.
paper
J. B. Soriaga, H. D. Pfister, and P. H. Siegel, “On the low-rate Shannon limit
for binary intersymbol interference channels,” in IEEE Trans. on Communications,
vol. 51 (12), pp. 1962-1964, Dec. 2003.
paper
J. Hou, 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 Trans. on Inform. Theory, vol. 49 (9), pp. 2141-2155, Sept. 2003.
paper
H. D. Pfister and P. H. Siegel, “The serial concatenation of rate-1 codes through uniform random interleavers,”
in IEEE Trans. on Inform. Theory, vol. 49 (6), pp. 1425-1438, June 2003.
paper
Invited Talks
“Pruning Machine Learning Models,” slides
2020 Workshop on Machine Learning for Communications (MLCOM), Israel, Sep. 8, 2020.
“Insight from Simple Questions: Three Examples,” slides
Jack Keil Wolf Lecture on Information Theory and Applications, UC San Diego, Dec. 1, 2017
“Capacity via Symmetry: Extensions and Practical Consequences,” slides
MIT LIDS Seminar Series, April 4, 2017
“Capacity Achieving Codes: There and Back Again,” slides
European School of Information Theory, Chalmers University, Gothenburg, Sweden, April 6th, 2016
“Reed-Muller Codes Achieve Capacity on Erasure Channels,” slides
ECE Department, University of Illinois, Urbana Champaign, Nov. 16, 2015,
Science of Information Day, Princeton University, Sept. 25, 2015.
“A Brief Introduction to Spatially-Coupled Codes and Threshold Saturation,” slides
Chinese University of Hong Kong, June 22, 2015.
“Symmetric Product Codes,” slides
Coding: From Practice to Theory Workshop, Simons Institute, UC Berkeley, Feb. 13, 2015.
“A Brief Introduction to Spatially-Coupled Codes and Threshold Saturation,” slides
North American School for Information Theory, University of Toronto, June 18-21, 2014.
“Graphical Models and Inference: Breakthroughs and Insight from Spatial Coupling,” slides
Duke University, March 17th, 2014.
“From BP to MAP via Spatial Coupling” slides
Wireless Networking and Communication Seminar, University of Texas, Austin, Nov. 9th, 2012.
“A Simple Proof of Threshold Saturation for Coupled Scalar Recursions” slides
Stanford University, August 17th, 2012,
Summer Research Institute, Ecole Polytechnique Federale de Lausanne, June 7th, 2012.
“Applications of spatial coupling in communications, computer science, signal processing, and statistical physics - an overview” (with Kenta Kasai)
CAACT Workshop: Aspects of Coding Theory
Centre Interfacultaire Bernoulli, Lausanne, Switzerland, July 2011.
“Information Theory and Coding for Compressed Sensing” slides
Center for Wireless Communications Ericsson Seminar
University of California, San Diego, March 2, 2009.
“The Derivatives of Entropy Rate and Capacity for Finite-State Channels” slides
Entropy of Hidden Markov Processes and Connections to Dynamical Systems
Banff International Reseach Station (BIRS), Banff, Canada, October 5, 2007.
“Interleaved and Lifted Reed-Solomon Codes: New Perspectives and Constructions” slides
Swiss Federal Institute of Technology, Zurich, July 2007.
AMS Joint Mathematics Special Session on Coding Theory, New Orleans, January 2007.
“Modulation and Coding for Satellite Communications” slides
SatNEx Summer School, Pisa, Italy, August 2005.
Selected Conference Papers
M. C. Coskun and H. D. Pfister, “Bounds on the list size of successive cancellation list decoding,” in International Conference on Signal Processing and Communications (SPCOM), 2020.
A. Thangaraj and H. D. Pfister, “Efficient maximum-likelihood decoding of Reed-Muller RM(m-3,m) codes,” in Proc. IEEE Int. Symp. Inform. Theory, pp. 263-268, IEEE, 2020.
S. Brandsen, K. D. Stubbs, and H. D. Pfister, “Reinforcement learning with neural networks for quantum multiple hypothesis testing,” in Proc. IEEE Int. Symp. Inform. Theory, pp. 1897-1902, 2020.
S. Brandsen, M. Lian, K. D. Stubbs, N. Rengaswamy, and H. D. Pfister, “Adaptive procedures for discriminating between arbitrary tensor-product quantum states,” in Proc. IEEE Int. Symp. Inform. Theory, pp. 1933-1938, 2020.
M. C. Coskun, J. Neu, and H. D. Pfister, “Successive cancellation inactivation decoding for modified Reed-Muller and eBCH codes,” in Proc. IEEE Int. Symp. Inform. Theory, 2020.
A. Buchberger, C. Häger, H. D. Pfister, L. Schmalen, and A. Graell i Amat, “Pruning neural belief propagation decoders,” in Proc. IEEE Int. Symp. Inform. Theory, 2020.
M. Lian, C. Häger, and H. D. Pfister, “Decoding Reed-Muller codes using redundant code con- straints,” in Proc. IEEE Int. Symp. Inform. Theory, pp. 42-47, 2020.
N. Rengaswamy, R. Calderbank, M. Newman, and H. D. Pfister, “Classical coding problem from transversal T gates,” in Proc. IEEE Int. Symp. Inform. Theory, pp. 1891-1896, 2020.
N. Rengaswamy, K. P. Seshadreesan, S. Guha, and H. D. Pfister, “Quantum advantage via qubit belief propagation,” in Proc. IEEE Int. Symp. Inform. Theory, pp. 1824-1829, 2020.
C. Häger, H. D. Pfister, R. M. Butler, G. Liga, and A. Alvarado, “Model-based machine learning for joint digital backpropagation and PMD compensation,” in Proc. OSA Optical Fiber Commun. Conf., Optical Society of America, 2020.
F. Carpi, C. Häger, M. Martalo, R. Raheli, and H. D. Pfister, “Reinforcement learning for channel coding: Learned bit-flipping decoding,” in Proc. Annual Allerton Conf. on Commun., Control, and Comp., pp. 922-929, 2019.
I. Tal, H. D. Pfister, A. Fazeli, and A. Vardy, “Polar codes for the deletion channel: Weak and strong polarization,” in Proc. IEEE Int. Symp. Inform. Theory, pp. 1362-1366, 2019.
T. Can, N. Rengaswamy, R. Calderbank, and H. D. Pfister, “Kerdock codes determine unitary 2-designs,” in Proc. IEEE Int. Symp. Inform. Theory, pp. 2908-2912, 2019.
M. Lian, F. Carpi, C. Häger, and H. D. Pfister, “Learned belief-propagation decoding with simple scaling and SNR adaptation,” in Proc. IEEE Int. Symp. Inform. Theory, pp. 161-165, 2019.
C. Häger, H. D. Pfister, R. M. Bütler, G. Liga, and A. Alvarado, “Revisiting multi-step nonlinearity compensation with machine learning,” in Proc. European Conf. Optical Communication (ECOC), 2019.
A. Sheikh, A. Graell i Amat, G. Liva, C. Häger, and H. D. Pfister, “On low-complexity decoding of product codes for high-throughput fiber-optic systems,” in Proc. Int. Symp. on Turbo Codes & Iterative Inform. Proc., 2018. arxiv.
M. Lian, C. Häger, and H. D. Pfister, “What can machine learning teach us about communications?,” in Proc. IEEE Inform. Theory Workshop, (Guangzhou, China), 2018.
C. Häger and H. D. Pfister, “Wideband time-domain digital backpropagation via subband pro- cessing and deep learning,” in Proc. European Conf. Optical Communication (ECOC), 2018.
C. Fougstedt, 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,” in Proc. European Conf. Optical Communication (ECOC), (Rome, Italy), Sept. 2018.
C. Häger and H. D. Pfister, “Deep learning of the nonlinear Schrödinger equation in fiber-optic communications,” in Proc. IEEE Int. Symp. Inform. Theory, 2018. arxiv.
N. Rengaswamy, R. Calderbank, S. Kadhe, and H. D. Pfister, “Synthesis of logical Clifford operators via symplectic geometry,” in Proc. IEEE Int. Symp. Inform. Theory, pp. 791-795, IEEE, 2018.
E. Santi, C. Häger, and H. D. Pfister, “Decoding Reed-Muller codes using minimum-weight parity checks,” in Proc. IEEE Int. Symp. Inform. Theory, 2018. arxiv.
G. Reeves, H. D. Pfister, and A. Dytso, “Mutual information as a function of matrix SNR for linear Gaussian channels,” in Proc. IEEE Int. Symp. Inform. Theory, 2018.
C. Häger and H. D. Pfister, “Nonlinear interference mitigation via deep neural networks,” in Proc. OSA Optical Fiber Commun. Conf., 2018.
C. Häger and H. D. Pfister, “Miscorrection-free decoding of staircase codes,” in Proc. European Conf. Optical Communication (ECOC), (Gothenburg, Sweden), Sept. 2017.
S. Kumar, R. Calderbank, and H. D. Pfister, “Reed-Muller codes achieve capacity on the quantum erasure channel,” in Proc. IEEE Int. Symp. Inform. Theory, (Barcelona, Spain), pp. 1750-1754, 2016.
S. Kumar, R. Calderbank, and H. D. Pfister, “Beyond double transitivity: Capacity-achieving cyclic codes on erasure channels,” in Proc. IEEE Inform. Theory Workshop, (Cambridge, England), 2016.
G. Reeves and H. D. Pfister, “The replica-symmetric prediction for compressed sensing with Gaussian matrices is exact,” in Proc. IEEE Int. Symp. Inform. Theory, (Barcelona, Spain), pp. 665- 669, 2016.
H. D. Pfister and R. Urbanke, “Near-optimal finite-length scaling for polar codes over large alphabets,” in Proc. IEEE Int. Symp. Inform. Theory, (Barcelona, Spain), pp. 215-219, 2016.
C. Häger, H. D. Pfister, A. Graell i Amat, and F. Bräannstrom, “Deterministic and ensemble-based spatially-coupled product codes,” in Proc. IEEE Int. Symp. Inform. Theory, (Barcelona, Spain), pp. 2114-2118, 2016.
O. Sabag, H. H. Permuter, and H. D. Pfister, “A single-letter upper bound on the feedback capacity of unifilar finite-state channels,” in Proc. IEEE Int. Symp. Inform. Theory, (Barcelona, Spain), pp. 310-314, 2016.
S. Kudekar, S. Kumar, M. Mondelli, H. D. Pfister, and R. L. Urbanke, “Comparing the bit-MAP and block-MAP decoding thresholds of Reed-Muller codes on BMS channels,” in Proc. IEEE Int. Symp. Inform. Theory, (Barcelona, Spain), pp. 1755-1759, 2016.
S. Kumar, R. Calderbank, and H. D. Pfister, “Reed-Muller codes achieve capacity on the quantum erasure channel,” in Proc. IEEE Int. Symp. Inform. Theory, (Barcelona, Spain), pp. 1750-1754, 2016.
S. Kudekar, S. Kumar, M. Mondelli, H. D. Pfister, and R. Urbanke, “Reed-Muller codes achieve capacity on erasure channels,”
S. Kudekar, S. Kumar, M. Mondelli, H. D. Pfister, E. Sasoglu, and R. Urbanke,
“Reed-Muller Codes Achieve Capacity on Erasure Channels” slides paper,
2016 Symposium the Theory of Computing (STOC), Boston, MA, June 20, 2016.
C. Häger, H. D. Pfister, A. G. i Amat, and F. Brännstrom, “Density evolution and error floor analysis for staircase and braided codes,” in Proc. OSA Optical Fiber Commun. Conf., 2016.
M. Mondelli, S. Kudekar, S. Kumar*, H. Pfister, E. Sasoglu, and R. Urbanke, “Reed-Muller codes: Thresholds and weight distribution,” in Proc. IEEE Intl. Zurich Seminar on Commun., (Zurich, Switzerland), p. 50, 2016.
C. Häger, H. D. Pfister, A. Graell i Amat, F. Brännstrom, and E. Agrell, “A deterministic construction and density evolution analysis for generalized product codes,” in Proc. IEEE Intl. Zurich Seminar on Commun., (Zurich, Switzerland), 2016.
N. Rengaswamy and H. D. Pfister,
“Cyclic polar codes,”
in Proc. IEEE Int. Symp. Inform. Theory, pp. 1287-1291, June 2015.
S. Li, 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 Proc. IEEE Int. Symp. Inform. Theory, pp. 1711-1715, June 2015.
C. Häger, A. Amat, H. D. Pfister, A. Alvarado, F. Brännstrom , and E. Agrell,
“On parameter optimization for staircase codes,”
in Proc. Optical Fiber Communication Conference, pp. 1-3, March 2015.
H. D. Pfister, S. Emmadi, and K. Narayanan,
“Symmetric product codes,”
in Proc. Annual Workshop on Inform. Theory and its Appl., pp. 282-290, Feb. 2015.
A. Vem, Y.-C. Huang, K. R. Narayanan, and H. D. Pfister,
“Multilevel lattices based on spatially-coupled LDPC codes with applications,”
in Proc. IEEE Int. Symp. Inform. Theory, pp. 2336-2340, 2014.
S.Kumar, A. Vem, K. Narayanan, and H. D. Pfister,
“Spatially-coupled codes for side-information problems,”
in Proc. IEEE Int. Symp. Inform. Theory, pp. 516–520, 2014.
Y.-Y. Jian, 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 Proc. IEEE Global Telecom. Conf., (Atlanta, GA, USA), 2013.
N. E. Tunali, K. R. Narayanan, and H. D. Pfister,
“Spatially-coupled low density lattices based on construction A with applications to compute-and-forward,”
in Proc. IEEE Inform. Theory Workshop, (Sevilla, Spain), 2013.
N. Obata, 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 Proc. IEEE Int. Symp. Inform. Theory, pp. 2433-2437, 2013.
H. D. Pfister and P. O. Vontobel,
“On the relevance of graph covers and zeta functions for the analysis of SPA decoding of cycle codes,”
in Proc. IEEE Int. Symp. Inform. Theory, pp. 3000-3004, 2013.
S. Kumar, A. J. Young, N. Macris, and H. D. Pfister,
“A proof of threshold saturation for spatially-coupled LDPC codes on BMS channels,”
in Proc. Annual Allerton Conf. on Commun., Control, and Comp., 2012.
A. Yedla, Y. Y. Jian, P. S. Nguyen, and H. D. Pfister,
“A simple proof of threshold saturation for coupled vector recursions,”
in Proc. IEEE Inform. Theory Workshop, 2012. paper
arxiv
A. Yedla, Y.-Y. Jian, P. S. Nguyen, and H. D. Pfister,
“A simple proof of threshold saturation for coupled scalar recursions,”
in Proc. Int. Symp. on Turbo Codes & Iterative Inform. Proc., 2012.
arxiv
Y.-Y. Jian, H. D. Pfister, and K. R. Narayanan,
“Approaching capacity at high rates with iterative hard-decision decoding,”
in Proc. IEEE Int. Symp. Inform. Theory, pp. 2696–2700, 2012.
arxiv
P. S. Nguyen, A. Yedla, H. D. Pfister, and K. R. Narayanan,
“On the maximum a posteriori decoding thresholds of multiuser systems with erasures,”
in Proc. IEEE Int. Symp. Inform. Theory, (Cambridge, MA), pp. 2711–2715, July 2012.
P. S. Nguyen, A. Yedla, H. D. Pfister, and K. R. Narayanan,
“Threshold saturation of spatially-coupled codes on intersymbol-interference channels.”
in IEEE Int. Conf. Commun., Jan. 2012. paper slides
F. Hamidi-Sepehr, H. D. Pfister, and J. F. Chamberland,
“On the queueing behavior of Gilbert-Elliott channels in the rare-transition regime,”
in Proc. Conf. on Inform. Sciences and Systems, 2012.
S. Kumar, J.-F. Chamberland, and H. D. Pfister,
“Large deviations on empirical service for erasure channels with memory,”
in Proc. Annual Allerton Conf. on Commun., Control, and Comp., (Monticello, IL), Sept. 2011.
paper slides
A. Yedla, P. S. Nguyen, H. D. Pfister, and K. R. Narayanan,
“Universal codes for the Gaussian MAC via spatial coupling,”
in Proc. Annual Allerton Conf. on Commun., Control, and Comp., (Monticello, IL), Sept. 2011. paper slides
A. Yedla, H. Pfister, and K. Narayanan,
“Universality for the noisy Slepian-Wolf problem via spatial coupling,”
in Proc. IEEE Int. Symp. Inform. Theory ,
(St. Petersburg, Russia), July 2011. paper slides
F. Hamidi-Sepehr, Y. Cai, H. D. Pfister, and J.-F. Chamberland,
“Queueing behavior of the Gilbert-Elliott channel: BCH codes and Poisson arrivals,”
in Proc. IEEE Int. Symp. Inform. Theory ,
(St. Petersburg, Russia), July 2011. paper
B.-H. Kim and H. D. Pfister,
“An iterative joint linear-programming decoding of LDPC codes and finite-state channels,”
in Proc. IEEE Int. Conf. Commun., June 2011.
arxiv
S. Kudekar and H. Pfister,
“The effect of spatial coupling on compressive sensing,”
in Proc. Annual Allerton Conf. on Commun., Control, and Comp.,
(Monticello, IL), 2010. arxiv
A. Yedla, H. Pfister, and K. Narayanan,
“LDPC code design for transmission of correlated sources across noisy channels without CSIT,”
in Proc. Int. Symp. on Turbo Codes & Iterative Inform. Proc.,
(Brest, France), pp. 474-478, Sept. 2010.
paper slides
B.-H. Kim, A. Yedla, and H. Pfister,
“IMP: A message-passing algorithm for matrix completion,”
in Proc. Int. Symp. on Turbo Codes & Iterative Inform. Proc.,
(Brest, France), pp. 469-473, Sept. 2010. paper slides
Y.-Y. Jian and H. D. Pfister,
“Convergence of weighted min-sum decoding via dynamic programming on coupled trees,”
in Proc. Int. Symp. on Turbo Codes & Iterative Inform. Proc.,
(Brest, France), pp. 487-491, Sept. 2010. paper
P. Parag, J.-F. Chamberland, H. D. Pfister, and K. R. Narayanan,
“On the queueing behavior of random codes over a Gilbert-Elliott erasure channel,”
in Proc. IEEE Int. Symp. Inform. Theory ,
(Austin, TX), pp. 1798-1802, June 2010. paper slides
B.-H. Kim and H. D. Pfister,
“On the joint decoding of LDPC codes and finite-state channels via linear programming,”
in Proc. IEEE Int. Symp. Inform. Theory ,
(Austin, TX), pp. 754-758, June 2010. paper slides
F. Zhang, H. D. Pfister, and A. Jiang,
“LDPC codes for rank modulation in flash memories,”
in Proc. IEEE Int. Symp. Inform. Theory ,
(Austin, TX), pp. 859-863, June 2010. paper
P. S. Nguyen, H. D. Pfister, and K. R. Narayanan,
“A rate-distortion exponent approach to multiple decoding attempts for Reed-Solomon codes,”
in Proc. IEEE Int. Symp. Inform. Theory, (Austin, TX), pp. 1798-1802, June 2010. paper slides
P. Parag, J.-F. Chamberland, H. D. Pfister, and K. R. Narayanan,
“Code rate, queueing behavior and the correlated erasure channel,”
in Proc. IEEE Inform. Theory Workshop ,
(Cairo, Egypt), Jan. 2010. paper slides
F. Zhang and H. D. Pfister,
“Modulation codes for flash memory based on load-balancing theory,”
in Proc. 47th Annual Allerton Conf. on Commun., Control, and Comp.,
(Monticello, IL), Sept. 2009. paper slides
A. Yedla, H. D. Pfister, and K. R. Narayanan,
“Can iterative decoding for erasure correlated sources be universal?,”
in Proc. 47th Annual Allerton Conf. on Commun., Control, and Comp.
(Monticello, IL), Sept. 2009. paper slides
P. S. Nguyen, H. D. Pfister, and K. R. Narayanan,
“A rate-distortion perspective on multiple decoding attempts for Reed-Solomon codes,”
in Proc. 47th Annual Allerton Conf. on Commun., Control, and Comp.,
(Monticello, IL), pp. 1235-1242, Oct. 2009. paper slides
C. Wang and H. D. Pfister,
“Upper bounds on the MAP threshold of iterative decoding systems with erasure noise,”
in Proc. Int. Symp. on Turbo Codes & Related Topics, Lausanne, Switzerland, Sep.
2008. paper slides
(this pdf has been updated to correct a typo in Lemma 3)
F. Zhang and H. D. Pfister,
“On the iterative decoding of high rate LDPC codes with applications in compressed sensing,”
in Proc. 46th Annual Allerton Conf. on Commun., Control, and Comp., Monticello, IL, Sep.
2008. paper slides
F. Zhang and H. D. Pfister, “Compressed Sensing and Linear Codes over Real Numbers,” in
Proc. 2008 Workshop on Inform. Theory and Appl., UCSD, La Jolla, CA, Feb.
2008. paper slides
S. Diggavi, M. Mitzenmacher, and H. D. Pfister, “Capacity upper bounds for deletion channels,”
in Proc. Int. Symp. on Inform. Theory, pp. 1716-1720, Nice, France, June
2007. paper
H. D. Pfister and I. Sason, “Capacity-achieving ensembles of accumulate-repeat-accumulate
codes for the erasure channel with bounded complexity,” in Proc. 2006 Workshop on Inform. Theory and Appl., UCSD, La Jolla, CA, Feb. 2006. paper
slides
H. D. Pfister, “Finite-length analysis of a capacity-achieving ensemble for the binary
erasure channel,” in Proc. IEEE Inform. Theory Workshop, Rotorua, New Zealand, Sep. 2005.
paper
slides
H. Pfister and I. Sason, “Accumulate-repeat-accumulate codes: Systematic codes achieving the
binary erasure channel capacity with bounded complexity,” in Proc. 43rd Annual Allerton Conf. on Comm., Control and Computing, pp. 30-45, Urbana-Champaign, IL, Sept. 2005.
arxiv
slides
H. Pfister, I. Sason and R. Urbanke, “Bounds on the decoding
complexity of punctured codes on graphs,” in Proc. 42nd Allerton Conf. on Comm., Control and Computing, Monticello,
Illinois, pp. 481-491, Sept. 2004.
paper
H. D. Pfister, I. Sason, and R. Urbanke, “Capacity-achieving ensembles
for the binary erasure channel with bounded complexity,”
in Proc. Int. Symp. on Inform. Theory, pp. 207,
Chicago, IL, USA, June 2004.
paper
slides
H. D. Pfister and P. H. Siegel, “Joint iterative decoding of LDPC codes
and channels with memory,” in Proc. 3rd Intl. Symp. on Turbo Codes and Related Topics, Brest, France, pp. 15-18, Sep. 2003.
paper
slides
H. D. Pfister, J. B. Soriaga and P. H. Siegel, “On the achievable information
rates of finite state ISI channels,”
in Proc. IEEE Globecom, San Antonio, TX, pp. 2992-2996, Nov. 2001.
paper
slides
J. Hou, P. H. Siegel, L. B. Milstein, and H. D. Pfister, “Multilevel
coding with low-density parity-check components codes,”
in Proc. IEEE Globecom, San Antonio, TX, pp. 1016-1020, Nov. 2001.
J. Hou, P. H. Siegel, L. B. Milstein, and H. D. Pfister, “Design of
low-density parity-check codes for bandwidth efficient modulation,”
in Proc. IEEE Inform. Theory Workshop, Cairns, Australia, pp. 24-26, Sep.
2001. paper
H. D. Pfister and P. H. Siegel, “Coding theorems for generalized repeat
accumulate codes,”
in Proc. Int. Symp. on Inform. Theory and its Applications (ISITA2000),
Honolulu, HI, pp. 21-25, Nov. 2000.
paper
slides
M. Oberg, H. D. Pfister, and P. H. Siegel, “Parity-accumulate codes
for magnetic recording,” in IEEE Intermag Digest of Technical Papers,
Toronto, Canada, pp. 517, Apr. 2000.
H. D. Pfister and P. H. Siegel, “The serial concatenation of rate-1 codes
through uniform random interleavers,” in Proc. 37th Allerton Conf. on Comm., Control and Computing, Monticello, Illinois, pp.
260-269, Sep. 1999.
paper
slides
Dissertation
On the Capacity of Finite State Channels and the Analysis of Convolutional Accumulate-m Codes
Patents
|