Quadratic functions with prescribed spectra (Q1934217): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1975768884 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3062258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the construction of bent vectorial functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A construction of weakly and non-weakly regular bent functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bent Functions of Maximal Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Bent and Semi-Bent Quadratic Boolean Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Determining the Linear Complexity of Sequences Over<tex>$hboxGF,(p^m)$</tex>With Period<tex>$2^tn$</tex> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4823178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly degenerate quadratic forms over finite fields of characteristic 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trace forms over finite fields of characteristic 2 with prescribed invariants / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for determining the complexity of a binary sequence with period<tex>2^n</tex>(Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4695307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new characterization of semi-bent and bent functions on finite fields / 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: Q3509721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shift-register synthesis and BCH decoding / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the expected value of the linear complexity and the k-error linear complexity of periodic sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the construction of irreducible self-reciprocal polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorization of a class of polynomials over finite fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for determining the linear complexity of a sequence with period p/sup n/ over GF(q) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417388 / rank
 
Normal rank

Latest revision as of 04:02, 6 July 2024

scientific article
Language Label Description Also known as
English
Quadratic functions with prescribed spectra
scientific article

    Statements

    Quadratic functions with prescribed spectra (English)
    0 references
    0 references
    0 references
    28 January 2013
    0 references
    Let \(p\) be a prime and let \(f: \mathbb F_{p^n}\to \mathbb F_p\) be a quadratic function. The Walsh transform at \(b\in\mathbb F_{p^n}\) is: \[ \hat f(b)=\sum_{x\in\mathbb F_{p^n}} \varepsilon_p^{f(x)-\text{Tr}(bx)}, \] where \(\varepsilon_p=e^{2\pi i/p}\). It is well-known that \(f\) is \(s\)-plateaued, for some \(0\leq s\leq n-1\), meaning that all \(|\hat f(b)|^2\) lie in \(\{ 0, p^{n+s}\}\). Every quadratic function can be written as a trace form. The authors consider the special class of trace forms where the coefficients are in the base field: \[ \mathcal F_{p,n}(x)=\text{Tr}\left(\sum_{i=0}^k a_ix^{p^i+1}\right), \quad a_i\in\mathbb F_p. \] They consider four problems: -- Given \(s\), determine \(n\) such that all \(\mathcal F_{p,n}\) are \(s\)-plateaued. -- Given \(n\), find possible \(s\) with some \(\mathcal F_{p,n}\) \(s\)-plateaued. -- Given \(n\) and an \(s\) known to give rise to an \(s\)-plateaued \(\mathcal F_{p,n}\), construct an \(s\)-plateaued \(\mathcal F_{p,n}\). -- Given \(n\), for any \(s\), enumerate all \(s\)-plateaued \(\mathcal F_{p,n}\). Numerous partial results are known for all four problems. The authors unify these and extend them to arbitrary characteristic. To be specific, they completely answer (1) and (2). Problem (3) is solved for all \(s\) and all odd \(n\) prime to \(p\). They solve (4) for \(p=2\) and \(n=2^m\), \(m\geq 2\) as well as for odd \(p\) and \(n=q^m\), where \(q\) is an odd prime for which \(p\) is a primitive root modulo \(q^2\). The major tools used are: self-reciprocal factors of cyclotomic polynomials and two algorithms for computing linear complexity, one due to \textit{R. A. Games} and \textit{A. H. Chan} [IEEE Trans. Inf. Theory 29, 144--146 (1983; Zbl 0498.68034)] and the other due to \textit{G. Xiao, S. Wei, K.Y. Lam} and \textit{K. Imamura} [IEEE Trans. Inf. Theory 46, 2203--2206 (2000; Zbl 0997.94013)].
    0 references
    0 references
    0 references
    0 references
    0 references
    quadratic functions
    0 references
    trace forms
    0 references
    plateaued functions
    0 references
    semi-bent functions
    0 references
    self-reciprocal polynomials
    0 references
    linear complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references