Henry Pfister

Journal article IEEE Transactions on Communications · January 1, 2026 This paper proposes a method to maximize the rate of reliable communication for polar codes operating on channels with memory. The channel is learned implicitly from data by optimizing a neural polar decoder (NPD). This approach enables simultaneous optimi ... Full text Cite

Neural Polar Decoders for Receivers in Wireless Communication

Journal article IEEE Transactions on Communications · January 1, 2026 In this paper, we adapt and analyze Neural Polar Decoders (NPDs) for end-to-end communication systems. While prior work demonstrated the effectiveness of NPDs on synthetic channels, this study extends the NPD to real-world communication systems. The NPD wa ... Full text Cite

Cluster Decomposition for Improved Erasure Decoding of Quantum LDPC Codes

Journal article IEEE Journal on Selected Areas in Information Theory · January 1, 2025 We introduce a new erasure decoder that applies to arbitrary quantum LDPC codes. Dubbed the cluster decoder, it generalizes the decomposition idea of Vertical-Horizontal (VH) decoding introduced by Connolly et al. in 2022. Like the VH decoder, the idea is ... Full text Cite

Neural Polar Decoders for DNA Data Storage

Journal article IEEE Journal on Selected Areas in Information Theory · January 1, 2025 Synchronization errors, arising from both synthesis and sequencing noise, present a fundamental challenge in DNA-based data storage systems. These errors are often modeled as insertion-deletion-substitution (IDS) channels, for which maximum-likelihood deco ... Full text Cite

Reed-Muller Codes on BMS Channels Achieve Vanishing Bit-Error Probability for all Rates Below Capacity

Journal article IEEE Transactions on Information Theory · February 1, 2024 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. Its main result is that, for a fixed BMS channel, the family of binary RM code ... Full text Cite

Attacks on Perception-Based Control Systems: Modeling and Fundamental Limits

Journal article IEEE Transactions on Automatic Control · January 1, 2024 We study the performance of perception-based control systems in the presence of attacks and provide methods for modeling and analysis of their resiliency to stealthy attacks on both physical and perception-based sensing. Specifically, we consider a general ... Full text Cite

Data-Driven Neural Polar Decoders for Unknown Channels with and Without Memory

Journal article IEEE Transactions on Information Theory · January 1, 2024 In this work, a novel data-driven methodology for designing neural polar decoders for channels with and without memory is proposed. The methodology is suitable for the case where the channel is given as a "black-box"and the designer has access to the chann ... Full text Cite

Successive Cancellation Decoding of Single Parity-Check Product Codes: Analysis and Improved Decoding

Journal article IEEE Transactions on Information Theory · February 1, 2023 A product code with single parity-check component codes can be described via the tools of a multi-kernel polar code, where the rows of the generator matrix are chosen according to the constraints imposed by the product code construction. Following this obs ... Full text Cite

Belief Propagation for Classical and Quantum Systems: Overview and Recent Results

Journal article IEEE BITS the Information Theory Magazine · December 1, 2022 Full text Cite

An Information-Theoretic Perspective on Successive Cancellation List Decoding and Polar Code Design

Journal article IEEE Transactions on Information Theory · September 1, 2022 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 maximum-likelihood decoding over general binary memoryless symmetric (BMS) chan ... Full text Cite

Adaptive procedures for discriminating between arbitrary tensor-product quantum states

Journal article Physical Review A · July 1, 2022 Discriminating between quantum states is a fundamental task in quantum information theory. Given two quantum states ρ+ and ρ-, the Helstrom measurement distinguishes between them with minimal probability of error. However, finding and experimentally implem ... Full text Cite

Polar Codes for the Deletion Channel: Weak and Strong Polarization

Journal article IEEE Transactions on Information Theory · April 1, 2022 This paper presents the first proof of polarization for the deletion channel with a constant deletion rate and a regular hidden-Markov input distribution. A key part of this work involves representing the deletion channel using a trellis and describing the ... Full text Cite

Reinforcement Learning with Neural Networks for Quantum Multiple Hypothesis Testing

Journal article Quantum · January 1, 2022 Reinforcement learning with neural networks (RLNN) has recently demonstrated great promise for many problems, including some problems in quantum information theory. In this work, we apply RLNN to quantum hypothesis testing and determine the optimal measure ... Full text Cite

Belief propagation with quantum messages for quantum-enhanced classical communications

Journal article Npj Quantum Information · December 1, 2021 For space-based laser communications, when the mean photon number per received optical pulse is much smaller than one, there is a large gap between communications capacity achievable with a receiver that performs individual pulse-by-pulse detection, and th ... Full text Cite

Polar Codes for Channels with Insertions, Deletions, and Substitutions

Journal article IEEE International Symposium on Information Theory Proceedings · July 12, 2021 This paper presents a coding scheme for an insertion deletion substitution channel. We extend a previous scheme for the deletion channel where polar codes are modified by adding 'guard bands' between segments. In the new scheme, each guard band is comprise ... Full text Cite

Trellis BMA: Coded Trace Reconstruction on IDS Channels for DNA Storage

Journal article IEEE International Symposium on Information Theory Proceedings · July 12, 2021 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 is called trace reconstruction. One can reduce the error rate further by intr ... Full text Cite

Hölder Bounds for Sensitivity Analysis in Causal Reasoning

Journal article · July 9, 2021 We examine interval estimation of the effect of a treatment T on an outcome Y given the existence of an unobserved confounder U. Using Hölder's inequality, we derive a set of bounds on the confounding bias |E[Y|T=t]-E[Y|do(T=t)]| based on the degree of unm ... Open Access Link to item Cite

Pruning and Quantizing Neural Belief Propagation Decoders

Journal article IEEE Journal on Selected Areas in Communications · July 1, 2021 We consider near maximum-likelihood (ML) decoding of short linear block codes. In particular, we propose a novel decoding approach based on neural belief propagation (NBP) decoding recently introduced by Nachmani et al. in which we allow a different parity ... Full text Cite

An Information-Theoretic Perspective on Successive Cancellation List Decoding and Polar Code Design

Journal article · March 30, 2021 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 maximum-likelihood decoding over general binary memoryless symmetric (BMS) chan ... Link to item Cite

A Semiclassical Proof of Duality Between the Classical BSC and the Quantum PSC

Journal article · March 16, 2021 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) channels. That result showed that a number of well-known duality results f ... Link to item Cite

Model-Based Machine Learning for Joint Digital Backpropagation and PMD Compensation

Journal article Journal of Lightwave Technology · February 15, 2021 In this article, we propose a model-based machine-learning approach for dual-polarization systems by parameterizing the split-step Fourier method for the Manakov-PMD equation. The resulting method combines hardware-friendly time-domain nonlinearity mitigat ... Full text Cite

Physics-Based Deep Learning for Fiber-Optic Communication Systems

Journal article IEEE Journal on Selected Areas in Communications · January 1, 2021 We propose a new machine-learning approach for fiber-optic communication systems whose signal propagation is governed by the nonlinear Schrödinger equation (NLSE). Our main observation is that the popular split-step method (SSM) for numerically solving the ... Full text Cite

Learned Decimation for Neural Belief Propagation Decoders

Journal article · November 4, 2020 We introduce a two-stage decimation process to improve the performance of neural belief propagation (NBP), recently introduced by Nachmani et al., for short low-density parity-check (LDPC) codes. In the first stage, we build a list by iterating between a c ... Link to item Cite

Kerdock Codes Determine Unitary 2-Designs

Journal article IEEE Transactions on Information Theory · October 1, 2020 The non-linear binary Kerdock codes are known to be Gray images of certain extended cyclic codes of length N = 2m over Z4. We show that exponentiating these Z4-valued codewords by i ≜-1 produces stabilizer states, that are quantum states obtained using onl ... Full text Cite

Successive Cancellation Decoding of Single Parity-Check Product Codes: Analysis and Improved Decoding

Journal article · August 16, 2020 A product code with single parity-check component codes can be described via the tools of a multi-kernel polar code, where the rows of the generator matrix are chosen according to the constraints imposed by the product code construction. Following this obs ... Link to item Cite

On optimality of css codes for transversal t

Journal article IEEE Journal on Selected Areas in Information Theory · August 1, 2020 In order to perform universal fault-tolerant quantum computation, one needs to implement a logical non-Clifford gate. Consequently, it is important to understand codes that implement such gates transversally. In this paper, we adopt an algebraic approach t ... Full text Cite

Revisiting Efficient Multi-Step Nonlinearity Compensation with Machine Learning: An Experimental Demonstration

Journal article Journal of Lightwave Technology · June 15, 2020 Efficient nonlinearity compensation in fiber-optic communication systems is considered a key element to go beyond the 'capacity crunch'. One guiding principle for previous work on the design of practical nonlinearity compensation schemes is that fewer step ... Full text Cite

Adaptive Procedures for Discriminating Between Arbitrary Tensor-Product Quantum States

Journal article IEEE International Symposium on Information Theory Proceedings · June 1, 2020 Discriminating between quantum states is a fundamental task in quantum information theory. Given two quantum states, ρ+ and ρ-, the Helstrom measurement distinguishes between them with minimal probability of error. However, finding an ... Full text Cite

Classical Coding Problem from Transversal T Gates

Journal article IEEE International Symposium on Information Theory Proceedings · June 1, 2020 Universal quantum computation requires the implementation of a logical non-Clifford gate. In this paper, we characterize all stabilizer codes whose code subspaces are preserved under physical T and T† gates. For example, this could enable magic ... Full text Cite

Pruning Neural Belief Propagation Decoders

Journal article IEEE International Symposium on Information Theory Proceedings · June 1, 2020 We consider near maximum-likelihood (ML) decoding of short linear block codes based on neural belief propagation (BP) decoding recently introduced by Nachmani et al.. While this method significantly outperforms conventional BP decoding, the underlying pari ... Full text Cite

Successive Cancellation Inactivation Decoding for Modified Reed-Muller and eBCH Codes

Journal article IEEE International Symposium on Information Theory Proceedings · June 1, 2020 A successive cancellation (SC) decoder with inactivations is proposed as an efficient implementation of SC list (SCL) decoding over the binary erasure channel. The proposed decoder assigns a dummy variable to an information bit whenever it is erased during ... Full text Cite

Logical Clifford Synthesis for Stabilizer Codes

Journal article IEEE Transactions on Quantum Engineering · January 1, 2020 Quantum error-correcting codes are used to protect qubits involved in quantum computation. This process requires logical operators to be translated into physical operators acting on physical quantum states. In this article, we propose a mathematical framew ... Full text Cite

Reinforcement Learning for Channel Coding: Learned Bit-Flipping Decoding

Journal article 2019 57th Annual Allerton Conference on Communication Control and Computing Allerton 2019 · September 1, 2019 In this paper, we use reinforcement learning to find effective decoding strategies for binary linear codes. We start by reviewing several iterative decoding algorithms that involve a decision-making process at each step, including bit-flipping (BF) decodin ... Full text Cite

Near-Optimal Finite-Length Scaling for Polar Codes Over Large Alphabets

Journal article IEEE Transactions on Information Theory · September 2019 Full text Cite

Unifying the Clifford hierarchy via symmetric matrices over rings

Journal article Physical Review A · August 7, 2019 The Clifford hierarchy of unitary operators is a foundational concept for universal quantum computation. It was introduced to show that universal quantum computation can be realized via quantum teleportation, given access to certain standard resources. Whi ... Full text Cite

Understanding Phase Transitions via Mutual Information and MMSE

Journal article · July 3, 2019 The ability to understand and solve high-dimensional inference problems is essential for modern data science. This article examines high-dimensional inference problems through the lens of information theory and focuses on the standard linear model as a can ... Link to item Cite

Learned Belief-Propagation Decoding with Simple Scaling and SNR Adaptation

Journal article IEEE International Symposium on Information Theory Proceedings · July 1, 2019 We consider the weighted belief-propagation (WBP) decoder recently proposed by Nachmani et al. where different weights are introduced for each Tanner graph edge and optimized using machine learning techniques. Our focus is on simple-scaling models that use ... Full text Cite

Kerdock Codes Determine Unitary 2-Designs

Journal article IEEE International Symposium on Information Theory Proceedings · July 1, 2019 The binary non-linear Kerdock codes are Gray images of {\mathbb{Z}-4}-linear Kerdock codes of length N =2m. We show that exponentiating \imath = \sqrt { - 1} by these {\mathbb{Z}-4}-valued codewords produces stabilizer states, which are the comm ... Full text Cite

Polar Codes for the Deletion Channel: Weak and Strong Polarization

Journal article IEEE International Symposium on Information Theory Proceedings · July 1, 2019 This paper presents the first proof of polarization for the deletion channel with a constant deletion rate and a regular hidden-Markov input distribution. A key part of this work involves representing the deletion channel using a trellis and describing the ... Full text Cite

The Replica-Symmetric Prediction for Random Linear Estimation With Gaussian Matrices Is Exact

Journal article IEEE Transactions on Information Theory · April 1, 2019 This paper considers the fundamental limit of random linear estimation for i.i.d. signal distributions and i.i.d. Gaussian measurement matrices. Its main contribution is a rigorous characterization of the asymptotic mutual information (MI) and minimum mean ... Full text Cite

Minimal sets to destroy the k-core in random networks.

Journal article Physical review. E · February 2019 We study the problem of finding the smallest set of nodes in a network whose removal results in an empty k-core, where the k-core is the subnetwork obtained after the iterative removal of all nodes of degree smaller than k. This problem is also known in th ... Full text Cite

Enhancing Capacity of Spatial Multiplexing Systems Using Reconfigurable Cavity-Backed Metasurface Antennas in Clustered MIMO Channels

Journal article IEEE Transactions on Communications · February 1, 2019 We propose a spatial multiplexing system using reconfigurable cavity-backed metasurface antennas. The metasurface antennas consist of a printed cavity with dynamically tunable metamaterial radiators patterned on one side and fed by multiple radio frequency ... Full text Cite

Revisiting multi-step nonlinearity compensation with machine learning

Journal article Iet Conference Publications · January 1, 2019 For the efficient compensation of fiber nonlinearity, one of the guiding principles appears to be: fewer steps are better and more efficient. We challenge this assumption and show that carefully designed multi-step approaches can lead to better performance ... Cite

Adversarial Defense of Image Classification Using a Variational Auto-Encoder

Journal article · December 6, 2018 Deep neural networks are known to be vulnerable to adversarial attacks. This exposes them to potential exploits in security-sensitive applications and highlights their lack of robustness. This paper uses a variational auto-encoder (VAE) to defend against a ... Link to item Cite

ASIC Implementation of Time-Domain Digital Backpropagation with Deep-Learned Chromatic Dispersion Filters

Journal article European Conference on Optical Communication ECOC · November 14, 2018 We consider time-domain digital backpropagation with chromatic dispersion filters jointly optimized and quantized using machine-learning techniques. Compared to the baseline implementations, we show improved BER performance and >40% power dissipation reduc ... Full text Cite

Wideband Time-Domain Digital Backpropagation via Subband Processing and Deep Learning

Journal article European Conference on Optical Communication ECOC · November 14, 2018 We propose a low-complexity sub-banded DSP architecture for digital backpropagation where the walk-off effect is compensated using simple delay elements. For a simulated 96-Gbaud signal and 2500 km optical link, our method achieves a 2.8 dB SNR improvement ... Full text Cite

Synthesis of Logical Clifford Operators via Symplectic Geometry

Journal article IEEE International Symposium on Information Theory Proceedings · August 15, 2018 Quantum error-correcting codes can be used to protect qubits involved in quantum computation. This requires that logical operators acting on protected qubits be translated to physical operators (circuits) acting on physical quantum states. We propose a mat ... Full text Cite

Deep Learning of the Nonlinear Schrödinger Equation in Fiber-Optic Communications

Journal article IEEE International Symposium on Information Theory Proceedings · August 15, 2018 An important problem in fiber-optic communications is to invert the nonlinear Schrödinger equation in real time to reverse the deterministic effects of the channel. Interestingly, the popular split-step Fourier method (SSFM) leads to a computation graph th ... Full text Cite

Decoding Reed-Muller Codes Using Minimum- Weight Parity Checks

Journal article IEEE International Symposium on Information Theory Proceedings · August 15, 2018 Reed-Muller (RM) codes exhibit good performance under maximum-likelihood (ML) decoding due to their highly-symmetric structure. In this paper, we explore the question of whether the code symmetry of RM codes can also be exploited to achieve near-ML perform ... Full text Cite

On Low-Complexity Decoding of Product Codes for High-Throughput Fiber-Optic Systems

Journal article International Symposium on Turbo Codes and Iterative Information Processing Istc · July 2, 2018 We study low-complexity iterative decoding algorithms for product codes. We revisit two algorithms recently proposed by the authors based on bounded distance decoding (BDD) of the component codes that improve the performance of conventional iterative BDD ( ... Full text Cite

What can machine learning teach us about communications?

Journal article 2018 IEEE Information Theory Workshop Itw 2018 · July 2, 2018 Rapid improvements in machine learning over the past decade are beginning to have far-reaching effects. For communications, engineers with limited domain expertise can now use off-the-shelf learning packages to design high-performance systems based on simu ... Full text Cite

Approaching Miscorrection-Free Performance of Product Codes with Anchor Decoding

Journal article IEEE Transactions on Communications · July 1, 2018 Product codes (PCs) protect a 2-D array of bits using short component codes. Assuming transmission over the binary symmetric channel, the decoding is commonly performed by iteratively applying bounded-distance decoding to the component codes. For this codi ... Full text Cite

Nonlinear interference mitigation via deep neural networks

Journal article Optics Infobase Conference Papers · January 1, 2018 A neural-network-based approach is presented to efficiently implement digital backpropagation (DBP). For a 32×100 km fiber-optic link, the resulting “learned“ DBP significantly reduces the complexity compared to conventional DBP implementations. ... Full text Cite

Approaching Miscorrection-free Performance of Product and Generalized Product Codes

Journal article · November 21, 2017 Product codes (PCs) protect a two-dimensional array of bits using short component codes. Assuming transmission over the binary symmetric channel, the decoding is commonly performed by iteratively applying bounded-distance decoding to the component codes. F ... Link to item Cite

Miscorrection-free Decoding of Staircase Codes

Journal article European Conference on Optical Communication ECOC · September 21, 2017 We propose a novel decoding algorithm for staircase codes which reduces the effect of undetected component code miscorrections. The algorithm significantly improves performance, while retaining a low-complexity implementation suitable for high-speed optica ... Full text Cite

Cycle-expansion method for the Lyapunov exponent, susceptibility, and higher moments.

Journal article Physical review. E · September 2017 Lyapunov exponents characterize the chaotic nature of dynamical systems by quantifying the growth rate of uncertainty associated with the imperfect measurement of initial conditions. Finite-time estimates of the exponent, however, experience fluctuations d ... Full text Open Access Cite

Approaching Capacity at High Rates with Iterative Hard-Decision Decoding

Journal article IEEE Transactions on Information Theory · September 1, 2017 A variety of low-density parity-check (LDPC) ensembles have now been observed to approach capacity with message-passing decoding. However, all of them use soft (i.e., non-binary) messages and a posteriori probability decoding of their component codes. In t ... Full text Cite

Reed-muller codes achieve capacity on erasure channels

Journal article IEEE Transactions on Information Theory · July 1, 2017 We introduce a new approach to proving that a sequence of deterministic linear codes achieves capacity on an erasure channel under maximum a posteriori decoding. Rather than relying on the precise structure of the codes, our method exploits code symmetry. ... Full text Cite

On the Performance of Block Codes over Finite-State Channels in the Rare-Transition Regime

Journal article IEEE Transactions on Communications · November 1, 2015 Contemporary wireless networks are tasked with supporting different connection profiles, including real-time traffic and delay-sensitive communications. This creates a need to better understand the fundamental limits of forward error correction in non-asym ... Full text Cite

Delay-Sensitive Communication over Fading Channels: Queueing Behavior and Code Parameter Selection

Journal article IEEE Transactions on Vehicular Technology · September 1, 2015 This paper examines the queueing performance of communication systems that transmit encoded data over unreliable channels. A fading formulation suitable for wireless mobile applications is considered, where errors are caused by a discrete channel with corr ... Full text Cite

Threshold saturation for spatially coupled LDPC and LDGM codes on BMS channels

Journal article IEEE Transactions on Information Theory · December 1, 2014 Featured Publication Spatially-coupled low-density parity-check (LDPC) codes, which were first introduced as LDPC convolutional codes, have been shown to exhibit excellent performance under low-complexity belief-propagation decoding. This phenomenon is now termed threshold sat ... Full text Cite

Convergence of weighted min-sum decoding via dynamic programming on trees

Journal article IEEE Transactions on Information Theory · January 1, 2014 Applying the max-product (and sum-product) algorithms to loopy graphs is now quite popular for best assignment problems. This is largely due to their low computational complexity and impressive performance in practice. Still, there is no general understand ... Full text Cite

A simple proof of maxwell saturation for coupled scalar recursions

Journal article IEEE Transactions on Information Theory · January 1, 2014 Featured Publication Low-density parity-check (LDPC) convolutional codes (or spatially coupled codes) were recently shown to approach capacity on the binary erasure channel (BEC) and binary-input memoryless symmetric channels. The mechanism behind this spectacular performance ... Full text Cite

First-passage time and large-deviation analysis for erasure channels with memory

Journal article IEEE Transactions on Information Theory · August 28, 2013 This paper considers the performance of digital communication systems transmitting messages over finite-state erasure channels with memory. Information bits are protected from channel erasures using error-correcting codes; successful receptions of codeword ... Full text Cite

Code design for the noisy Slepian-Wolf problem

Journal article IEEE Transactions on Communications · June 1, 2013 We consider a noisy Slepian-Wolf problem where two correlated sources are separately encoded (using codes of fixed rate) and transmitted over two independent binary memoryless symmetric channels. The capacity of each channel is characterized by a single pa ... Full text Cite

Code-rate selection, queueing behavior, and the correlated erasure channel

Journal article IEEE Transactions on Information Theory · January 7, 2013 This paper considers the relationship between code-rate selection and queueing performance for communication systems subject to time-varying channel conditions. While error-correcting codes offer protection against channel uncertainties, there exists a nat ... Full text Cite

Verification decoding of high-rate ldpc codes with applications in compressed sensing

Journal article IEEE Transactions on Information Theory · July 23, 2012 This paper considers the performance of (j,k)-regular low-density parity-check (LDPC) codes with message-passing (MP) decoding algorithms in the high-rate regime. In particular, we derive the high-rate scaling law for MP decoding of LDPC codes on the binar ... Full text Cite

Joint decoding of LDPC codes and finite-state channels via linear-programming

Journal article IEEE Journal on Selected Topics in Signal Processing · December 1, 2011 This paper considers the joint-decoding problem for finite-state channels (FSCs) and low-density parity-check (LDPC) codes. In the first part, the linear-programming (LP) decoder for binary linear codes is extended to perform joint-decoding of binary-input ... Full text Cite

Analysis of verification-based decoding on the q-ary symmetric channel for large q

Journal article IEEE Transactions on Information Theory · October 1, 2011 A new verification-based message-passing decoder for low-density parity-check (LDPC) codes is introduced and analyzed for the q-ary symmetric channel (q-SC). Rather than passing messages consisting of symbol probabilities, this decoder passes lists of poss ... Full text Cite

On multiple decoding attempts for Reed - Solomon codes: A rate-distortion approach

Journal article IEEE Transactions on Information Theory · February 1, 2011 One popular approach to soft-decision decoding of Reed - Solomon (RS) codes is based on using multiple trials of a simple RS decoding algorithm in combination with erasing or flipping a set of symbols or bits in each trial. This paper presents a framework ... Full text Cite

Joint physical layer coding and network coding for bidirectional relaying

Journal article IEEE Transactions on Information Theory · November 1, 2010 We consider a communication system where two transmitters wish to exchange information through a central relay. The transmitter and relay nodes exchange data over synchronized, average power constrained additive white Gaussian noise channels with a real in ... Full text Cite

Girth-10 LDPC codes based on 3-D cyclic lattices

Journal article IEEE Transactions on Vehicular Technology · March 1, 2008 In this paper, we propose a new method based on combinatorial designs for constructing high-girth low-density parity-check (LDPC) codes. We use a 3-D lattice to generate balanced incomplete block designs based on planes and lines in the lattice. This gives ... Full text Cite

Accumulate-repeat-accumulate codes: Capacity-achieving ensembles of systematic codes for the erasure channel with bounded complexity

Journal article IEEE Transactions on Information Theory · June 1, 2007 This paper introduces ensembles of systematic accumulaterepeataccumulate (ARA) codes which asymptotically achieve capacity on the binary erasure channel (BEC) with bounded complexity, per information bit, of encoding and decoding. It also introduces symmet ... Full text Cite

Implementing interference cancellation to increase the EV-DO Rev A reverse link capacity

Journal article IEEE Communications Magazine · February 1, 2006 This article provides the principles and practice of how interference cancellation can be implemented on the EV-DO Rev A reverse link. It is shown that applying interference cancellation to CDMA achieves the multiple access channel sum rate capacity for ei ... Full text Cite