Sayıcı, Selcen (2020) On linear complementary pair of codes. [Thesis]
![[thumbnail of 10352729_Sayici__Selcen.pdf]](https://research.sabanciuniv.edu/style/images/fileicons/application_pdf.png)
10352729_Sayici__Selcen.pdf
Download (655kB)
Abstract
Linear complementary pair (C,D) of codes has drawn much attention recently due to their applications to cryptography, in the context of side channel and fault injection attacks. The security parameter of such a pair is defined to be the minimum of the minimum distances d(C) and d(D?). Carlet et al. showed that if C and D are both cyclic or both 2D cyclic over a finite field, then C and D? are equivalent codes. Hence d(C) = d(D?). We extend this result to all nD cyclic, or abelian, codes over finite fields. Moreover, we prove the same result for all linear complementary pair of 2-sided group codes over finite chain rings
Item Type: | Thesis |
---|---|
Uncontrolled Keywords: | Linear complementary pair of codes. -- abelian codes. -- group codes. -- code equivalence. -- finite fields. -- finite chain rings. -- Dogrusal bütünleyici çift kodları. -- abelyen kodlar. -- grup kodları. -- kod denkligi. -- sonlu cisimler. -- sonlu zincir halkaları. |
Subjects: | Q Science > QA Mathematics |
Divisions: | Faculty of Engineering and Natural Sciences > Basic Sciences > Mathematics Faculty of Engineering and Natural Sciences |
Depositing User: | IC-Cataloging |
Date Deposited: | 03 Nov 2020 09:32 |
Last Modified: | 26 Apr 2022 10:34 |
URI: | https://research.sabanciuniv.edu/id/eprint/41211 |