Linear Codes and Syndrome Decoding - Maple Application Center
Application Center Applications Linear Codes and Syndrome Decoding

Linear Codes and Syndrome Decoding

Author
: José Luis Gómez Pardo
Engineering software solutions from Maplesoft
This Application runs in Maple. Don't have Maple? No problem!
 Try Maple free for 15 days!
Implementation of the encoding and decoding algorithms associated to an error-correcting linear code. Such a code can be characterized by a generator matrix or by a parity-check matrix and we introduce, as examples, the [7, 4, 2] binary Hamming code, the [24, 12, 8] and [23, 12, 7] binary Golay codes and the [12, 6, 6] and [11, 6, 5] ternary Golay codes. We give procedures to compute the minimum distance of a linear code and we use them with the Hamming and Golay codes. We show how to build the standard array and the syndrome array of a linear code and we give an implementation of syndrome decoding. Finally, we simulate a noisy channel and use the Hamming and Golay codes to show how syndrome decoding allows error correction on text messages.

Application Details

Publish Date: June 06, 2019
Created In: Maple 2017
Language: English

More Like This

Eigenpairs: What are they and how they are found
Classroom Tips and Techniques: Locus of Eigenvalues
Collision detection between toolholder and workpiece on ball nut grinding
Kinematics of Our Earth-Moon System
Classroom Tips and Techniques: Simultaneous Diagonalization and the Generalized Eigenvalue Problem
Application of the Modified Gram-Schmidt Algorithm
Internet Page Ranking Algorithms
Symmetry of two-dimensional hybrid metal-dielectric photonic crystal within MAPLE
Classroom Tips and Techniques: An Undamped Coupled Oscillator