Affiliation:
1. School of Mathematics, Southeast University, Nanjing 210096, China
Abstract
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 Fq 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.
Funder
National Natural Science Foundation of China
Subject
General Physics and Astronomy
Reference24 articles.
1. Linear codes from highly nonlinear functions and their secret sharing schemes;Carlet;IEEE Trans. Inf. Theory,2005
2. Towards secure two-party computation from the wire-tap channel;Lee;Proceedings of the ICISC 2013,2014
3. Covering and secret sharing with linear codes;Ding;Discrete Mathematics and Theoretical Computer Science,2003
4. Massey, J.L. (1993, January 22–27). Minimal codewords and secret sharing. Proceedings of the 6th Joint Swedish-Russian Workshop on Information Theory, Mölle, Sweden.
5. Secret sharing schemes from three classes of linear codes;Yuan;IEEE Trans. Inf. Theory,2006