It will turn out that all the guarantees we can make

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ent. It will turn out that all the guarantees we can make are probabilistic, but we will be able to make our guarantees on reliabile data receptions with very high probability. Over a communication channel, the sender and receiver implement the error correction and detection procedures. The sender has an encoder whose job is to take the message and process it to produce the coded bits that are then sent over the channel. The receiver has a decoder whose job is to take the received (coded) bits and to produce its best estimate of the message. The encoder-decoder procedures together constitute channel coding. Our plan is as follows. First, we will define a model for the kinds of bit errors we’re going to handle and revisit the previous lectures to see why errors occur. Then, we will discuss and analyze a simple redundancy scheme called a replication code, which will simply make c copies of any given bit. The replication code has a code rate of 1/c—that is, for every useful bit we receive, we will end up encoding...
View Full Document

This document was uploaded on 02/26/2014 for the course CS 6.02 at MIT.

Ask a homework question - tutors are online