Kam-chan Lo. / Thesis (M.Phil.)--Chinese University of Hong Kong. / Bibliography: leaf 11.

Graduation date: 1991

Thesis--Universiteit te Utrecht, 1927.

Thesis--Albertus-Universität. / Cover-title. Lebenslauf.

Thesis--Rijksuniversiteit te Groningen, 1932. / Includes bibliographical references.

Thesis (Ph. D.)--University of Wisconsin--Madison, 1981. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 183-185).

Definition: Let k be an algebraically closed field. An algebraic monoid is a triple (E,m,l) such that E is an algebraic variety defined over k, m : ExE → E is an associative morphism and 1 € E is a two—sided unit for m. The object of this thesis is to expose several fundamental topics in the theory of algebraic monoids. My results may be divided into three types; general theory of irreducible affine monoids, structure and classification of semi—simple rank one reductive monoids, and theory of general monoid varieties (not necessarily affine). I General Theory of Affine Monoids II Reductive Monoids of Semi-simple Rank One III General Monoid Varieties [Please see document for entire abstract] / Science, Faculty of / Mathematics, Department of / Graduate

published_or_final_version / Mathematics / Master / Master of Philosophy

by Ho Kin Ming. / Thesis (M.Phil.)--Chinese University of Hong Kong, 1999. / Includes bibliographical references (leaves 68-69). / Abstracts in English and Chinese. / Chapter 0 --- Introduction --- p.5 / Chapter 1 --- Introduction to Coding Theory --- p.9 / Chapter 1.1 --- Definition of a code --- p.10 / Chapter 1.2 --- Maximum Likelihood Decoding --- p.11 / Chapter 1.3 --- Syndrome Decoding --- p.12 / Chapter 1.4 --- Two Kinds of Errors and Concatenated Code --- p.14 / Chapter 2 --- Basic Knowledge of Algebraic Curve --- p.16 / Chapter 2.1 --- Affine and Projective Curve --- p.16 / Chapter 2.2 --- Regular Functions and Maps --- p.17 / Chapter 2.3 --- Divisors and Differential forms --- p.19 / Chapter 2.4 --- Riemann-Roch Theorem --- p.21 / Chapter 3 --- Construction of Algebraic Geometric Code --- p.23 / Chapter 3.1 --- L-construction --- p.23 / Chapter 3.2 --- Ω -construction --- p.24 / Chapter 3.3 --- Duality --- p.26 / Chapter 4 --- Basic Error Processing --- p.28 / Chapter 4.1 --- Error Locators and Syndromes --- p.28 / Chapter 4.2 --- Finding an Error Locator --- p.29 / Chapter 5 --- Full Error Processing for Code on Curve of Genus1 --- p.34 / Chapter 5.1 --- Syndrome table --- p.34 / Chapter 5.2 --- Syndrome table --- p.36 / Chapter 5.3 --- The algorithm of Full Error Processing --- p.38 / Chapter 5.4 --- A simple Example --- p.40 / Chapter 6 --- General Full Error Processing --- p.47 / Chapter 6.1 --- Row Candidate and Column Candidate --- p.47 / Chapter 6.2 --- Consistency --- p.49 / Chapter 6.3 --- Majority voting --- p.50 / Chapter 6.4 --- Example --- p.53 / Chapter 7 --- Application of Algebraic Geometric Code --- p.60 / Chapter 7.1 --- Communication --- p.60 / Chapter 7.2 --- Cryptosystem --- p.62 / Bibliography

Thesis--Universiteit te Utricht, 1937. / "Literatur": p. 93-95.