Abstract
Lee weight is more appropriate for some practical situations than Hamming weight as it takes into account the magnitude of each digit of the word. In this paper, we obtain a sufficient bound over the number of parity check digits for codes detecting burst errors and also for codes correcting burst errors with Lee weight.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
