In this correspondence, we present two constructions. In the first construc
tion, we show how to generate perfect linear codes of length 2(r-1), r grea
ter than or equal to 5, and redundancy r, which correct a single burst of l
ength 2. In the second construction, we show how to generate perfect linear
codes organized in bytes of length 2(r-1), r greater than or equal to 5, w
ith redundancy divisible by r, which correct a single burst of length 2 wit
hin the bytes.