Lower bounds for codes correcting modera
โ
Sapna Jain; Ki-Bong Nam
๐
Article
๐
2006
๐
Elsevier Science
๐
English
โ 110 KB
Lee weight is more appropriate for some practical situations than Hamming weight as it takes into account magnitude of each digit of the word. In this paper, considering Lee weight, we obtain necessary lower bound over the number of parity checks to correct bursts of length b (fixed) whose weight li