FACTOR GRAPHS and DECODING

Examples of different Realizations

In the following, a few different codes are listed that have been realized in one or more different ways. For all of the examples, a short definition is given and the behavior can be tested online as simulation in JAVA.

For more details see the documentation.

More info about the JAVA programs.


1. [8,4,4] Extended Hamming Code

The [N=7, k=4, dmin=3] Hamming code is extended by a further parity bit in order to get the [8,4,4] extended Hamming code. The code is systematic and has sixteen different codewords. For a definition of the generator matrix and a parity check matrix, see realization 1.

The following realizations are available:


2. [24,12,8] Extended Golay Code

For the [24,12,8] extended Golay code at the moment only one realization is availabe. For further details about the code, see realization 1 or the documentation.

The following realizations are available:


3. [18,9,5] Tail-Biting Code

This code has also been implemented in hardware [11], [12].

The following realizations are available:


Written by Stefan M. Moser <stmoser@stud.NOSPAM.ee.ethz.ch> (remove NOSPAM from email-address!)
Last modified: Wed Aug 20 16:00:12 MEST 2003