A note on linear complementary pairs of group codes

Abstract: We give a short and elementary proof of the fact that for a linear complementary pair

(C, D)

, where

C

and

D

are

2

-sided ideals in a group algebra,

D

is uniquely determined by

C

and the dual code

D^{p} e r p

is permutation equivalent to

C

. This includes earlier results of Carlet et al. and G"uneri et al. on nD cyclic codes which have been proved by subtle and lengthy calculations in the space of polynomials.

Review text

This short note is dedicated to complimentary pairs of group codes. In recent years, talking about codes, a lot of attention was given to linear complimentary dual codes (LCD). LCDs were introduced by Massey and, as the name suggests, are such that \(C\cap C^\bot=0\). As it was shown, LCD can be used in protection against side channel and fault infection attacks and in the case of LCDs the security parameter is given by \(\min\{\operatorname{d}(C),\operatorname{d}(D^\bot)\}=\operatorname{d}(C).\) The authors give a new and simplified proof of the fact that given a linear complimentary pair \((C, D),\) where both spaces are 2-sided ideals in a group algebra, then \(D\) is determined by the code \(C\) and its dual \(D^\bot\) is permutational equivalent to \(C\).

Recommendations

Cites work

Cited in

(17)

This page was built for publication: A note on linear complementary pairs of group codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2185905)