Güneri, Cem and Martínez-Moro, Edgar and Sayıcı, Selcen (2020) Linear complementary pair of group codes over finite chain rings. Designs, Codes, and Cryptography, 88 (11). pp. 2397-2405. ISSN 0925-1022 (Print) 1573-7586 (Online)
This is the latest version of this item.
Official URL: https://dx.doi.org/10.1007/s10623-020-00792-1
Abstract
Linear complementary dual (LCD) codes and linear complementary pair (LCP) of codes over finite fields have been intensively studied recently due to their applications in cryptography, in the context of side channel and fault injection attacks. The security parameter for an LCP of codes (C, D) is defined as the minimum of the minimum distances d(C) and d(D⊥). It has been recently shown that if C and D are both 2-sided group codes over a finite field, then C and D⊥ are permutation equivalent. Hence the security parameter for an LCP of 2-sided group codes (C, D) is simply d(C). We extend this result to 2-sided group codes over finite chain rings.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Code equivalence; Finite chain rings; Group codes; LCP of codes |
| Divisions: | Faculty of Engineering and Natural Sciences |
| Depositing User: | Cem Güneri |
| Date Deposited: | 03 Aug 2023 15:34 |
| Last Modified: | 03 Aug 2023 15:34 |
| URI: | https://research.sabanciuniv.edu/id/eprint/46840 |
Available Versions of this Item
-
Linear complementary pair of group codes over finite chain rings. (deposited 18 Sep 2020 18:19)
- Linear complementary pair of group codes over finite chain rings. (deposited 03 Aug 2023 15:34) [Currently Displayed]
Actions (login required)
- View Item