Tyagi, VinodSethi, Amita2015-04-082015-04-082009Journal of Science and Technology 3 (2), 2009, 301 – 3191307-3818This paper explores the possibilities of the existence of block-wise burst error correcting (n,k) linear codes over GF(2) (Galois field of two elements ,0 and 1) that can correct all bursts of length b? (fixed) in the first n? components , all bursts of length b? (fixed) in the next n? components and all bursts of length b? (fixed) in the last n? components; n = n1+ n2 +n3. Such codes are named as (?1b?, ?2b?, ?3b?) linear codes. Some of these codes turn out to be byte oriented[7].en(ⁿ1b₁, ⁿ2b₂, ⁿ3b₃) codeburst of length b(fixed)parity check matrixerror pattern syndrome- tablebyte oriented codesArticle