Paper 3, Section I, 4H4 \mathrm{H}

Coding and Cryptography | Part II, 2009

Define a binary code of length 15 with information rate 11/1511 / 15 which will correct single errors. Show that it has the rate stated and give an explicit procedure for identifying the error. Show that the procedure works.

[Hint: You may wish to imitate the corresponding discussion for a code of length 7 .]

Typos? Please submit corrections to this page on GitHub.