bi-BYTE CORRECTING PERFECT CODES
Vinod Tyagi, Amita Sethi · Asian-European Journal of Mathematics · 2014
In this correspondence, we show how to generate bi-byte correcting perfect codes, i > 0 organized in m bytes of size β, n = mβ, and present necessary and sufficient conditions for their existence. By a bi-byte correcting perfect codes we mean a code that corrects burst of size b1 in the first byte, burst of length b2 in the second byte and so on, burst of length bm in the mth byte.