Abstract—In this paper, two upper bounds on the achievable code rate of linear block codes for multiple phased-burst cor-rection (MPBC) are presented. One bound is constrained to a maximum correctable cyclic burst length within every subblock, or equivalently a constraint on the minimum error free length or gap within every phased-burst. This bound, when reduced to the special case of a bound for single burst correction (SBC), is shown to be the Abramson bound when the cyclic burst length is less than half the block length. The second MPBC bound is developed without the minimum error free gap constraint and is used as a comparison to the first bound. Index Terms—Multiple phased-burst correction bounds, burst correction bounds, coding bound,...
Considerable attention has been devoted in the literature to the possible use of ƒ(X) = (Xp + 1)(Xq ...
The paper presents lower and upper bounds on the number of parity check digits required for a linear...
A class of linear convolutional codes for compound channels (i.e., channels on which burst and rando...
Two new computationally efficient algorithms are developed for finding the exact burst-correcting li...
Abstract. In coding theory, several kinds of errors which depend on the nature of the communication ...
A class of cyclic product codes capable of correcting multiple-burst errors is studied. A code of di...
In (Adbel-Ghaffar et al., 1986) it is shown that for each integer b1 infinitely many optimum cyclic ...
During the digital transmission of information, errors are bound to occur. The errors may be random ...
Hsu–Kasami–Chien (HKC) are a class of cyclic codes that can correct either burst or random errors. T...
This paper presents lower bounds on the number of parity-check digits required for a linear code tha...
There are several kinds of burst errors for which error detecting and error correcting codes have be...
Two results on the correction of multiple bursts of errors are presented. In Section II, a theorem i...
Abstract—Erasure correcting codes are widely used in upper layers of packet-switched networks, where...
This paper studies linear codes capable of detecting and correcting solid burst error of length b or...
It is shown that for each integerb geq 1infinitely many optimum cyclicb-burst-correcting codes exist...
Considerable attention has been devoted in the literature to the possible use of ƒ(X) = (Xp + 1)(Xq ...
The paper presents lower and upper bounds on the number of parity check digits required for a linear...
A class of linear convolutional codes for compound channels (i.e., channels on which burst and rando...
Two new computationally efficient algorithms are developed for finding the exact burst-correcting li...
Abstract. In coding theory, several kinds of errors which depend on the nature of the communication ...
A class of cyclic product codes capable of correcting multiple-burst errors is studied. A code of di...
In (Adbel-Ghaffar et al., 1986) it is shown that for each integer b1 infinitely many optimum cyclic ...
During the digital transmission of information, errors are bound to occur. The errors may be random ...
Hsu–Kasami–Chien (HKC) are a class of cyclic codes that can correct either burst or random errors. T...
This paper presents lower bounds on the number of parity-check digits required for a linear code tha...
There are several kinds of burst errors for which error detecting and error correcting codes have be...
Two results on the correction of multiple bursts of errors are presented. In Section II, a theorem i...
Abstract—Erasure correcting codes are widely used in upper layers of packet-switched networks, where...
This paper studies linear codes capable of detecting and correcting solid burst error of length b or...
It is shown that for each integerb geq 1infinitely many optimum cyclicb-burst-correcting codes exist...
Considerable attention has been devoted in the literature to the possible use of ƒ(X) = (Xp + 1)(Xq ...
The paper presents lower and upper bounds on the number of parity check digits required for a linear...
A class of linear convolutional codes for compound channels (i.e., channels on which burst and rando...