|
|
Group rings in coding theory
Horáček, Jan ; Žemlička, Jan (advisor) ; Šťovíček, Jan (referee)
This work is focused on linear error-correcting codes in group rings. The basic introduc- tion to group rings and to coding in group rings is given. By code we mean a R-submodul, which generalizes the definition of the code as an ideal. We describe unit-derived and zero- divisor codes. We test paramaters of unit-derived codes. The construction of LDPC codes without short cycles is explained. Except from the derivation of the generator and check matrix we focus on algebraic properties of codes and group rings. We also deal with the self-dual codes, reversible codes or number of units in a finite group algebra of a cyclic group. 1
|
|
|
Specific cultural units in communicational codes of Czech and American television series
Stařík, Jakub ; Reifová, Irena (advisor) ; Bednařík, Petr (referee)
Diploma thesis "Specific cultural units in communicational codes of Czech and American television series" is a structural analysis of two televisional series: Czech Pojišťovna štěstí and American Desperate Houswives. Television series are modern myths that communicate values, belives and rules of certain societies. This thesis tries to approache distinctions in a langue-structure of analysed material. The research is based on findings of structuralism, poststructuralism and cultural studies. The thesis consists of two major parts. First is theoretical summary of the basic thoughts that appeared during historical shift from structuralism to cultural studies. The second part is analysis itself.
|
|
|
Codes, rings and modules
Horáček, Jan ; Žemlička, Jan (advisor) ; Šťovíček, Jan (referee)
This work is focused on linear error-correcting codes over chain rings. By a linear code over a chain ring R of length n, we mean a R-submodule of the module Rn . The basic introduction to the theory of finite commutative chain rings and linear codes over them is given. We especially emphasize here their al- gebraic description. Minimal homogenous and Hamming distances of these codes are extensively studied. We explain, how the generalized Gray map can transform linear codes over a chain ring into general non-linear codes over a field. We deal with the construction of linear codes over a chain ring and the construction of generator matrices based on random generation is described. Obtained codes are compared with known results.
|
|
|
Quasi-monoidic codes
Snítilá, Jitka ; Žemlička, Jan (advisor) ; Šťovíček, Jan (referee)
This thesis focuses on the problem of the key size in McEliece cryptosystem and its solution using quasi- monoidic codes, especially quasi-monoidic Goppa codes. Required theory of quasi-monoidic Cauchy matrices and Goppa codes is introduced along with algebraic structures necessary for quasi-monoidic codes description. Suitable Abelian groups for this class of codes are specified. This thesis also presents efficient algorithms for constructing quasi-monoidic Cauchy matrices and quasi-monoidic Goppa codes. Reduction of the key size using this class of algebraic codes is presented as well. Powered by TCPDF (www.tcpdf.org)
|
|
|
Division rings in coding theory
Svatoňová, Petra ; Žemlička, Jan (advisor) ; Holub, Štěpán (referee)
Wireless communication using multiple transmit and receive antennas is very effective when suitable space-time codes are used. Reliability of codes for com- munication can be assessed using various criteria. One of the basic is the Rank Criterion. In the presented work, we focus on this criterion and using division algebras we construct space-time block codes that satisfy it. First, we introduce the general construction. Then we apply it to create specific examples of division algebras and respective codes. At the end, we follow up with the Coding Gain Criterion - we present the Golden Code and using division algebras we outline general construction of perfect space-time codes.
|
|
|
Group rings in coding theory
Horáček, Jan ; Žemlička, Jan (advisor) ; Šťovíček, Jan (referee)
This work is focused on linear error-correcting codes in group rings. The basic introduc- tion to group rings and to coding in group rings is given. By code we mean a R-submodul, which generalizes the definition of the code as an ideal. We describe unit-derived and zero- divisor codes. We test paramaters of unit-derived codes. The construction of LDPC codes without short cycles is explained. Except from the derivation of the generator and check matrix we focus on algebraic properties of codes and group rings. We also deal with the self-dual codes, reversible codes or number of units in a finite group algebra of a cyclic group. 1
|
|
|
Prototypization,archetypization and mytologization in Avatar
Richterová, Sára ; Šoltys, Otakar (advisor) ; Kučera, Štěpán (referee)
This thesis called "Prototypization, archetypization and mythologization in Avatar" deals with movie, which took the first place in audience ratings. Long-awaited, high-budget movie Avatar has become a landmark in film industry by utilizing the latest technology in making mores and influenced the creation of movies, that came after him. The first part is devoted to theories of semiotics and definition of science fiction with subgeneres, which are utilized in to construction of narration. The second part of thesis is focused on narrative, musical, speech and image analysis. Theories and proceduries, which are marked out on previous chapters, are here applied on each of the movie scene. Commencement of movie with 3D effects aroused the intereset of the audience to regularly visit a cinema again. This thesis studies the impact of the new phenomenon on quality of workmanship and tone of the story first shot with the help of new technology. The story line goes back to the myths, that are already functional and creates their own semiotic space with the help of their best practices. This movie is using superficial prettiness and trying to impress the viewer senses, with perfectly sophisticated virtual reality and protruding images and all of that is for reaching success. Avatar became here as a new...
|
|
| |
|
| |
|
| |
guest ::
