On 2-Repeated Burst Error Detecting Codes

Repeated Low-Density Burst Error Detecting Codes

“…□ Remark 1. For w = b, the result reduces to Theorem 1 of Berardi, Dass, and Verma [2] when the bursts considered are 2-repeated bursts of length b or less.…”

“…In Section 4, we obtain a lower bound for codes detecting m-repeated low-density bursts of length b or less with weight w or less followed by another bound for codes which can correct and simultaneously detect such repeated low-density bursts. The paper concludes with an illustration of a 2-repeated low-density burst of length 3 or less with weight 2 or less detecting code over GF (2).…”

Detection and Correction of Repeated Restricted Burst Errors in Sub-Blocks

“…CT burst [2], repeated burst errors (RB errors) [1], [5] and key errors [3] is the main goal of the coding theory. These errors occur during the transmission through a channel.…”

Bounds on linear codes capable of detecting, locating and correcting of repeated burst errors prevailing in multiple sub-blocks

“…Blockwise correction of errors is very useful specially in the study of convolutional codes [14,10], where the codewords consist of some smaller sub-blocks. Repeated burst error was introduced by Berardi, Dass and Verma in [1] and its general form was introduced by Dass and Verma in [5]. Repeated burst error affecting only single sub-block is studied by Dass and Madan in [7,8] where they obtain bounds for linear code correcting and locating such errors.…”