Split-syndrome burst error correcting codes for one-dimensional channels

An extension to a recently discovered class of burst error correcting codes is described. The differences from the previous codes are detailed, together with enhancements to the decoding algorithm. It is shown that the minimum distance of this class of codes is four, and an example of decoding one of the extended codes is given. The simple nature of the decoder allows these codes to be considered as an alternative to established codes for certain block and error burst lengths. A comparison of these new codes with some existing burst error correcting codes is given.