Scribd
Upload
47 views17 pages

Error Correction Coding 1

The document discusses error correcting codes and their properties. It states that for a code to correct up to t errors, the Hamming spheres of radius t centered at each codeword must not overlap. It also notes that the minimum distance between codewords for a t-error detecting code is t+1, while for a t-error correcting code it is 2t+1. The document then discusses the decoding process for an (n,k) code, noting that the error vector e is multiplied by the parity check matrix HT to get the syndrome s, but that this results in fewer equations than needed to uniquely solve for e.

Uploaded by

Varun Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
47 views17 pages

Error Correction Coding 1

The document discusses error correcting codes and their properties. It states that for a code to correct up to t errors, the Hamming spheres of radius t centered at each codeword must not overlap. It also notes that the minimum distance between codewords for a t-error detecting code is t+1, while for a t-error correcting code it is 2t+1. The document then discusses the decoding process for an (n,k) code, noting that the error vector e is multiplied by the parity check matrix HT to get the syndrome s, but that this results in fewer equations than needed to uniquely solve for e.

Uploaded by

Varun Gupta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 17

Error Correcting Codes

Chapter 14

Section 14.1 Overview

Section 14.2

If the code is to correct up to t errors, then all the Hamming


spheres of radius t centred at codewords should be nonoverlapping.

The minimum distance between t error detecting


codewords is = + 1.

The minimum distance between t error correcting


codewords is = 2 + 1.

Section 14.3

=
In a (, ) code,

there are 2 distinct (valid) codewords.

Each codeword has digits.


The error vector has digits.

is of 1 x n dimension, while is of n x m dimension.


Each syndrome has = digits.
=

will result in ( ) linear equations.

Therefore, we cannot get a unique solution for , from these


equations.

We will use additional decision criteria to fully decode the word.


(This we will do after discussing Hamming codes in the next few
slides)

What is the optimum number of check bits m, for a t-error correcting code ?

You might also like