title
  

Linear complementary pair of group codes over finite chain rings

Warning The system is temporarily closed to updates for reporting purpose.

Güneri, Cem and Martinez-Moro, Edgar and Sayıcı, Selcen (2020) Linear complementary pair of group codes over finite chain rings. Designs, Codes, and Cryptography . ISSN 0925-1022 (Print) 1573-7586 (Online) Published Online First http://dx.doi.org/10.1007/s10623-020-00792-1

[img]PDF - Registered users only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
265Kb

Official URL: http://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:LCP of codes; Group codes; Finite chain rings; Code equivalence
Subjects:Q Science > QA Mathematics > QA150-272.5 Algebra
ID Code:40299
Deposited By:Cem Güneri
Deposited On:18 Sep 2020 18:19
Last Modified:18 Sep 2020 18:19

Repository Staff Only: item control page