Original title: Reed-Solomonovy kódy a jejich aplikace
Translated title: Reed-Solomon codes and applications
Authors: Horal, Pavel ; Vojtěchovský, Petr (referee) ; Drápal, Aleš (advisor)
Document type: Bachelor's theses
Year: 2006
Language: cze
Abstract: Xazev praee: Reed-Solomonovy kody a jejich aplikaco Autor: Pavel Iloral Katcdra (ustav): Katedra Algebry Vedouci bakalafsko prace: Doc. RNDr. Ales Drapal. CSc. c-nia.il vedoiiciho: drapar^karlin.mil', cuni.cz Abstrakt: Prace podava ucelenon definici klasiekyeh Reed-Solomonovych kodn, vcetne potfobuyeh zakladu tcxjric1 k()du. Je dokazana cykliciiost RS kodn delky q - I . Na cyklienosti jsou pak zalozeny tri inx'zontovane dekcklovac'i algoritmy fPetersonnv, Rorlrkain])-Mas.seyuv a Enklidi'iv dekodova.ci algoritmns), vcetne. dukazfi existcniee feseni. V ])oslodni ka])itole uvadiin nckolik a.]>likaci RS kodu, vcetne nejznainejyiho standardu CIRC' pouzivancho na Imdebnich CD. Klieova alova: .s;nnoo])ravny k(5d.1'X'C, Reed-Solomon. Pcterstm, Berlekanip-Massey. Euklid. CIRC1 Title: Rood-Solomon codes and applications Author: Pavel llora.1 Department: Department of Algebra Supervisor: Doc. HXDr. Ales Drapal, CSc. Supervisor's e-mail address: drapal (fkarlin.nirl.ouni.c/ Alislracl: This work presents compact definition of classic Heed-Solomon codes with necessary elements of coding theory. The ryclicity of RS codes of length q - 1 is prooved and there are comletely described three decoding algorithms (Peterson's, Berlekamp-Ma,ssoy and Euclid decoding algorithm) based on RS cyclirity. I also in- troduce a few RS...

Institution: Charles University Faculties (theses) (web)
Document availability information: Available in the Charles University Digital Repository.
Original record: http://hdl.handle.net/20.500.11956/5824

Permalink: http://www.nusl.cz/ntk/nusl-272020


The record appears in these collections:
Universities and colleges > Public universities > Charles University > Charles University Faculties (theses)
Academic theses (ETDs) > Bachelor's theses