Please use this identifier to cite or link to this item: http://hdl.handle.net/10603/564289
Title: On some special classes of linear and additive codes over finite commutative chain rings
Researcher: Yadav, Monika
Guide(s): Sharma, Anuradha
Keywords: Mathematics
Physical Sciences
University: Indraprastha Institute of Information Technology, Delhi (IIIT-Delhi)
Completed Date: 2024
Abstract: Self orthogonal codes, self-dual codes, and linear codes with complementary duals (LCD codes) constitute the three most important and well studied classes of linear codes. These codes have nice algebraic structures and are of great significance both from the practical and theoretical points of view. Self-orthogonal and self-dual codes have nice connections with the theory of designs and are useful in constructing secret-sharing schemes with nice access structures. LCD codes are useful in designing orthogonal direct-sum masking schemes, which protect sensitive information against side-channel attacks (SCA) and fault injection attacks (FIA). In the 1990s, it was shown that many binary non-linear codes can be viewed as Gray images of linear codes over the ring Z4 of integers modulo 4. Since then, much research has been devoted to studying self-orthogonal, self-dual, and LCD codes over finite commutative chain rings. In fact, the problem of the determination of enumeration formulae for self-orthogonal, self-dual, and LCD codes has attracted a great deal of attention, as these enumeration formulae are useful in classifying such codes up to equivalence. In this thesis, we obtain enumeration formulae for all self-orthogonal and self-dual codes of an arbitrary length over finite commutative chain rings of odd characteristic. As special cases, one can obtain enumeration formulae for self-orthogonal and self-dual codes over quasi-Galois rings and Galois rings of odd characteristic. However, we observe that this enumeration technique can not be extended to count all self-orthogonal and self-dual codes over quasi-Galois rings and Galois rings of even characteristic. We modify this enumeration technique and provide explicit enumeration formulae for all self-orthogonal and self-dual codes of an arbitrary length over quasi-Galois and Galois rings of even characteristic. We also obtain explicit enumeration formulae for all LCD codes of an arbitrary length over finite commutative chain rings.
Pagination: 371 p.
URI: http://hdl.handle.net/10603/564289
Appears in Departments:Department of Mathematics

Files in This Item:
File Description SizeFormat 
01-title.pdfAttached File60.19 kBAdobe PDFView/Open
02_prelim pages.pdf398.03 kBAdobe PDFView/Open
03_content.pdf363.57 kBAdobe PDFView/Open
04_abstract.pdf200.82 kBAdobe PDFView/Open
05_chapter 1.pdf474.95 kBAdobe PDFView/Open
06_chapter 2.pdf582.97 kBAdobe PDFView/Open
07_chapter 3.pdf924.31 kBAdobe PDFView/Open
08_chapter 4.pdf998.88 kBAdobe PDFView/Open
09_chapter 5.pdf1.11 MBAdobe PDFView/Open
10_annexures.pdf337.46 kBAdobe PDFView/Open
11_chapter 6.pdf990.01 kBAdobe PDFView/Open
12_chapter 7.pdf819.98 kBAdobe PDFView/Open
13_chapter 8.pdf971.75 kBAdobe PDFView/Open
80_recommendation.pdf281.06 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: