Minimal Linear Codes Constructed from partial spreads
Information Theory
2023-05-10 v1 math.IT
Abstract
Partial spread is important in finite geometry and can be used to construct linear codes. From the results in (Designs, Codes and Cryptography 90:1-15, 2022) by Xia Li, Qin Yue and Deng Tang, we know that if the number of the elements in a partial spread is ``big enough", then the corresponding linear code is minimal. They used the sufficient condition in (IEEE Trans. Inf. Theory 44(5): 2010-2017, 1998) to prove the minimality of such linear codes. In this paper, we use the geometric approach to study the minimality of linear codes constructed from partial spreads in all cases.
Cite
@article{arxiv.2305.05320,
title = {Minimal Linear Codes Constructed from partial spreads},
author = {W. Lu and X. Wu and X. W. Cao and G. J. Luo and X. P. Qin},
journal= {arXiv preprint arXiv:2305.05320},
year = {2023}
}