It is shown that for each integerb geq 1infinitely many optimum cyclicb-burst-correcting codes exist, i.e., codes whose lengthn, redundancyr, and burst-correcting capabilityb, satisfyn = 2^{r-b+1} - 1. Some optimum codes forb = 3, 4, and5are also studied in detail
This paper is a study of a large class of cyclic and shortened cyclic binary codes for multiple rand...
Abstract-The paper obtains a lower bound on the necessary number of parity-check digits in an (n=n1+...
Error-correcting codes with n binary digits per code word are considered, in which the distances are...
It is shown that for each integerb geq 1infinitely many optimum cyclicb-burst-correcting codes exist...
In (Adbel-Ghaffar et al., 1986) it is shown that for each integer b1 infinitely many optimum cyclic ...
Considerable attention has been devoted in the literature to the possible use of ƒ(X) = (Xp + 1)(Xq ...
AbstractIn (Adbel-Ghaffar et al., 1986) it is shown that for each integer b⩾1 infinitely many optimu...
Two new computationally efficient algorithms are developed for finding the exact burst-correcting li...
This paper explores the possibilities of the existence of block-wise burst error correcting (BBEC) o...
Hsu–Kasami–Chien (HKC) are a class of cyclic codes that can correct either burst or random errors. T...
Abstract—Perfect deletion-correcting codes of the same length over the same alphabet can have differ...
Abstract—In this paper, two upper bounds on the achievable code rate of linear block codes for multi...
A class of cyclic product codes capable of correcting multiple-burst errors is studied. A code of di...
Abstract — We consider two-dimensional error-correcting codes capable of correcting unrestricted bur...
During the digital transmission of information, errors are bound to occur. The errors may be random ...
This paper is a study of a large class of cyclic and shortened cyclic binary codes for multiple rand...
Abstract-The paper obtains a lower bound on the necessary number of parity-check digits in an (n=n1+...
Error-correcting codes with n binary digits per code word are considered, in which the distances are...
It is shown that for each integerb geq 1infinitely many optimum cyclicb-burst-correcting codes exist...
In (Adbel-Ghaffar et al., 1986) it is shown that for each integer b1 infinitely many optimum cyclic ...
Considerable attention has been devoted in the literature to the possible use of ƒ(X) = (Xp + 1)(Xq ...
AbstractIn (Adbel-Ghaffar et al., 1986) it is shown that for each integer b⩾1 infinitely many optimu...
Two new computationally efficient algorithms are developed for finding the exact burst-correcting li...
This paper explores the possibilities of the existence of block-wise burst error correcting (BBEC) o...
Hsu–Kasami–Chien (HKC) are a class of cyclic codes that can correct either burst or random errors. T...
Abstract—Perfect deletion-correcting codes of the same length over the same alphabet can have differ...
Abstract—In this paper, two upper bounds on the achievable code rate of linear block codes for multi...
A class of cyclic product codes capable of correcting multiple-burst errors is studied. A code of di...
Abstract — We consider two-dimensional error-correcting codes capable of correcting unrestricted bur...
During the digital transmission of information, errors are bound to occur. The errors may be random ...
This paper is a study of a large class of cyclic and shortened cyclic binary codes for multiple rand...
Abstract-The paper obtains a lower bound on the necessary number of parity-check digits in an (n=n1+...
Error-correcting codes with n binary digits per code word are considered, in which the distances are...
DOI
Add to ORKG