Proofs of several conjectures on linear codes from Boolean functions

Abstrakt

Ding (2016) introduced a generic construction of linear codes over F-p from a subset of F(p)m. Many combinatorially interesting sets give rise to codes with good parameters under this generic construction.

Ding also provided a set of interesting conjectures related to the properties of several sets arising from vectorial Boolean functions and their corresponding linear codes under this construction. In this paper we prove four of these conjectures (Conjectures 38-41). (C) 2018 Elsevier B.V.

All rights reserved.

Klíčová slova

• Proofs
• several
• conjectures
• linear
• codes
• Boolean
• functions