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

03/31/2023
by   Sanjit Bhowmick, et al.
0

We provide a simple proof for a complementary pair of group codes over a finite non-commutative Frobenius ring of the fact that one of them is equivalent to the other one. We also explore this fact for checkeable codes over the same type of alphabet.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/24/2020

Linear complementary pair of group codes over finite principal ideal rings

A pair (C, D) of group codes over group algebra R[G] is called a linear ...
research
12/06/2019

Linear Complementary Pair Of Abelian Codes over Finite Chain Rings

Linear complementary dual (LCD) codes and linear complementary pair (LCP...
research
08/11/2021

Group LCD and Group Reversible LCD Codes

In this paper, we give a new method for constructing LCD codes. We emplo...
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
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
08/18/2022

On the Classification of Codes over Non-Unital Ring of Order 4

In the last 60 years coding theory has been studied a lot over finite fi...
research
03/20/2019

Some remarks on non projective Frobenius algebras and linear codes

With a small suitable modification, dropping the projectivity condition,...

Please sign up or login with your details

Forgot password? Click here to reset