Group codes over fields are asymptotically good

04/24/2019
by   Martino Borello, et al.
0

Group codes are right or left ideals in a group algebra of a finite group over a finite field. Following ideas of Bazzi and Mitter on group codes over the binary field, we prove that group codes over finite fields of any characteristic are asymptotically good. On the way we extend a result of Massey on the fractional weight of distinct binary n-tuples and a result of Piret on an upper bound on the weight distribution of a binary code to any finite field.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/26/2020

Dihedral group codes over finite fields

Bazzi and Mitter [3] showed that binary dihedral group codes are asympto...
research
12/26/2022

Twisted skew G-codes

In this paper we investigate left ideals as codes in twisted skew group ...
research
10/23/2020

Relative projective group codes over chain rings

A structure theorem of the group codes which are relative projective for...
research
01/30/2019

On checkable codes in group algebras

We classify, in terms of the structure of the finite group G, all group ...
research
06/18/2019

Asymptotic performance of metacyclic codes

A finite group with a cyclic normal subgroup N such that G/N is cyclic i...
research
09/08/2023

External Codes for Multiple Unicast Networks via Interference Alignment

We introduce a formal framework to study the multiple unicast problem fo...
research
02/02/2021

On Skew Convolutional and Trellis Codes

Two new classes of skew codes over a finite field are proposed, called ...

Please sign up or login with your details

Forgot password? Click here to reset