Create a correctable enjoin for a inventory of key vote.  Your operation is to imagine an fertile, correctable enjoin for a inventory that contains 20 key vote.  The vote in your enjoin achieve be represented as binary strings using solely 0’s and 1’s.  Stringent correctability requirements moderation your enjoin must feel a poverty removal of 3.

- Read Section 5.2 (pages 150-152) and imply the definitions for bit, binary vocable, enjoin, enjoinwords, Hamming removal, and poverty removal of a enjoin.

- Imagine a enjoin consisting of binary enjoinwords.

- The enjoin must converge three requirements

  -- Contain at last 20 enjoinwords

  -- Feel a poverty removal of 3 (expound why a min removal of 4 is no emend than 3)

  -- Maintain competency by using the fewest enumerate of bits per enjoinvocable as possible

- Clearly instrument and picture your enjoin: what it is, why you chose it, etc.

- Discuss how topology relates to the segregation of your enjoin and the Hamming metric

A few notes environing format: use MS PowerPoint for your bestowal; expand a bestowal that is 10-15 slides in length; cement audio files into your bestowal in enjoin to expound your work; use Equation Editor for all prosaic symbols, e.g. x ∈ X or Cl(A) ⋂ Cl(X-A); and excellent fonts, backgrounds, etc. to produce your bestowal appear professional.

Text Book: Adams-C-Franzosa-R-introduction-to-Topology-Pure-and-Applied-Prentic-Hall-2007