This preview shows page 1. Sign up to view the full content.
Unformatted text preview: class of graphical codes. We will study two simple examples of linear block codes,
which themselves are a sub-class of algebraic block codes: Hamming codes and rectangular parity codes. We also note that the replication code discussed in Section 6.2 is an
example of a linear block code.
In later lectures, we will study convolutional codes, a sub-class of graphical codes. 6.4 Linear Block Codes and Parity Calculations Linear block codes are examples of algebraic block codes, which take the set of k -bit messages we wish to send (there are 2k of them) and produce a set of 2k code words, each n
bits long (n ≥ k ) using algebraic operations over the block. The word “block” refers to the
fact that any long bit stream can be broken up into k -bit blocks, which are then expanded
to produce n-bit code words that are sent. 8 LECTURE 6. COPING WITH BIT ERRORS Such codes are also called (n, k ) codes, where k message bits are combined to produce
n code bits (so each code word has n − k “redundanc...
View Full Document
This document was uploaded on 02/26/2014 for the course CS 6.02 at MIT.
- Fall '13