2010•Unpublished venueRequires access

A New Class of Bent-Negabent Boolean Functions.

Sugata Gangopadhyay, Ankita Chaturvedi

Open publisher page 0 citations

Abstract

Abstract. In this paper we develop a technique of constructing bent– negabent Boolean functions by using complete mapping polynomials. Using this technique we demonstrate that for each ℓ ≥ 2 there exits bent– negabent functions on n = 12ℓ variables with algebraic degree n 4 + 1 =

About this research paper

What this paper is about

Abstract. In this paper we develop a technique of constructing bent– negabent Boolean functions by using complete mapping polynomials. Using this technique we demonstrate that for each ℓ ≥ 2 there exits bent– negabent functions on n = 12ℓ variables with algebraic degree n 4 + 1 =

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract. In this paper we develop a technique of constructing bent– negabent Boolean functions by using complete mapping polynomials. Using this technique we demonstrate that for each ℓ ≥ 2 there exits bent– negabent functions on n = 12ℓ variables with algebraic degree n 4 + 1 =

Key concepts: Bent molecular geometry, Boolean function, Bent function, Class (philosophy), Algebraic number, Degree (music), Discrete mathematics, Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
A New Class of Bent-Negabent Boolean Functions. — Research Paper | ScholarLens