Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE Transactions on Communications

A Hybrid Coding Scheme for the Gilbert–Elliott Channel

J. Chen, R.M. Tanner

Published Sep 1, 2006• 8 citations
Publisher

Abstract

In this paper, we study the performance of different graph-based error-correcting codes over Gilbert–Elliot channels. We propose a hybrid coding scheme in which each code bit is checked by both a parity check and a Hamming code. A hybrid code can be represented by a code-to-code graph, which can be used to optimize the code. Asymptotic minimum distance properties of the hybrid code are derived, and it is shown that the expected minimum distance of the hybrid code increases linearly with respect to the code length. Simulation results show that for a typical Gilbert–Elliott channel, hybrid codes can outperform regular low-density parity-check codes by more than an order of magnitude, in terms of bit-error rate.

DOI
10.1109/tcomm.2006.881270

Related papers

A hybrid coding scheme for the Gilbert-Elliott channel

Jinghu Chen, R. Michael Tanner

In this paper, we study the performance of different graph-based error-correcting codes over Gilbert-Elliott (GE) channels. We propose a hybrid coding scheme in which each code bit is checked by both a parity-check code and a Hamming code. A hybrid code can be represented by a code-to-code graph, which can be used to optimize the code. Asymptotic minimum distance properties of the hybrid code are derived, and it is shown that the expected minimum distance of the hybrid code increases linearly with respect to the code length. Simulation results show that for a typical GE channel, hybrid codes can outperform regular low-density parity-check codes by more than an order of magnitude, in terms of bit-error rate.

IEEE Transactions on Communications•Oct 1, 2006•21 citations

On generalized low-density parity-check codes based on Hamming component codes

Michael Lentmaier, Kamil Sh. Zigangirov

In this paper we investigate a generalization of Gallager's (1963) low-density (LD) parity-check codes, where as component codes single error correcting Hamming codes are used instead of single error detecting parity-check codes. It is proved that there exist such generalized low-density (GLD) codes for which the minimum distance is growing linearly with the block length, and a lower bound of the minimum distance is given. We also study iterative decoding of GLD codes for the communication over an additive white Gaussian noise channel. The performance in terms of the bit error rate, obtained by computer simulations, is presented for GLD codes of different lengths.

IEEE Communications Letters•Aug 1, 1999•186 citations

Low-Density Parity-Check Codes for Gilbert-Elliott and Markov-Modulated Channels

Andrew W. Eckford

The problem of low-density parity-check (LDPC) decoding in channels with memory has been attracting increasing attention in the literature. In this thesis, we use LDPC codes in an estimation-decoding scheme for the Gilbert-Elliott (GE) channel and more general Markov-modulated channels. The major accomplishments of this thesis include both analysis and design components. To analyze our estimation-decoding scheme, we derive density evolution for the GE channel, which has previously been used largely in memoryless channels. Furthermore, we develop techniques that use density evolution results to more efficiently characterize the space of Markov-modulated parameters. We begin by applying a characterization to the GE channel, following which we generalize this characterization into a partial ordering of Markov-modulated channels in terms of probability of symbol error. We also consider the design problem of developing LDPC degree sequences that are optimized for the GE channel. We obtain a novel design tool that approximates density evolution for our estimation-decoding algorithm, and present degree sequences that represent the best known codes in the GE channel. We also present a method of generalizing this tool to Markov-modulated channels, and give some of the first optimized degree sequences ever obtained for these channels.

•Jan 1, 2004•14 citations

On the Number of Errors Correctable with Codes on Graphs

Alexander Barg, Arya Mazumdar

We study ensembles of codes on graphs (generalized low-density parity-check, or LDPC codes) constructed from random graphs and fixed local constrained codes, and their extension to codes on hypergraphs. It is known that the average minimum distance of codes in these ensembles grows linearly with the code length. We show that these codes can correct a linearly growing number of errors under simple iterative decoding algorithms. In particular, we show that this property extends to codes constructed by parallel concatenation of Hamming codes and other codes with small minimum distance. Previously known results that proved this property for graph codes relied on graph expansion and required the choice of local codes with large distance relative to their length.

arXiv:0911.4522•IEEE Transactions on Information Theory•Jan 21, 2011•11 citations

GRAPH BASED LINEAR ERROR CORRECTING CODES

Monika Polak

In this article we present a construction of error correcting codes, that have representation as very sparse matrices and belong to the class of Low Density Parity Check Codes. LDPC codes are in the classical Hamming metric. They are very close to well known Shannon bound. The ability to use graphs for code construction was first discussed by Tanner in 1981 and has been used in a number of very effective implementations. We describe how to construct such codes by using special a family of graphs introduced by Ustimenko and Woldar. Graphs that we used are bipartite, bi-regular, very sparse and do not have short cycles C4. Due to the very low density of such graphs, the obtained codes are fast decodable. We describe how to choose parameters to obtain a desired code rate. We also show results of computer simulations of BER (bit error rate) of the obtained codes in order to compare them with other known LDPC codes.

arXiv:1612.03279•Albanian Journal of Mathematics•Jun 15, 2016•1 citation

Short Low-Error-Floor Tanner Codes with Hamming Nodes

Gianluigi Liva, W.E. Ryan

While it is fairly easy to design good low-density parity-check codes with medium or large block lengths, and with code rates 1/2 or greater, much more effort is required for short lengths and low rates. We propose a code structure which incorporates Hamming codes into a code's graph, leading to a type of a Tanner code. The incorporation of Hamming codes into the graph, which we call "Hamming code doping", tends to lead to larger minimum distances and hence low error-rate floors. We present an iterative decoding algorithm tailored to graphs possessing "Hamming nodes". Further, a density evolution analysis based on the Gaussian approximation is presented, which is a useful tool for finding good codes. Finally, we present numerical results of some Hamming-doped Tanner codes simulated on the AWGN channel. The simulated codes exhibit remarkably low error floors, while simultaneously displaying good decoding thresholds

IEEE Military Communications Conference (MILCOM)•Mar 22, 2006•29 citations
In this paper, we study the performance of different graph-based error-correcting codes over Gilbert–Elliot channels. We propose a hybrid coding scheme in which each code bit is checked by both a parity check and a Hamming code. A hybrid code can be represented by a code-to-code graph, which can be used to optimize the code. Asymptotic minimum distance properties of the hybrid code are derived, and it is shown that the expected minimum distance of the hybrid code increases linearly with respect to the code length. Simulation results show that for a typical Gilbert–Elliott channel, hybrid codes can outperform regular low-density parity-check codes by more than an order of magnitude, in terms of bit-error rate.
In this paper, we study the performance of different graph-based error-correcting codes over Gilbert-Elliott (GE) channels. We propose a hybrid coding scheme in which each code bit is checked by both a parity-check code and a Hamming code. A hybrid code can be represented by a code-to-code graph, which can be used to optimize the code. Asymptotic minimum distance properties of the hybrid code are derived, and it is shown that the expected minimum distance of the hybrid code increases linearly with respect to the code length. Simulation results show that for a typical GE channel, hybrid codes can outperform regular low-density parity-check codes by more than an order of magnitude, in terms of bit-error rate.
In this paper we investigate a generalization of Gallager's (1963) low-density (LD) parity-check codes, where as component codes single error correcting Hamming codes are used instead of single error detecting parity-check codes. It is proved that there exist such generalized low-density (GLD) codes for which the minimum distance is growing linearly with the block length, and a lower bound of the minimum distance is given. We also study iterative decoding of GLD codes for the communication over an additive white Gaussian noise channel. The performance in terms of the bit error rate, obtained by computer simulations, is presented for GLD codes of different lengths.
The problem of low-density parity-check (LDPC) decoding in channels with memory has been attracting increasing attention in the literature. In this thesis, we use LDPC codes in an estimation-decoding scheme for the Gilbert-Elliott (GE) channel and more general Markov-modulated channels. The major accomplishments of this thesis include both analysis and design components. To analyze our estimation-decoding scheme, we derive density evolution for the GE channel, which has previously been used largely in memoryless channels. Furthermore, we develop techniques that use density evolution results to more efficiently characterize the space of Markov-modulated parameters. We begin by applying a characterization to the GE channel, following which we generalize this characterization into a partial ordering of Markov-modulated channels in terms of probability of symbol error. We also consider the design problem of developing LDPC degree sequences that are optimized for the GE channel. We obtain a novel design tool that approximates density evolution for our estimation-decoding algorithm, and present degree sequences that represent the best known codes in the GE channel. We also present a method of generalizing this tool to Markov-modulated channels, and give some of the first optimized degree sequences ever obtained for these channels.
We study ensembles of codes on graphs (generalized low-density parity-check, or LDPC codes) constructed from random graphs and fixed local constrained codes, and their extension to codes on hypergraphs. It is known that the average minimum distance of codes in these ensembles grows linearly with the code length. We show that these codes can correct a linearly growing number of errors under simple iterative decoding algorithms. In particular, we show that this property extends to codes constructed by parallel concatenation of Hamming codes and other codes with small minimum distance. Previously known results that proved this property for graph codes relied on graph expansion and required the choice of local codes with large distance relative to their length.
In this article we present a construction of error correcting codes, that have representation as very sparse matrices and belong to the class of Low Density Parity Check Codes. LDPC codes are in the classical Hamming metric. They are very close to well known Shannon bound. The ability to use graphs for code construction was first discussed by Tanner in 1981 and has been used in a number of very effective implementations. We describe how to construct such codes by using special a family of graphs introduced by Ustimenko and Woldar. Graphs that we used are bipartite, bi-regular, very sparse and do not have short cycles C4. Due to the very low density of such graphs, the obtained codes are fast decodable. We describe how to choose parameters to obtain a desired code rate. We also show results of computer simulations of BER (bit error rate) of the obtained codes in order to compare them with other known LDPC codes.
While it is fairly easy to design good low-density parity-check codes with medium or large block lengths, and with code rates 1/2 or greater, much more effort is required for short lengths and low rates. We propose a code structure which incorporates Hamming codes into a code's graph, leading to a type of a Tanner code. The incorporation of Hamming codes into the graph, which we call "Hamming code doping", tends to lead to larger minimum distances and hence low error-rate floors. We present an iterative decoding algorithm tailored to graphs possessing "Hamming nodes". Further, a density evolution analysis based on the Gaussian approximation is presented, which is a useful tool for finding good codes. Finally, we present numerical results of some Hamming-doped Tanner codes simulated on the AWGN channel. The simulated codes exhibit remarkably low error floors, while simultaneously displaying good decoding thresholds