Families of Cyclic Codes over Finite Chain Rings
Abstract
A major difficulty in quantum computation and communication is preventing and correcting errors in the quantum bits. Most of the research in this area has focused on stabilizer codes derived from self-orthogonal cyclic error-correcting codes over finite fields. Our goal is to develop a similar theory for self-orthogonal cyclic codes over the class of finite chain rings which have been proven to also produce stabilizer codes. We also will discuss these restrictions on families of cyclic codes, including, but not limited to quadratic residue codes and Bose-Chaudhuri-Hocquenghem codes. Finally, we will extend the concepts of weight enumerators to the class of Frobenius rings and use them to derive bounds for our codes.
Citation
Nemec, Andrew Schmidt (2016). Families of Cyclic Codes over Finite Chain Rings. Undergraduate Research Scholars Program. Available electronically from https : / /hdl .handle .net /1969 .1 /167925.