Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
41,153
On the Error Correcting Capabilities of Codes by the Construction
"... The codes by the construction partly have the error correcting capabilities for , , errors where . In this paper, we examine the error correcting capabilities of some codes by the construction and propose a new decoding algorithm to correct some errors. Keywords construction of ..."
Abstract
- Add to MetaCart
The codes by the construction partly have the error correcting capabilities for , , errors where . In this paper, we examine the error correcting capabilities of some codes by the construction and propose a new decoding algorithm to correct some errors. Keywords construction
Guaranteed Error Correction Capability of Codes on Graphs
, 2009
"... The guaranteed error correction capability of left regular LDPC codes under different hard decision decision algorithms is investigated. A summary of recent results relating the column weight and girth of the Tanner graph to the guaranteed error correction capability is provided. The intuition behin ..."
Abstract
- Add to MetaCart
The guaranteed error correction capability of left regular LDPC codes under different hard decision decision algorithms is investigated. A summary of recent results relating the column weight and girth of the Tanner graph to the guaranteed error correction capability is provided. The intuition
On guaranteed error correction capability of LDPC codes
- in Proceedings of IEEE International Symp. on Inform. Theory
, 2008
"... Abstract-We investigate the relation between the girth and the guaranteed error correction capability of γ-left regular LDPC codes when decoded using the bit flipping (serial and parallel) algorithms. A lower bound on the number of variable nodes which expand by a factor of at least 3γ/4 is found b ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
Abstract-We investigate the relation between the girth and the guaranteed error correction capability of γ-left regular LDPC codes when decoded using the bit flipping (serial and parallel) algorithms. A lower bound on the number of variable nodes which expand by a factor of at least 3γ/4 is found
Linear codes with non-uniform error correcting capability
, 1996
"... This paper introduces a class of linear codes which are non-uniform error correcting, i.e. they have the capability of correcting different errors in different codewords. A technique for specifying error characteristics in terms of algebraic inequalities, rather than the traditional spheres of radiu ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
This paper introduces a class of linear codes which are non-uniform error correcting, i.e. they have the capability of correcting different errors in different codewords. A technique for specifying error characteristics in terms of algebraic inequalities, rather than the traditional spheres
Error Correction Capability of Column-Weight-Three LDPC Codes: Part II
, 2008
"... The relation between the girth and the error correction capability of column-weight-three LDPC codes is investigated. Specifically, it is shown that the Gallager A algorithm can correct g/2 − 1 errors in g/2 iterations on a Tanner graph of girth g ≥ 10. ..."
Abstract
- Add to MetaCart
The relation between the girth and the error correction capability of column-weight-three LDPC codes is investigated. Specifically, it is shown that the Gallager A algorithm can correct g/2 − 1 errors in g/2 iterations on a Tanner graph of girth g ≥ 10.
On Trapping Sets and Guaranteed Error Correction Capability of LDPC Codes and GLDPC Codes
, 2008
"... The relation between the girth and the guaranteed error correction capability of γ-left regular LDPC codes when decoded using the bit flipping (serial and parallel) algorithms is investigated. A lower bound on the size of variable node sets which expand by a factor of at least 3γ/4 is found based on ..."
Abstract
-
Cited by 8 (7 self)
- Add to MetaCart
The relation between the girth and the guaranteed error correction capability of γ-left regular LDPC codes when decoded using the bit flipping (serial and parallel) algorithms is investigated. A lower bound on the size of variable node sets which expand by a factor of at least 3γ/4 is found based
Error Correction Capability of Column-Weight-Three LDPC Codes
, 2007
"... In this paper, we investigate the error correction capability of column-weight-three LDPC codes when decoded using the Gallager A algorithm. We prove that the necessary condition for a code to correct k ≥ 5 errors is to avoid cycles of length up to 2k in its Tanner graph. As a consequence of this re ..."
Abstract
-
Cited by 15 (7 self)
- Add to MetaCart
In this paper, we investigate the error correction capability of column-weight-three LDPC codes when decoded using the Gallager A algorithm. We prove that the necessary condition for a code to correct k ≥ 5 errors is to avoid cycles of length up to 2k in its Tanner graph. As a consequence
A New Look at the Error-Correcting Capabilities of Convolutional Codes ∗
"... Communication systems that employ a single convolutional code for error correction often operate at rates far below capacity. In that region, where channel errors are sparse, the performance of a code is well described by the free distance. The discovery of Turbo codes, however, made investigations ..."
Abstract
- Add to MetaCart
that maximum slope cannot be the whole story. We look at indicators of error-correcting capability of convolutional codes from a new perspective. Based on the average length of the error bursts at the output of a Viterbi decoder as well as on the first event error probability, we present a new method to gain
Results 1 - 10
of
41,153
