Simulace BCH kódů pomocí open source nástroje Octave

Abstract

This bachelor thesis deals with simulation of coding and decoding BCH codes with open source project Octave. In the theoretical part, there are basic types of correction codes described. The analytical part explains principles of coding and decoding BCH codes. In the decoding segment, the main focus is put on the processing Peterson-Gorenstein-Yierl’s decoding algorithm with a demonstration of calculation and a verbal mention of another types of decoding. Further on, the work with open source project Octave, the installation of necessary packages for simulations BCH codes are described. The actual simulation of BCH codes in GNU Octave is completed with a presentation of a program output and a comment of its steps. The simulation program was created in order to automate the simulation, for a better understanding of the steps and a presentation of the ability of the codes. The whole code is placed on the DVD, which can be used for a free distribution and a use in GNU Octave program.

Description

Import 03/11/2016

Subject(s)

Galois field, Hamming distance, BCH codes, Peterson-Gorenstein-Yierl algorithm, Correction code, Octave

Citation