On maximum distance separable group codes with complementary dual

01/03/2018
by   Saikat Roy, et al.
0

Given an LCD group code C in a group algebra KG, we inspect kinship between C and G, more precisely between the subgroup structures of G and C. When C is MDS, the inter relation between K and G becomes more impressive. Application of Sylow theorem facilitated us to explore the inter relation between G and K (when C is LCD and MDS) in more general way and finally we get the result of Cruz and Willems (Lemma 4.4) as a simple sequel.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/03/2018

On maximum distance separable group codes with complementary duals

Given an LCD group code C in a group algebra KG, we inspect kinship betw...
research
09/16/2020

Twisted Reed-Solomon Codes With One-dimensional Hull

The hull of a linear code is defined to be the intersection of the code ...
research
01/14/2019

Linear complementary dual, maximum distance separable codes

Linear complementary dual (LCD) maximum distance separable (MDS) codes a...
research
01/21/2022

Classification and count of binary linear complementary dual group codes

We establish a complete classification of binary group codes with comple...
research
02/15/2020

On the dimension of ideals in group algebras, and group codes

Several relations and bounds for the dimension of principal ideals in gr...
research
10/18/2019

Infinite families of near MDS codes holding t-designs

An [n, k, n-k+1] linear code is called an MDS code. An [n, k, n-k] linea...
research
12/21/2020

MDS linear codes with one dimensional hull

We define the Euclidean hull of a linear code C as the intersection of C...

Please sign up or login with your details

Forgot password? Click here to reset