@phdthesis{Saleemi12,
Author = {Mehwish Saleemi},
Title = {Coding Theory via Groebner Bases.},
Year = {(2012).},
Month = {October},
Note = {AEG},
Series = {20121029-phdthesis-saleemi.pdf},
Address = {Hamburg / Germany},
Isbn = {10.15480/882.1081},
Howpublished = {12-05 Saleemi12 PhD},
Type = {Ph.D. Thesis.},
School = {Hamburg University of Technology},
Institution = {School of Electrical Engineering, Computer Science and Mathematics},
Abstract = {Coding theory plays an important role in efficient transmission of data over noisy channels. In this thesis efficient encoding procedure for linear codes is developed using an algebraic approach. Description of linear codes as ideals in a residue class ring are given in terms of Groebner basis. While investigating primitive Reed Muller codes, a special family of linear codes with designed Hamming distance is obtained. A result proves their superiority over existing primitive Reed Muller codes. Furthermore, codes associated to a particular binomial ideal, defined as a sum of toric ideal and a prime ideal, are explored through minimal generators and Groebner basis. For these non-toric binomial ideals universal Groebner bases, Graver bases and circuits are also found. It is shown that each such binomial ideal has a natural reduced Groebner basis which provides a very compact encoding procedure. Finally, the binomial ideal of a linear code is presented in terms of its syzygy modules and the corresponding finite free resolution is also given.}
}
@COMMENT{Bibtex file generated on 2024-9-8 with typo3 si_bibtex plugin. Data from https://www.tuhh.de/es/home/publications }