IEEE Transactions on Information Theory · 1972 · 17 citations · 0 references
EngineeringComputer ScienceElectrical EngineeringDigital CommunicationFault-tolerant ComputingInformation TheoryChannel CodingCoding TheoryErasure CodingError Control CodingError DetectionError-correcting CodesBinary CodesBlock CodesBlock CodingBurst-error-correcting CodesDecoding AlgorithmsErasure DetectionInput/output ChannelsLinear Block Codes
The burst-b distance between two binary vectors is defined and shown to be a metric. This definition is applied to a binary-input, Q-ary output channel where errors occur in bursts. A decoding algorithm is presented for such a channel that is an extension of Weldon's (1971) weighted erasure decoding. Examples are presented illustrating the techniques.