On weights of 2-repeated low-density bursts of length $b$ (fixed)

Abstract

The ever increasing demand for efficient and reliable data transmission and storage systems motivates the need of more reliable and efficient codes, so that large amount of data can be stored and transmitted efficiently. In a very busy communication channel due to large amount of noise, bursts repeat themselves. In such type of error patterns, it is quite obvious that not all digits in a burst are in error. Such repeated bursts are termed as low-density repeated bursts. In this paper some combinatorial results on 2-repeated low-density bursts of length $b$ (fixed) for calculating their weights are derived.