Quasi-cyclic array codes are equivalent to shortened Gilbert codes
R. Andrew · 2002
Zhang and Wolf (1988) determine the burst correction capability of a n/sub 1//spl times/n/sub 2/ quasi-cyclic array code with parameter s. It is shown that this code can be obtained from a n/sub 3//spl times/n/sub 2/ Gilbert code for some n3>n/sub 1/, by shortening. This construction leads to simple expressions for the burst correction capability and allows burst correction by error trapping.