Constructions for perfect 2-burst-correcting codes

In this correspondence, we present two constructions. In the first construction, we show how to generate perfect linear codes of length 2 ^r-1, r⩾5, and redundancy r, which correct a single burst of length 2. In the second construction, we show how to generate perfect linear codes organized in bytes of length 2^r-1, r⩾5, with redundancy divisible by r, which correct a single burst of length 2 within the bytes