Abstract
Lee weight is more appropriate for some practical situations than Hamming weight. Bounds over the number of parity checks in terms of Hamming weight have been obtained, but such a detailed study is not available in terms of Lee weight. In this paper, considering Lee weight, we obtain a necessary bound over the number of parity checks to correct a message which has both clustered errors and errors in separate positions. Also there is a bound for codes correcting bursts with limited intensity.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
