Minimal Linear Codes Constructed from Sunflowers.

Sunflower in coding theory is a class of important subspace codes and can be used to construct linear codes. In this paper, we study the minimality of linear codes over F q constructed from sunflowers of size s in all cases. For any sunflower, the corresponding linear code is minimal if s ≥ q + 1 , and not minimal if 2 ≤ s ≤ 3 ≤ q . In the case where 3 < s ≤ q , for some sunflowers, the corresponding linear codes are minimal, whereas for some other sunflowers, the corresponding linear codes are not minimal. [ABSTRACT FROM AUTHOR]