Document Type : Original Manuscript


Department of Mathematical Sciences, Tezpur University, Napaam, P.O. Box 784028, Sonitpur, Assam, India.


The paper studies the existence of linear codes that locate solid burst errors, which may be confined to one sub-block or spread over two adjacent sub-blocks. An example of such a code is also given. Comparisons on the number of parity check digits required for such linear codes with solid burst detecting and correcting codes are also provided.


1. N. M. Abramson, A class of systematic codes for non-independent errors, IRE Trans. Inf. Theory, IT-5(4) (1959), 150–157.
2. J. Arlat, W. C. Carter, Implementation and evaluation of a (b; k)-adjacent errorcorrecting/detecting scheme for supercomputer systems, IBM J. Res. Develop., 28(2) (1984), 159–169.
3. P. K. Das, Codes detecting and correcting solid burst errors, Bull. Electr. Eng. Inform., 1(3) (2012), 225–232.
4. P. K. Das, Codes detecting and locating solid burst errors, Rom. J. Math. Comput. Sci., 2(2) (2012), 1–10.
5. P. K. Das and S. Kumar, Location of burst and repeated burst error in single and adjacent sub-blocks, TWMS J. of Apl. & Eng. Math. 12(3) (2022), 996–1003. 
6. E. Fujiwara, Code Design for Dependable Systems: Theory and Practical Applications, John Wiley & Sons, Inc. 2006.
7. D. W. Jensen, Block code to efficiently correct adjacent data and /or check bit errors, Patent number: US 6604222 B1, Date of Patent Aug. 5, 2013.
8. W. W. Peterson and E. J. Weldon(Jr.), Error-Correcting Codes, 2nd edition, The MIT Press, 1972.
9. G. E. Sacks, Multiple error correction by means of parity-checks, IRE Trans. Inform. Theory, IT-4 (1958), 145–147.
10. J. Wolf and B. Elspas, Error-locating codes a new concept in error control, IEEE Trans. Inf. Theory, 9(2) (1963), 113–117.