A note on linear complementary pairs of group codes (Q2185905)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7209402
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on linear complementary pairs of group codes |
scientific article; zbMATH DE number 7209402 |
Statements
A note on linear complementary pairs of group codes (English)
0 references
8 June 2020
0 references
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\).
0 references
group code
0 references
linear complementary pair (LCP)
0 references
0.9361323
0 references
0.9354674
0 references
0.9171601
0 references
0.9147934
0 references
0.9084583
0 references
0 references
0.9022099
0 references
0 references
0 references