Low-density and high-density asymmetric CT-burst correcting integer codes

Two classes of integer codes correcting low-density and high-density asymmetric CT-bursts within a \begin{document}$ b $\end{document} -bit byte have been presented here. Unlike the previously studied integer codes correcting burst errors, here we study such codes with weight constraint on the burst. The proposed codes are compared with similar integer codes in terms of various properties, viz. memory consumption and number of table look ups. This article winds up with an idea of determining the probability of erroneous decoding and an approach for undetected error probability.