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...

全面介紹

書目詳細資料
發表在:Journal of Mathematical Cryptology
Main Authors: Erdélyi Márton, Hegedüs Pál, Kiss Sándor Z., Nagy Gábor P.
格式: Article
語言:英语
出版: De Gruyter 2024-02-01
主題:
在線閱讀:https://doi.org/10.1515/jmc-2023-0022

相似書籍