Rank and pairs of Rank and Dimension of Kernel of ℤ_pℤ_p^2-linear codes

07/26/2022
by   Xiaoxiao Li, et al.
0

A code C is called ℤ_pℤ_p^2-linear if it is the Gray image of a ℤ_pℤ_p^2-additive code. For any prime number p larger than 3, the bounds of the rank of ℤ_pℤ_p^2-linear codes are given. For each value of the rank and the pairs of rank and the dimension of the kernel of ℤ_pℤ_p^2-linear codes, we give detailed construction of the corresponding codes. Finally, as an example, the rank and the dimension of the kernel of ℤ_5ℤ_25-linear codes are studied.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/27/2022

ℤ_pℤ_p^2-linear codes: rank and kernel

A code C is called _p_p^2-linear if it is the Gray image of a _p_p^2-add...
research
06/04/2018

On the computational complexity of blind detection of binary linear codes

In this work, we study the computational complexity of the Minimum Dista...
research
01/30/2020

Rank and Kernel of F_p-Additive Generalised Hadamard Codes

A subset of a vector space F_q^n is K-additive if it is a linear space o...
research
09/27/2018

Spanoids - an abstraction of spanning structures, and a barrier for LCCs

We introduce a simple logical inference structure we call a spanoid (gen...
research
04/14/2021

Eluder Dimension and Generalized Rank

We study the relationship between the eluder dimension for a function cl...
research
04/22/2020

On certain linearized polynomials with high degree and kernel of small dimension

Let f be the F_q-linear map over F_q^2n defined by x x+ax^q^s+bx^q^n+s w...
research
04/07/2021

Valued rank-metric codes

In this paper, we study linear spaces of matrices defined over discretel...

Please sign up or login with your details

Forgot password? Click here to reset