In this letter the performance of single burst-error-correcting (BEC) codes used over bursty channels is evaluated. The channel is represented by the Gilbert-Elliott (GE) model, which has been used by numerous authors...
详细信息
In this letter the performance of single burst-error-correcting (BEC) codes used over bursty channels is evaluated. The channel is represented by the Gilbert-Elliott (GE) model, which has been used by numerous authors to evaluate the performance of random-error-correcting (REC) codes over bursty channels. Recursive expressions are derived, which are used in evaluating the probability of a codeword error, These expressions and an approximate closed-form expression are applied to the performance of a single (23,12) BEC code.
Disjoint difference sets with regard to the largest elements, instead of difference triangles used by Mandelbaum, are used to construct multiple-bursterror-correctingcodes using majority-logic decoding. Improvements...
详细信息
Disjoint difference sets with regard to the largest elements, instead of difference triangles used by Mandelbaum, are used to construct multiple-bursterror-correctingcodes using majority-logic decoding. Improvements of previous results are also listed.
This paper presents new encoding and decoding methods for Berlekamp-Preparata convolutional codes (BPCCs) based on tail-biting technique. The proposed scheme can correct a single block of n bit errors relative to a gu...
详细信息
This paper presents new encoding and decoding methods for Berlekamp-Preparata convolutional codes (BPCCs) based on tail-biting technique. The proposed scheme can correct a single block of n bit errors relative to a guard space of m error-free blocks while no fractional rate loss is incurred. The proposed tail-biting BPCCs (TBBPCCs) can attain optimal complete bursterror correction bound. Therefore, they have the optimal phased-burst-error-correcting capability for convolutional codes. Compared with the previous scheme, the proposed scheme can also improve errorcorrecting capability.
We propose a simple decoder for a widely used array code, known as the EVENODD code, which is originally designed to correct phased bursterrors, to make it useful for correcting nonphased errors. The proposed scheme ...
详细信息
We propose a simple decoder for a widely used array code, known as the EVENODD code, which is originally designed to correct phased bursterrors, to make it useful for correcting nonphased errors. The proposed scheme is capable of correcting almost all bursts up to a certain length. We show that the failure rate is sufficiently small and approaches zero as the block length increases. The redundancy of the code is twice the maximal burst length, which is a lower bound for the redundancy of a true burst-error-correcting code. Both the encoder and the decoder have very low complexity, both in terms of number of operations and in terms of computer code size.
Recently, Schwartz and Etzion proposed several efficient code construction methods of two-dimensional linear codes capable of correcting a single arbitrary cluster of errors of size b. Some of their methods, however, ...
详细信息
Recently, Schwartz and Etzion proposed several efficient code construction methods of two-dimensional linear codes capable of correcting a single arbitrary cluster of errors of size b. Some of their methods, however, impose the constraint that the degree m of GF (2(m)) must be even. In this correspondence, we investigate whether such Schwartz-Etzion's methods are applicable to the case in is odd. We provide necessary and sufficient conditions for the original Schwartz-Etzion's methods to be used for constructing two-dimensional cluster-error-correcting linear codes for odd m, and show that the methods are available extensively.
Three-dimensional cyclic array codes over F (q) that can correct single three-dimensional bursts (or clusters) of errors are considered. The class cyclic three-dimensional burst-error-correcting array codes, called th...
详细信息
Three-dimensional cyclic array codes over F (q) that can correct single three-dimensional bursts (or clusters) of errors are considered. The class cyclic three-dimensional burst-error-correcting array codes, called three-dimensional Fire codes, is constructed. Several important properties such as the burst-error-correcting capability and the positions of the parity-check symbols are presented. Also, encoding and decoding algorithms are given.
暂无评论