Rate 1/2 and 2/3 Majority Logic Decodable Binary Burst Error-Correcting Codes

A class of binary quasi-cyclic burst error-correcting codes based upon product codes is studied. An expression for the maximum burst error-correcting capability for each code in the class is given. In certain cases, the codes exist in the class which ...

A particular shortening technique is applied to majority logic decodable codes of length 2^{t} . The shortening technique yields new efficient codes of lengths n = 2^{p} , where p is a prime, e.g., a (128,70) code with d_{maj} = 16 . For moderately long ...

In this correspondence a class of t-error correcting and multiple unidirectional error detecting systematic codes is presented. These codes are significantly more efficient than the earlier codes. The efficiency of these codes approaches the efficiency ...