Abstract
This paper introduces a new class of codes that have been called `unequal error locating codes?. These codes are basically error locating codes but are studied by considering error patterns of various magnitudes lying in different sub-blocks of unequal lengths of the block length of a code. Lower and upper bounds on the number of parity-check digits required for such codes are derived. First, the codes locating random errors are considered and then a similar study is carried out for codes locating burst errors. Both cases are illustrated.
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.
