On linear codes with random multiplier vectors and the maximum trace dimension property

Let CC be a linear code of length nn and dimension kk over the finite field Fqm{{\mathbb{F}}}_{{q}^{m}}. The trace code Tr(C){\rm{Tr}}\left(C) is a linear code of the same length nn over the subfield Fq{{\mathbb{F}}}_{q}. The obvious upper bound for the dimension of the trace code over Fq{{\mathbb{F...

Deskribapen osoa

Xehetasun bibliografikoak
Egile Nagusiak: Erdélyi Márton, Hegedüs Pál, Kiss Sándor Z., Nagy Gábor P.
Formatua: Artikulua
Hizkuntza:English
Argitaratua: De Gruyter 2024-02-01
Saila:Journal of Mathematical Cryptology
Gaiak:
Sarrera elektronikoa:https://doi.org/10.1515/jmc-2023-0022