Mathematics Homework Solutions
Problem
#25365

Error Correcting Code

If no two strings in a code differ in fewer than three positions, the we can actually correct a single error, by finding the unique string in the code that differs from the received string in only one position.  It turns out that there is a code of 7-bit strings that corrects single errors and contains 16 strings.  Find such a code.

Hint: Reasoning it out is probably best, but if you get stuck, write a program that searches for the string.

From the example in the book - the strings would be like ASCII sequence of bits - whereby ASCII has a seven bit code and then a parity bit placed on the front for error detecting.


Solution Summary

This shows how to find a code with the given string characteristics.

Solution
What is this?
By OTA - Overall OTA Rating
Departed OTA
Purchase Cost Now
$2.19 CAD (was ~$11.97)
Included in Download
  • Plain text response
  • Attached file(s):
    • solution_ECC_1.doc
$2.19 Instant Download
Add to Cart
Why you can trust BrainMass.com
  • Your Information is Secure
  • Best Online Academic Help Service
  • Students find real academic Success
Related Solutions
  • Bit String Lengths - (a) How many bit strings of length 6 are there? Explain. (b) How many bit strings of length 6 are there which begin with a 0 and end with a 1? Explain. (c) How many bit strings of length 6 start wit ...
  • Set Partitions and Bit Strings - Which of these collections of subsets are partitions on the set of bit strings of length 8? a) The set of bit strings that end with 00; the set of bit strings that end with 01; the set of bit strin ...
  • Induction Proof : Strings of Digits - If n >= 1, the number of strings using the digits 0,1, and 2 with no two consecutive places holding the same digit, is 3x2^n-1. For example, there are 12 such strings of length three: 010, 012, 020, ...
  • How many bit strings of length 6 are there which contain exactly 3 ones? - How many bit strings of length 6 are there which contain exactly 3 ones?
  • Grammar Induction - Consider the grammar 1) -> |epsilon 2) -> 0|1|2|3|4|5|6|7|8|9 Use induction to show that the number of strings in L() of length n is equal to 10^ ...
Browse