2023/05/09 by Wei Lu, Xianyi Wu, Lu, W. +7
Computer Science · Engineering · #Coding theory and cryptography #Cooperative Communication and Network Coding #Advanced Wireless Network Optimization
paper · pdf · doi:10.48550/arxiv.2305.05320
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.