Work

Minimal Linear Codes Constructed from partial spreads

Year: 2023

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2305.05320

Authors: Lu, W., Wu, X., Cao, X. W., Luo, G. J., Qin, X. P.

Institutions: Southeast University, Nanjing University of Aeronautics and Astronautics, Nanyang Technological University

Language: English

Topic: Coding theory and cryptography

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W4376122909

Cites:

Cited by:

Related to: 10