Linear complementary pair of group codes over finite principal ideal rings

12/24/2020
by   Hualu Liu, et al.
0

A pair (C, D) of group codes over group algebra R[G] is called a linear complementary pair (LCP) if C ⊕ D =R[G], where R is a finite principal ideal ring, and G is a finite group. We provide a necessary and sufficient condition for a pair (C, D) of group codes over group algebra R[G] to be LCP. Then we prove that if C and D are both group codes over R[G], then C and D^⊥ are permutation equivalent.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/31/2023

On LCP and checkable group codes over finite non-commutative Frobenius rings

We provide a simple proof for a complementary pair of group codes over a...
research
04/02/2022

On the linear ℓ-intersection pair of codes over a finite principal ideal ring

Generalizing the linear complementary dual, the linear complementary pai...
research
07/17/2019

A Note on Linear Complementary Pairs of Group Codes

We give a short and elementary proof of the fact that for a linear compl...
research
05/20/2021

Constacyclic Codes over Commutative Finite Principal Ideal Rings

For any constacyclic code over a finite commutative chain ring of length...
research
08/08/2019

Subgroups of an abelian group, related ideals of the group ring, and quotients by those ideals

Let RG be the group ring of an abelian group G over a commutative ring R...
research
04/07/2020

Resultants over principal Artinian rings

The resultant of two univariate polynomials is an invariant of great imp...
research
02/06/2020

Generalized Pair Weights of Linear Codes and MacWilliams Extension Theorem

In this paper, we introduce the notion of generalized pair weights of an...

Please sign up or login with your details

Forgot password? Click here to reset