[Instructions] [Search] [Current] [News] [Syllabus] [Glance] [Links] [Handouts] [Outlines] [Labs] [Assignments] [Exams] [Examples] [Project]

**Assigned:** Friday, February 18, 2000

**Due:** Wednesday, March 1, 2000

Do exercises 3, 4, 5, 6, 7, 15, 17, 20, 21 from Chapter 2 of
*Computer Networks*.

Prove that two-dimensional parity catches any odd number of 1-bit errors. (Alternately, give an example in which it doesn't catch an odd number of errors.)

**Additional Notes:**

[Instructions] [Search] [Current] [News] [Syllabus] [Glance] [Links] [Handouts] [Outlines] [Labs] [Assignments] [Exams] [Examples] [Project]

**Disclaimer** Often, these pages were created "on the fly" with little, if any, proofreading. Any or all of the information on the pages may be incorrect. Please contact me if you notice errors.

This page may be found at http://www.math.grin.edu/~rebelsky/Courses/CS364/2000S/Assignments/assign.04.html

Source text last modified Sun Feb 20 17:04:03 2000.

This page generated on Sun Feb 20 17:05:05 2000 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu