Conference2025 13th International Symposium on Topics in Coding Istc 2025 · January 1, 2025
Due to code degeneracy and the graph structure of quantum low-density parity-check (QLDPC) codes, the performance of conventional belief propagation (BP) decoding can be poor. Recently, belief propagation guided decimation (BPGD) has shown promise to comba ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · January 1, 2025
Quantum low-density parity-check (LDPC) codes based on the hypergraph product (HGP) provide a promising approach to achieving fault-tolerant quantum computation with small overheads. In this work, we investigate the performance of long HGP codes whose comp ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · January 1, 2025
This work exploits the product structure of surface codes to improve their belief propagation (BP) decoding performance. To promote BP convergence, we sparsify the original surface code graph with respect to its topological product structure to break its d ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · January 1, 2025
We provide a general framework for bounding the block error threshold of a linear code C ⊆ F2N over the erasure channel in terms of its bit error threshold. Our approach relies on understanding the minimum support weight of any r-dime ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · January 1, 2025
This paper provides an elementary, self-contained analysis of diffusion-based sampling methods for generative modeling. In contrast to existing approaches that rely on continuous-time processes and then discretize, our treatment works directly with discret ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · January 1, 2025
This paper introduces a neural polar decoder (NPD) for deletion channels with a constant deletion rate. Existing polar decoders for deletion channels exhibit high computational complexity of O(N4 log N), where N is the block length. This limits ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · January 1, 2025
The question of whether Reed-Muller (RM) codes achieve capacity on binary memoryless symmetric (BMS) channels has drawn attention since it was resolved positively for the binary erasure channel by Kudekar et al. in 2016. In 2021, Reeves and Pfister extende ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · January 1, 2024
In the quantum compression scheme proposed by Schumacher, Alice compresses a message that Bob decompresses. In that approach, there is some probability of failure and, even when successful, some distortion of the state. For sufficiently large blocklengths, ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · January 1, 2024
Quantum low-density parity-check (QLDPC) codes have emerged as a promising technique for quantum error correction. A variety of decoders have been proposed for QLDPC codes and many utilize belief propagation (BP) decoding in some fashion. However, the use ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · January 1, 2024
In this work, we explore the enhancement of polar codes for channels with memory, focusing on achieving low decoding complexity and optimizing input distributions for maximum transmission rates. Polar codes are known for their efficient decoding, exhibitin ...
Full textCite
Conference2024 60th Annual Allerton Conference on Communication Control and Computing Allerton 2024 · January 1, 2024
Quantum low-density parity-check (LDPC) codes are a promising family of quantum error-correcting codes for fault tolerant quantum computing with low overhead. Decoding quantum LDPC codes on quantum erasure channels has received more attention recently due ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · January 1, 2023
Recently, the authors showed that Reed-Muller (RM) codes achieve capacity on binary memoryless symmetric (BMS) channels with respect to bit error rate. This paper extends that work by showing that RM codes defined on non-binary fields, known as generalized ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · January 1, 2023
In this work, a novel data-driven methodology for designing polar codes 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 channel for generating observations of its inputs an ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · January 1, 2023
This paper considers the design and decoding of polar codes for general classical-quantum (CQ) channels. It focuses on decoding via belief-propagation with quantum messages (BPQM) and, in particular, the idea of paired-measurement BPQM (PM-BPQM) decoding. ...
Full textCite
Conference2022 IEEE Information Theory Workshop Itw 2022 · January 1, 2022
Belief propagation (BP) is a classical algorithm that approximates the marginal distribution associated with a factor graph by passing messages between adjacent nodes in the graph. It gained popularity in the 1990's as a powerful decoding algorithm for LDP ...
Full textCite
ConferenceProceedings of Machine Learning Research · January 1, 2022
This work focuses on resiliency of learning-enabled perception-based controllers for nonlinear dynamical systems. We consider systems equipped with an end-to-end controller, mapping the perception (e.g., camera images) and sensor measurements to control in ...
Cite
Conference · October 27, 2021
Featured Publication
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 ...
Link to itemCite
ConferenceIEEE International Symposium on Information Theory Proceedings · July 12, 2021
In 2018, Renes [IEEE Trans. Inf. Theory, vol. 64, no. 1, pp. 577-592 (2018)] developed a general theory of channel duality for classical-input quantum-output channels. His result shows that a number of well-known duality results for linear codes on the bin ...
Full textCite
Conference2021 Conference on Lasers and Electro-Optics, CLEO 2021 - Proceedings · May 1, 2021
We design a quantum joint-detection receiver for binary-phase-shift-keyed optical communications using belief propagation with quantum messages. For an exemplary tree code, the receiver attains the block-Helstrom limit in discriminating the codewords and a ...
Cite
Conference2021 Conference on Lasers and Electro Optics CLEO 2021 Proceedings · May 1, 2021
We design a quantum joint-detection receiver for binary-phase-shift-keyed optical communications using belief propagation with quantum messages. For an exemplary tree code, the receiver attains the block-Helstrom limit in discriminating the codewords and a ...
Full textCite
ConferenceICASSP IEEE International Conference on Acoustics Speech and Signal Processing Proceedings · January 1, 2021
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 paritycheck (LDPC) codes. In the first stage, we build a list by iterating between a co ...
Full textCite
ConferenceOptics Infobase Conference Papers · January 1, 2021
We design a quantum joint-detection receiver for binary-phase-shift-keyed optical communications using belief propagation with quantum messages. For an exemplary tree code, the receiver attains the block-Helstrom limit in discriminating the codewords and a ...
Cite
ConferenceSpcom 2020 International Conference on Signal Processing and Communications · July 1, 2020
Successive cancellation list decoding of polar codes provides very good performance for short to moderate block lengths. However, the list size required to approach the performance of maximum-likelihood decoding is still not well understood theoretically. ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · June 1, 2020
Quantum technologies are maturing by the day and their near-term applications are now of great interest. Deep-space optical communication involves transmission over the pure-state classical-quantum channel. For optimal detection, a joint measurement on all ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · June 1, 2020
The recursive projection-aggregation (RPA) decoding algorithm for Reed-Muller (RM) codes was recently introduced by Ye and Abbe. We show that the RPA algorithm is closely related to (weighted) belief-propagation (BP) decoding by interpreting it as a messag ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · June 1, 2020
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 reinforcement learning to quantum hypothesis testing, where one desi ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · June 1, 2020
Reed-Muller (RM) codes, a classical family of codes known for their elegant algebraic structure, have recently been shown to achieve capacity under maximum-likelihood (ML) decoding on the binary erasure channel and this has rekindled interest in their effi ...
Full textCite
ConferenceOptics Infobase Conference Papers · January 1, 2020
We propose a model-based machine-learning approach for polarization-multiplexed systems by parameterizing the split-step method for the Manakov-PMD equation. This approach performs hardware-friendly DBP and distributed PMD compensation with performance clo ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · August 15, 2018
This paper focuses on the mutual information and minimum mean-squared error (MMSE) as a function a matrix-valued signal-to-noise ratio (SNR) for a linear Gaussian channel with arbitrary input distribution. As shown by Lamarca, the mutual-information is a c ...
Full textCite
Conference2018 Optical Fiber Communications Conference and Exposition Ofc 2018 Proceedings · June 13, 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. ...
Cite
ConferenceIEEE Transactions on Information Theory · March 1, 2017
An upper bound on the feedback capacity of unifilar finite-state channels (FSCs) is derived. A new technique, called the Q-context mapping, is based on a construction of a directed graph that is used for a sequential quantization of the receiver's output s ...
Full textCite
Conference2016 IEEE International Conference on the Science of Electrical Engineering Icsee 2016 · January 4, 2017
Upper and lower bounds on the feedback capacity of unifilar finite-state channels (FSCs) are derived. The upper bound is derived using a new technique, called the Q-contexts, which is based on a construction of a directed graph that is used to quantize rec ...
Full textCite
Conference2016 IEEE Information Theory Workshop Itw 2016 · October 21, 2016
Recently, sequences of error-correcting codes with doubly-transitive permutation groups were shown to achieve capacity on erasure channels under symbol-wise maximum a posteriori (MAP) decoding. From this, it follows that Reed-Muller and primitive narrow-se ...
Full textCite
ConferenceInternational Symposium on Turbo Codes and Iterative Information Processing Istc · October 17, 2016
Generalized product codes (GPCs) are extensions of product codes (PCs) where coded bits are protected by two component codes but not necessarily arranged in a rectangular array. It has recently been shown that there exists a large class of deterministic GP ...
Full textCite
ConferenceInternational Symposium on Turbo Codes and Iterative Information Processing Istc · October 17, 2016
In this paper, we consider the rate-loss problem for spatially-coupled LDPC (SC-LDPC) codes on the binary erasure channel. Although SC-LDPC codes have good noise thresholds under belief-propagation (BP) decoding, they also suffer a rate-loss due to termina ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · August 10, 2016
Several authors have proposed spatially-coupled (or convolutional-like) variants of product codes (PCs). In this paper, we focus on a parametrized family of generalized PCs that recovers some of these codes (e.g., staircase and block-wise braided codes) as ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · August 10, 2016
The quantum erasure channel is the simplest example of a quantum communication channel and its information capacity is known precisely. The subclass of quantum error-correcting codes called stabilizer codes is known to contain capacity-achieving sequences ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · August 10, 2016
The question whether RM codes are capacity-achieving is a long-standing open problem in coding theory that was recently answered in the affirmative for transmission over erasure channels [1], [2]. Remarkably, the proof does not rely on specific properties ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · August 10, 2016
A single-letter upper bound on the feedback capacity of a unifilar finite-state channel is derived. The upper bound is tight for all cases where the feedback capacity is known. Its efficiency is also demonstrated by direct application of the bound on the d ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · August 10, 2016
For any prime power q, Mori and Tanaka introduced a family of q-ary polar codes based on q by q Reed-Solomon polarization kernels. For transmission over a q-ary erasure channel, they also derived a closed-form recursion for the erasure probability of each ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · August 10, 2016
Featured Publication
This paper considers the fundamental limit of compressed sensing 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-squar ...
Full textCite
Conference2016 Optical Fiber Communications Conference and Exhibition Ofc 2016 · August 9, 2016
We analyze deterministically constructed (i.e., non-ensemble-based) codes in the waterfall and error floor region. The analysis directly applies to several FEC classes proposed for high-speed OTNs such as staircase and braided codes. ...
Full textCite
ConferenceProceedings of the Annual ACM Symposium on Theory of Computing · June 19, 2016
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 textCite
Conference2015 53rd Annual Allerton Conference on Communication Control and Computing Allerton 2015 · April 4, 2016
The focus of this article is on low-complexity capacity-achieving coding schemes for write-once memory (WOM) systems. The construction is based on spatially-coupled compound LDGM/LDPC codes. Both noiseless systems and systems with read errors are considere ...
Full textCite
Conference2015 53rd Annual Allerton Conference on Communication Control and Computing Allerton 2015 · April 4, 2016
This work considers the compressed sensing (CS) of i.i.d. signals with sparse measurement matrices and belief-propagation (BP) reconstruction. In general, BP reconstruction for CS requires the passing of messages that are distributions over the real number ...
Full textCite
Conference2015 Information Theory and Applications Workshop Ita 2015 Conference Proceedings · October 27, 2015
Product codes were introduced by Elias in 1954 and generalized by Tanner in 1981. Recently, a number of generalized product codes have been proposed for forward error-correction in high-speed optical communication. In practice, these codes are decoded by i ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · September 28, 2015
The limits of treating interference as noise are studied for the canonical two-user symmetric Gaussian interference channel. A two-step approach is proposed for finding approximately optimal input distributions in the high signal-to-noise ratio (SNR) regim ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · September 28, 2015
Arikan introduced polar codes in 2009 and proved that they achieve the symmetric capacity, under low-complexity successive cancellation decoding, of any binary-input discrete memoryless channel. Arikan's construction is based on the Kronecker product of 2- ...
Full textCite
ConferenceConference on Optical Fiber Communication Technical Digest Series · June 10, 2015
We discuss the optimization of staircase code parameters based on density evolution. An extension of the original code construction is proposed, leading to codes with steeper waterfall performance. ...
Full textCite
ConferenceOptical Fiber Communication Conference Ofc 2015 · March 13, 2015
We discuss the optimization of staircase code parameters based on density evolution. An extension of the original code construction is proposed, leading to codes with steeper waterfall performance. ...
Cite
ConferenceOptical Fiber Communication Conference, OFC 2015 · January 1, 2015
We discuss the optimization of staircase code parameters based on density evolution. An extension of the original code construction is proposed, leading to codes with steeper waterfall performance. ...
Cite
Conference2014 31th Ursi General Assembly and Scientific Symposium Ursi Gass 2014 · October 17, 2014
This paper uses examples to illustrate the ongoing transition in spatially-coupled coding from theory to practice. In the first example, we find that spatially-coupled codes have already been implemented by two different companies for 100 Gb/s optical comm ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · January 1, 2014
We propose a class of lattices constructed using Construction D where the underlying linear codes are nested binary spatially-coupled low-density parity-check codes (SC-LDPC) codes with uniform left and right degrees. By leveraging recent results on the op ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · January 1, 2014
For compound LDGM/LDPC codes with maximum a posteriori (MAP) processing, Wainwright and Martinian showed that the information-theoretic rate regions of the Wyner-Ziv (WZ) and Gelfand-Pinsker (GP) problems are achievable. For the same ensemble, these rates ...
Full textCite
Conference2013 IEEE Information Theory Workshop Itw 2013 · December 1, 2013
We consider a class of lattices built using Construction A, where the underlying code is a non-binary spatially-coupled low density parity check code. We refer to these lattices as spatially-coupled LDA (SCLDA) lattices. SCLDA lattices can be constructed o ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · January 1, 2013
For an arbitrary binary cycle code, we show that sum-product algorithm (SPA) decoding after infinitely many iterations equals symbolwise graph-cover decoding. We do this by characterizing the Bethe free energy function of the underlying normal factor graph ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · January 1, 2013
Convolutional (or spatially-coupled) low-density parity-check (LDPC) codes have now been shown to approach capacity for a variety of problems. Yet, most of these results require sequences of regular LDPC ensembles with increasing variable and check degrees ...
Full textCite
ConferenceProceedings IEEE Global Communications Conference Globecom · January 1, 2013
Designing error-correcting codes for optical communication is challenging mainly because of the high data rates (e.g., 100 Gbps) required and the expectation of low latency, low overhead (e.g., 7% redundancy), and large coding gain (e.g., >9dB). Although s ...
Full textCite
ConferenceInternational Symposium on Turbo Codes and Iterative Information Processing Istc · December 14, 2012
Low-density parity-check (LDPC) convolutional codes (or spatially-coupled codes) have been shown to approach capacity on the binary erasure channel (BEC) and binary-input memoryless symmetric channels. The mechanism behind this spectacular performance is t ...
Full textCite
ConferenceInternational Symposium on Turbo Codes and Iterative Information Processing Istc · December 14, 2012
We consider a multi-user wireless network in which each user has one packet of information to transmit to a central receiver. We study an uncoordinated paradigm where the users send their packet a random number of times according to a probability distribut ...
Full textCite
Conference2012 IEEE Information Theory Workshop Itw 2012 · December 1, 2012
Convolutional low-density parity-check (LDPC) codes (or spatially-coupled codes) have now been shown to achieve capacity on binary-input memoryless symmetric channels. The principle behind this surprising result is the threshold-saturation phenomenon, whic ...
Full textCite
Conference2012 50th Annual Allerton Conference on Communication Control and Computing Allerton 2012 · December 1, 2012
As the mobile application landscape expands, wireless networks are tasked with supporting different connection profiles, including real-time traffic and delay-sensitive communications. Among many ensuing engineering challenges is the need to better underst ...
Full textCite
ConferenceIEEE International Conference on Communications · December 1, 2012
Recently, it has been observed that terminated low-density-parity-check (LDPC) convolutional codes (or spatially-coupled codes) appear to approach the capacity universally across the class of binary memoryless channels. This is facilitated by the 'threshol ...
Full textCite
Conference2012 50th Annual Allerton Conference on Communication Control and Computing Allerton 2012 · December 1, 2012
Low-density parity-check (LDPC) convolutional codes have been shown to exhibit excellent performance under low-complexity belief-propagation decoding [1], [2]. This phenomenon is now termed threshold saturation via spatial coupling. The underlying principl ...
Full textCite
Conference2012 46th Annual Conference on Information Sciences and Systems Ciss 2012 · November 12, 2012
This article considers the performance of random block codes over the Gilbert-Elliott channel and characterizes the queueing performance under maximum-likelihood decoding. The probability of decoding failure is upper bounded using an approximation that wor ...
Full textCite
ConferenceProceedings of 6th European Conference on Antennas and Propagation Eucap 2012 · July 2, 2012
Volumetric distributions of receiving antennas are investigated for their ability to mitigate aliasing and enhance the direction of arrival (DOA) estimation. Surface and volumetric distributions in canonical arrangements (cubic and spherical) of elements a ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · January 1, 2012
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 (APP) decoding of their component codes ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · January 1, 2012
A fundamental connection between the belief propagation (BP) and maximum a posteriori (MAP) decoding thresholds was derived by Méasson, Montanari, and Urbanke using the area theorem for extrinsic information transfer (EXIT) curves. This connection allows t ...
Full textCite
Conference2011 49th Annual Allerton Conference on Communication Control and Computing Allerton 2011 · December 1, 2011
We consider transmission of two independent and separately encoded sources over a two-user binary-input Gaussian multiple-access channel. The channel gains are assumed to be unknown at the transmitter and the goal is to design an encoder-decoder pair that ...
Full textCite
Conference2011 49th Annual Allerton Conference on Communication Control and Computing Allerton 2011 · December 1, 2011
This article examines the performance of a digital communication link from a large deviations perspective. The underlying physical environment is modeled as an erasure channel with memory. Information is shielded from symbol erasures using error-correcting ...
Full textCite
ConferenceIEEE International Conference on Communications · January 1, 2011
In this paper, we introduce an efficient method for the joint linear-programming (LP) decoding of low-density parity-check (LDPC) codes and finite-state channels (FSCs). In particular, we extend the approach of iterative approximate LP decoding proposed by ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · January 1, 2011
We consider a noisy Slepian-Wolf problem where two correlated sources are separately encoded and transmitted over two independent binary memoryless symmetric channels. Each channel capacity is assumed to be characterized by a single parameter which is not ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · January 1, 2011
This paper considers the queueing performance of a communication system that transmits BCH-coded data over the correlated-error channel first studied by Gilbert and Elliott in the 1960s. For some arrival processes, one can join the queue length and channel ...
Full textCite
Conference2010 48th Annual Allerton Conference on Communication Control and Computing Allerton 2010 · December 1, 2010
Recently, it was observed that spatially-coupled LDPC code ensembles approach the Shannon capacity for a class of binary-input memoryless symmetric (BMS) channels. The fundamental reason for this was attributed to a threshold saturation phenomena derived i ...
Full textCite
Conference2010 48th Annual Allerton Conference on Communication Control and Computing Allerton 2010 · December 1, 2010
This article explores the relation between queueing behavior and code-rate selection for digital communication over correlated erasure channels. The focus is on non-asymptotic system analysis, with finite block-lengths and non-vanishing probabilities of de ...
Full textCite
Conference6th International Symposium on Turbo Codes and Iterative Information Processing Istc 2010 · November 29, 2010
A new message-passing (MP) method is considered for the matrix completion problem associated with recommender systems. We attack the problem using a (generative) factor graph model that is related to a probabilistic low-rank matrix factorization. Based on ...
Full textCite
Conference6th International Symposium on Turbo Codes and Iterative Information Processing Istc 2010 · November 29, 2010
We consider the problem of transmitting correlated data after independent encoding to a central receiver through orthogonal channels. We assume that the channel state information is not known at the transmitter. The receiver has access to both the source c ...
Full textCite
Conference6th International Symposium on Turbo Codes and Iterative Information Processing Istc 2010 · November 29, 2010
Applying the max-product (and belief-propagation) algorithms to loopy graphs is now quite popular for constraint satisfaction problems. This is largely due to their low computational complexity and impressive performance in practice. Still, there is no gen ...
Full textCite
ConferenceIEEE Information Theory Workshop 2010 Itw 2010 · July 27, 2010
This paper considers the relationship between coderate selection and queueing performance for communication systems with time-varying parameters. While error-correcting codes offer protection against channel unreliability, there is a tradeoff between the e ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · January 1, 2010
Algorithms based on multiple decoding attempts of Reed-Solomon (RS) codes have recently attracted new attention. Choosing decoding candidates based on rate-distortion theory, as proposed previously by the authors, currently provides the best performance-ve ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · January 1, 2010
In this paper, the linear programming (LP) decoder for binary linear codes, introduced by Feldman, et al. is extended to joint-decoding of binary-input finite-state channels. In particular, we provide a rigorous definition of LP joint-decoding pseudo-codew ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · January 1, 2010
This paper considers the queueing performance of a system that transmits coded data over a time-varying erasure channel. In our model, the queue length and channel state together form a Markov chain that depends on the system parameters. This gives a frame ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · January 1, 2010
An LDPC code is proposed for flash memories based on rank modulation. In contrast to previous approaches, this enables the use of long ECCs with fixed-length modulation codes. For ECC design, the rank modulation scheme is treated as part of an equivalent c ...
Full textCite
Conference2009 47th Annual Allerton Conference on Communication Control and Computing Allerton 2009 · December 1, 2009
Recently, a number of authors have proposed decoding schemes for Reed-Solomon (RS) codes based on multiple trials of a simple RS decoding algorithm. In this paper, we present a rate-distortion (R-D) approach to analyze these multiple-decoding algorithms fo ...
Full textCite
Conference2009 47th Annual Allerton Conference on Communication Control and Computing Allerton 2009 · December 1, 2009
In this paper, we consider a few iterative decoding schemes for the joint source-channel coding of correlated sources. Specifically, we consider the joint source-channel coding of two erasure correlated sources with transmission over different erasure chan ...
Full textCite
Conference2009 47th Annual Allerton Conference on Communication Control and Computing Allerton 2009 · December 1, 2009
In this paper, we consider modulation codes for practical multilevel flash memory storage systems with q cell levels. Instead of maximizing the lifetime of the device [7], [1], [2], [4], we maximize the average amount of information stored per cell-level, ...
Full textCite
ConferenceConference Record Asilomar Conference on Signals Systems and Computers · January 1, 2009
Recently, there has been a growing interest in physical-layer network-coding techniques that facilitate information transfer in wireless relay networks. Physical-layer networkcoding techniques take advantage of the additive nature of wireless signals by al ...
Full textCite
Conference2008 5th International Symposium on Turbo Codes and Related Topics Turbocoding · December 29, 2008
Following the work of Méasson, Montanari, and Urbanke, this paper considers the maximum a posteriori (MAP) decoding thresholds of three iterative decoding systems. First, irregular repeat-accumulate (IRA) and accumulate-repeat-accumulate (ARA) code ensembl ...
Full textCite
Conference2008 Information Theory and Applications Workshop Conference Proceedings Ita · October 6, 2008
Compressed sensing (CS) is a relatively new area of signal processing and statistics that focuses on signal reconstruction from a small number of linear (e.g., dot product) measurements. In this paper, we analyze CS using tools from coding theory because C ...
Full textCite
ConferenceIEEE Journal on Selected Areas in Communications · February 1, 2008
This paper investigates the joint iterative decoding of low-density parity-check (LDPC) codes and channels with memory. Sequences of irregular LDPC codes are presented that achieve, under joint iterative decoding, the symmetric information rate of a class ...
Full textCite
ConferenceGlobecom IEEE Global Telecommunications Conference · December 1, 2007
We discuss and analyze a list-message-passing decoder with verification for low-density parity-check (LDPC) codes on the q-ary symmetric channel (q-SC). Rather than passing messages consisting of symbol probabilities, we pass lists of possible symbols and ...
Full textCite
ConferenceIEEE Transactions on Information Theory · April 1, 2007
By examining the achievable rates of a multistage decoding system on stationary ergodic channels, we derive lower bounds on the mutual information rate corresponding to independent and uniformly distributed (i.u.d.) inputs, also referred to as the i.u.d. i ...
Full textCite
ConferenceIEEE International Symposium on Information Theory Proceedings · January 1, 2007
We present two upper bounds on the capacity of the i.i.d. binary deletion channel, where each bit is independently deleted with a fixed probability d. The first can be numerically evaluated for any fixed d. The second provides an asymptotic upper bound as ...
Full textCite
ConferenceGlobecom IEEE Global Telecommunications Conference · December 1, 2006
A general framework is provided to characterize the link level performance of CDMA systems with interference cancellation. This closed-form residual power analysis accounts for the impact of channel estimation errors due to SNR, channel variation, chip asy ...
Full textCite
ConferenceIEEE Convention of Electrical and Electronics Engineers in Israel Proceedings · December 1, 2006
The paper introduces ensembles of accumulate-repeat-accumulate (ARA) codes which asymptotically achieve capacity on the binary erasure channel (BEC) with bounded complexity (per information bit). It also introduces symmetry properties which play a central ...
Full textCite
ConferenceProceedings of the IEEE Itsoc Information Theory Workshop 2005 on Coding and Complexity Itw2005 · December 1, 2005
In this paper, we consider the finite-length performance of a capacity-achieving sequence of irregular repeat-accumulate (IRA) code ensembles. We focus on a sequence of bit-regular ensembles with degree 3 which was shown to achieve capacity with bounded co ...
Full textCite
ConferenceIEEE Transactions on Information Theory · July 1, 2005
We present two sequences of ensembles of non-systematic irregular repeat-accumulate (IRA) codes which asymptotically (as their block length tends to infinity) achieve capacity on the binary erasure channel (BEC) with bounded complexity per information bit. ...
Full textCite
Conference43rd Annual Allerton Conference on Communication Control and Computing 2005 · January 1, 2005
The paper introduces ensembles of accumulate-repeat-accumulate (ARA) codes which asymptotically achieve capacity on the binary erasure channel (BEC) with bounded complexity per information bit. It also introduces symmetry properties which play a central ro ...
Cite
ConferenceIEEE Convention of Electrical and Electronics Engineers in Israel Proceedings · December 1, 2004
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the binary erasure channel (BEC) with bounded complexity. This is in contrast to al ...
Cite
ConferenceIEEE International Symposium on Information Theory Proceedings · January 1, 2004
We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the binary erasure channel (BEC) with bounded complexity. This is in contrast to al ...
Full textCite
ConferenceIEEE Transactions on Communications · December 1, 2003
For a discrete-time, binary-input Gaussian channel with finite intersymbol interference, we prove that reliable communication can be achieved if and only if Eb/No > log 2/Gopt, for some constant Gopt that depends ...
Full textCite
ConferenceIEEE Transactions on Information Theory · September 1, 2003
We design multilevel coding (MLC) and bit-interleaved coded modulation (BICM) schemes based on low-density parity-check (LDPC) codes. The analysis and optimization of the LDPC component codes for the MLC and BICM schemes are complicated because, in general ...
Full textCite
ConferenceIEEE Transactions on Information Theory · June 1, 2003
Until the analysis of Repeat Accumulate codes by Divsalar et al., few people would have guessed that simple rate-1 codes could play a crucial role in the construction of "good" binary codes. In this paper, we will construct "good" binary linear block codes ...
Full textCite
Conference2003 IEEE Conference on Ultra Wideband Systems and Technologies Uwbst 2003 Conference Proceedings · January 1, 2003
Spectral keying (SK) is a novel UWB modulation scheme that combines properties of both frequency shift keying and pulse position modulation. An SK symbol consists of a number of pulses where each pulse is from a different frequency band. It relies on divid ...
Full textCite
ConferenceConference Record IEEE Global Telecommunications Conference · December 1, 2001
We design multilevel coding (MLC) schemes with low-density parity-check (LDPC) codes as component codes at each level. We develop a method to analyze the performance of an LDPC code at any level as the codeword length goes to infinity even if the equivalen ...
Cite
ConferenceConference Record IEEE Global Telecommunications Conference · December 1, 2001
Featured Publication
In this paper, we present two simple Monte Carlo methods for estimating the achievable information rates of general finite state channels. Both methods require only the ability to simulate the channel with an a posteriori probability (APP) detector matched ...
Cite
ConferenceProceedings 2001 IEEE Information Theory Workshop Itw 2001 · January 1, 2001
We design low-density parity-check (LDPC) codes for bandwidth efficient modulation using a multilevel coding (MLC) technique. We develop a method to analyze the asymptotic performance of the LDPC codes using message-passing decoding at each level of the ML ...
Full textCite
ConferenceDigests of the Intermag Conference · January 1, 2000
A turbo-like architecture for partial-response channels is presented. The architecture is based on the serial concatenation of an outer single parity check (SPC) with uniformly-interleaved rate-1 codes. ...
Cite
https://orcid.org/0000-0001-5521-4397