Error-correcting code proof

$Go Back$		Math Help Forum > University Math Help > Discrete Mathematics, Set Theory and Logic
$Reload this Page$ Error-correcting code proof

$Reply$

Thread Tools

Display Modes

$Old$ September 19th, 2008, 12:21 AM

shadow_2145 $shadow_2145 is offline$

Member

Join Date: Mar 2008

Posts: 99

Country:

Thanks: 43

Thanked 11 Times in 1 Post

$shadow_2145 is on a distinguished road$

$Default$ Error-correcting code proof

I can do examples fine to show that the following statement works, but I can't prove it for the life of me. If anyone is familiar in the area of Coding Theory, I would really appreciate some help. I am dealing with binary code.

Let $u_1$ and $u_2$ be error patterns of length $n$ , and assume that $u_1$ and $u_2$ agree at least in the positions where a 1 occurs in $u_1$ . Prove that if a code $C$ will correct $u_2$ , then $C$ will also correct $u_1$ .

Thanks for looking!

$Reply With Quote$

$Reply$

« coloured faces of an octahedron | Top | the Big-O notation problems »

Thread Tools
$Show Printable Version$ Show Printable Version $Email this Page$ Email this Page
Display Modes
$Linear Mode$ Linear Mode $Hybrid Mode$ Switch to Hybrid Mode $Threaded Mode$ Switch to Threaded Mode

Posting Rules
You may not post new threads You may not post replies You may not post attachments You may not edit your posts BB code is On Smilies are On [IMG] code is On HTML code is Off Trackbacks are Off Pingbacks are Off Refbacks are Off

Forum Jump

All times are GMT -7. The time now is 02:42 PM.

Math Help Forum is a community of maths forums with an emphasis on maths help in all levels of mathematics.
Register to post your math questions or just hang out and try some of our math games or visit the arcade.