Abstract

The Internet checksum is calculated by 16-bit one's complement arithmetic. The occurrence of two or more errors, however, may not be detected. In this manuscript, we formulate the checksum procedure as a nonlinear code. Part of distance distribution of the nonlinear code is calculated. By using the results, we derived lower and upper bounds on the probability of an undetectable error when the nonlinear code is used for error detection on a binary symmetric channel. For the IP header with no optional fields, the lower bound is almost equal to the upper bound when the bit error rate is less than about 1.0/spl times/10/sup -3/.

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

Disclaimer: 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.