Linear and group perfect codes over skew fields and quasi skew fields

12/08/2022
by   Sergei A. Malyugin, et al.
0

In this paper, we propose a general construction of linear perfect codes over infinite skew fields and quasi skew fields with right (left) unity. A complete classification of such codes over associative skew fields is given. Since the cardinality of the considered skew fields is infinite, the constructed codes have an infinite length. In the previous work, we considered codes over infinite countable fields, the length of which was also countable. We now remove this restriction and consider that the cardinality of the skew field and the length of the codes can be arbitrary (not necessarily countable).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/01/2017

A generalized concatenation construction for q-ary 1-perfect codes

We consider perfect 1-error correcting codes over a finite field with q ...
research
11/01/2021

On the number of q-ary quasi-perfect codes with covering radius 2

In this paper we present a family of q-ary nonlinear quasi-perfect codes...
research
12/16/2021

q-ary Propelinear Perfect Codes from the Regular Subgroups of the GA(r,q) and Their Ranks

We propose a new method of constructing q-ary propelinear perfect codes....
research
08/21/2021

A subfield-based construction of optimal linear codes over finite fields

In this paper, we construct four families of linear codes over finite fi...
research
05/24/2019

A concatenation construction for propelinear perfect codes from regular subgroups of GA(r,2)

A code C is called propelinear if there is a subgroup of Aut(C) of order...
research
01/21/2019

Reed-Solomon Codes over Fields of Characteristic Zero

We study Reed-Solomon codes over arbitrary fields, inspired by several r...
research
07/24/2019

Classification of linear codes using canonical augmentation

We propose an algorithm for classification of linear codes over differen...

Please sign up or login with your details

Forgot password? Click here to reset