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

05/27/2022
by   Minjia Shi, 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, where p>2 is prime. In this paper, the rank and the dimension of the kernel of _p_p^2-linear codes are studied. Two bounds of the rank of a _3_9-linear code and the dimension of the kernel of a _p_p^2-linear code are given, respectively. For each value of these bounds, we give detailed construction of the corresponding code. Finally, pairs of rank and the dimension of the kernel of _3_9-linear codes are also considered.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/26/2022

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

A code C is called ℤ_pℤ_p^2-linear if it is the Gray image of a ℤ_pℤ_p^2...
research
06/28/2022

ℤ_pℤ_p^2-additive cyclic codes: kernel and rank

A code C = Φ(𝒞) is called ℤ_p ℤ_p^2-linear if it's the Gray image of the...
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
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
09/05/2018

IKA: Independent Kernel Approximator

This paper describes a new method for low rank kernel approximation call...
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
02/01/2018

How many weights can a linear code have?

We study the combinatorial function L(k,q), the maximum number of nonzer...

Please sign up or login with your details

Forgot password? Click here to reset