Anti-codes on solid burst of length b of anti-weight t

Abstract

This paper considers a new kind of error which will be termed as 'solid burst of length of anti-weight '. Lower and upper bounds on the number of parity checks required for the existence of anti-codes that detect solid burst of length or less of anti-weight or more are obtained. This is followed by an example of such anti-codes. The paper also deals with anti-codes capable of detecting and simultaneously correcting such errors. Then the maximum anti-weight of such errors in the space of -tuples is discussed. Further, the paper obtains an upper bound on the number of parity checks required for the existence of anti-codes that detect solid burst of length or less of anti-weight or more, together with or less random errors of anti-weight or more   ^< .