Special bent and near-bent functions (Q2437958): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4235916564 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1308.6373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cryptographic properties of the cosets of R(1, m) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing bent functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4115154 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplicative difference sets via additive characters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cubic bent functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of bent functions from near-bent functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ``bent'' functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934423 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3062288 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:20, 7 July 2024

scientific article
Language Label Description Also known as
English
Special bent and near-bent functions
scientific article

    Statements

    Special bent and near-bent functions (English)
    0 references
    0 references
    10 March 2014
    0 references
    A function \(F:\mathbb F_2^{2t}\to \mathbb F_2\) is called \textit{bent} if all its Fourier coefficients are in \(\{\pm 2^t\}\); a function \(f:\mathbb F_2^{2t-1}\to \mathbb F_2\) is called \textit{near-bent} if all its Fourier coefficients are in \(\{0,\pm 2^t\}\). Let \(F\) be a bent function on \(\mathbb F_2^{2t}\) written in the form \[ F(x,y)=(y+1)f_0(x)+yf_1(x), \quad x\in\mathbb F_2^{2t-1},\;y\in\mathbb F_2. \] Then \(f_0\) and \(f_1\) are near-bent functions on \(\mathbb F_2^{2t-1}\). The bent function \(F\) is said to have property \((\mathcal Ti)\), where \(i\in\{0,1\}\), if \(f_0+f_1=\text{tr}+i\), where \(\mathbb F_2^{2t-1}\) is identified with \(\mathbb F_{2^{2t-1}}\) and \(\text{tr}=\text{tr}_{\mathbb F_{2^{2t-1}}/\mathbb F_2}\); it is said to have property \((\mathcal C)\) if \(D_1f_0=0\), where \((D_1f_0)(x)=f_0(x+1)-f_0(x)\), \(x\in\mathbb F_{2^{2t-1}}\). The main results of the paper, Theorems 1, 2, 4, 5, 7 and Corollary 3, can be summarized as follows. (i) If \(f_0\) is near-bent and \(D_1f_0=\xi\) (constant), then \(F=(y+1)f_0+y(f_0+\text{tr})\) is bent. (ii) If \(F=(y+1)f_0+yf_1\) is bent with property \((\mathcal T0)\), then \(D_1\widetilde f_i=i\), \(i=1,2\), where \(\widetilde F=(y+1)\widetilde f_0+y \widetilde f_1\) is the dual of \(F\). (iii) If \(F\) is self dual bent and has property \((\mathcal T0)\), then it has property \((\mathcal C)\). (iv) If \(F=(y+1)f_0+yf_1\) is bent with property \((\mathcal T0)\) and \(D_1f_0=\xi\), then \(\widetilde f_0+\widetilde f_1=\text{tr}+\xi\). (v) If \(F\) is bent with property \((\mathcal T\xi)\), then \(\overline F_i=(y+1)\widetilde f_i+y(\widetilde f_i+\text{tr})\) is bent for \(i=1,2\). Moreover, \(\widetilde{\overline F}_\xi\) (the dual of \(\overline F_\xi\)) has both properties \((\mathcal C)\) and \((\mathcal T\xi)\). Starting with a near-bent function \(f_0\) with \(D_1f_0=\xi\), or a bent function \(F\) with property \((\mathcal T\xi)\), one can use (i) and (v) to derive additional and sometimes new bent functions.
    0 references
    bent functions
    0 references
    near-bent functions
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references