|
Data transmition security with Reed-Solomon codes
Šalanský, Jan ; Šporik, Jan (referee) ; Němec, Karel (advisor)
This Bachelor thesis deals with the security of data transmission by Reed-Solomon codes. It discusses the design of the code, coding method and primarily decoding facility. There are described particular phases of decoding: the computation of the Syndrome, determination of an error locator polynomial, finding of positions of false symbols by Chien search and calculation of error values using the Forney’s algorithm. It compares these basic algorithms to find the polynomial localization errors: Peterson-Gorenstein-Zierler algorithm, Berlekamp-Massey algorithm and the extended Euclidean algorithm. There is shown a detailed design and software implementation of a simple system with forward error correction based on these theoretical findings. Design of the system begins by selecting the appropriate Reed-Solomon code RS (63,39). Next step is construction of basic algebraic structures for this code and derivation of encoder and decoder. Design of system with forward error correction finishes by calculation of encoding and decoding. The final system with forward error correction has been programmed for platforms MS Windows and Linux. It has been based on previous calculations and examples in references.
|
|
2D barcode recognition system
Sedlář, Martin ; Richter, Miloslav (referee) ; Petyovský, Petr (advisor)
This bachelor’s thesis deals with 2D barcode reading. At the beginning a brief overview of the most used barcodes is shown. The work mainly deals with QR codes. Their structure, composition and rules for encoding and decoding are explained. Problems with arrangement of photographic scene are solved too. C++ algorithm for QR code reading is described with usage of the OpenCV library.
|
|
Data transmition security with general linear block codes
Dzurenda, Petr ; Tejkal, Vladimír (referee) ; Němec, Karel (advisor)
This work deals with problematic basic characteristic common linear block codes, concretely with creation generating and controlling matrix and individual ways decoding common linear block codes and then are theoretic knowledge used in the next part bachelor’s thesis. Next part this work is bent on the concrete layout of common liner block code satisfactory specifications by submission. In this part it can by find way haw create generating matrix be able to correcting tree single errors then create control matrix for decoding and correct network for correcting errors. Programs are used in this work are explained there. In the end this part is example of coding and decoding. Lastly work is realization codec. In this part is description of coder and decoder realizations. This codec is simulating by program Matlab Simulink in part five. In last part are create boards of printed circuits by program Eagle for coder and decoder.
|
|
Simulacrum, Hyperreality and Aesthetic Codes of The Presidential Campaign
SPUSTOVÁ, Kateřina
The relations among simulacrum, hyperreality, aesthetic codes and post-modern society are within the scope of my bachelor thesis. I primarily focuse on political apparatus and its relations to phenomena mentioned. As foundations, I have chosen philosophical reflections on simulacra and hyperreality - authors whom I cite are particularly Jean Baudrillard, Roland Barthes and Michel Foucault. Another writings are considered as well, for example writings which are occupied with changes in society, in language or writings which are occupied with media. My thesis attempts to describe chronological development of every single feature as regards contemporary society.
|
|
Lattices and Codes
Rytíř, Pavel ; Loebl, Martin (advisor) ; Pangrác, Ondřej (referee)
This thesis studies triangular con gurations, binary matroids, and integer lattices generated by the codewords of a binary code. We study the following hypothesis: the lattice generated by the codewords of a binary code has a basis consisting only of the codewords. We prove the hypothesis for the matroids with the good ear decomposition. We study the operation of edge contraction in the triangular con gurations. Especially in cycles and acyclic triangular con gurations. For an arbitrary graph we nd a triangular con guration with the skeleton containing this graph as a minor. For every binary matroid we construct a triangular con guration such that the matroid is a minor of the con guration. We prove that between the cycle spaces of the matroid and the con guration exists a bijection. The bijection maps the circuits of the matroid to the circuits of the con guration.
|
|
Conversion of Models of Regular Languages
Navrkal, David ; Kučera, Jiří (referee) ; Křivka, Zbyněk (advisor)
p { margin-bottom: 0.08in; direction: ltr; color: rgb(0, 0, 0); line-height: 150%; widows: 2; orphans: 2; }p.western { font-family: "Times New Roman",serif; font-size: 11pt; }p.cjk { font-family: "Times New Roman",serif; font-size: 11pt; }p.ctl { font-family: "Times New Roman",serif; font-size: 12pt; } My thesis deals with how to didactically demonstrate models of regular languages focusing on their mutual conversions. These conversions are transformation of regular expressions to finite automata (FA), remove epsilon rules from FA and determinization FA. The goal was implement demonstration of these transformations in an application. In this thesis I document development of this application. This application was programmed in language C++ using graphic library Qt 5. The application was developed in an operating system (OS) Linux and tested in OS Microsoft Windows 7. All these conversions are implemented. The application is user-friendly, intuitive and functional. The application was not tested on a wider sample of students. As the main benefit, the application can help students of formal languages and finite automata better understand this theory using didactical examples. Source codes of this project (regularConvertor) are available online on Github server.
|
|
Attitude of the European Union Towards Genetically Modified Foods
PŇÁČKOVÁ, Štěpánka
This undergraduate thesis deals with the progressive process of some plant´s transformation into cultivated plants and its consequential plant selection by man, up to actual evolution, which is characterised by genetic engineering. Man´s manipulation with the genetic codes of organisms carries its advantages and possible risks which are projected into the attitudes towards production and consumption genetically modified foods. This matter is a frequently discussed theme in Europe, whereas GMO have as opposition as well as supporters. This fact is reflected in the legislation of the European Union, which specifies strict conditions and precautions for GMO.
|
|
Lineární kódy nad okruhy
Kobrle, Tomáš ; Šťovíček, Jan (advisor) ; Příhoda, Pavel (referee)
This master thesis focus on special type of rings called path algebras with a goal to define and describe codes over these rings. The path algebras are defined by graphic structures called quivers which is transferred also on the modules of the path algebra. Codes themselves are defined over indecomposible injective modules of path algebra considering the latest result in ring-coding theory. So defined codes allow us to study the parameters and the versions of elementary theorems from theory of linear codes over fields for codes over rings. These are about duals codes especially, the MacWilliams identity theorem and about code equivalency. Finally we get back to path algebras and describe a way to make them applicable in theory of codes over rings.
|
|
AS-I customer modul
Varga, Tomáš ; Bradáč, Zdeněk (referee) ; Štohl, Radek (advisor)
Bachelor thesis consists of three parts. First part describes and gives closer look at communication network AS-Interface. Based on the first theoretical part is proposed device managed by microprocesor - type slave, as memory for at least 8 alphanumerical signs. In the second part we find proposal of scheme wiring in Eagle lyer editor 4.12 program and proposal of circuit board. The circuit board has been manufactured and components installed according to the proposal. Finished circuit board was subsequently revived. The third part of the thesis is dedicated to programming. The source codes were written by using the C programming language. The program has been then recorded into microprocessor.
|
|
Reed-Solomon codes and applications
Horal, Pavel ; Vojtěchovský, Petr (referee) ; Drápal, Aleš (advisor)
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...
|
guest ::
