Abstract
Upper bounds on the weight distribution function for codes of minimum distance at least 2 are given. Codes, where the bound is met with equality, are characterized. An improved upper bound on the weight distribution function for codes of minimum distance at least 3 is given. As an application, a sharp upper bound on the probability of undetected error for linear codes with full support is characterized.
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.
