Bent Vectorial Functions, Codes and Designs

DOI10.1109/TIT.2019.2922401zbMATH Open1433.94164arXiv1808.08487OpenAlexW2964020194MaRDI QIDQ5211519FDOQ5211519

Authors: Cunsheng Ding, Akihiro Munemasa, Vladimir D. Tonchev 

Publication date: 28 January 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: Bent functions, or equivalently, Hadamard difference sets in the elementary Abelian group $(gf(2^{2m}),+)$, have been employed to construct symmetric and quasi-symmetric designs having the symmetric difference property. The main objective of this paper is to use bent vectorial functions for a construction of a two-parameter family of binary linear codes that do not satisfy the conditions of the Assmus-Mattson theorem, but nevertheless hold $2$-designs. A new coding-theoretic characterization of bent vectorial functions is presented.

Full work available at URL: https://arxiv.org/abs/1808.08487

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Boolean functions (06E30) Boolean functions (94D10)

Cited In (14)

• Some two-weight codes invariant under the \(3\)-fold covers of the Mathieu groups \(\mathrm{M}_{22}\) and \(\Aut(\mathrm{M}_{22})\)
• Vectorial bent functions and linear codes from quadratic forms
• The linear codes of \(t\)-designs held in the Reed-Muller and simplex codes
• Several classes of new weakly regular bent functions outside \(\mathcal{RF}\), their duals and some related (minimal) codes with few weights
• Steiner systems \(S(2, 4, \frac{3^m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac{3^m-1}{2}\)
• Combinatorial \(t\)-designs from special functions
• Linear codes and incidence structures of bent functions and their generalizations
• Type IV-II codes over \(\mathbb{Z}_4\) constructed from generalized bent functions
• Combinatorial \(t\)-designs and strongly regular graphs from projective codes over finite fields
• Generic construction of Boolean functions with a few Walsh transform values of any possible algebraic degree
• Construction of self-orthogonal $$\mathbb {Z}_{2^k}$$-codes
• Expressing the minimum distance, weight distribution and covering radius of codes by means of the algebraic and numerical normal forms of their indicators
• Infinite families of \(t\)-designs and strongly regular graphs from punctured codes
• New characterizations and construction methods of bent and hyper-bent Boolean functions

This page was built for publication: Bent Vectorial Functions, Codes and Designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5211519)