41 citations · 136 across the 62 of their papers we have counts for
14 papers · 1 filter
On the Codebook Design for NOMA Schemes from Bent Functions
Chunlei Li, Constanza Riera, Palash Sarkar +1
Uplink grant-free non-orthogonal multiple access (NOMA) is a promising technology for massive connectivity with low latency and high energy efficiency. In code-domain NOMA schemes,…
The differential properties of certain permutation polynomials over finite fields
Kirpa Garg, Sartaj Ul Hasan, Pantelimon Stanica
Finding functions, particularly permutations, with good differential properties has received a lot of attention due to their varied applications. For instance, in combinatorial des…
Permutation rotation-symmetric S-boxes, liftings and affine equivalence
Tron Omland, Pantelimon Stanica
In this paper, we investigate permutation rotation-symmetric (shift-invariant) vectorial Boolean functions on bits that are liftings from Boolean functions on bits, for $k\…
On the c-differential uniformity of certain maps over finite fields
Sartaj Ul Hasan, Mohit Pal, Constanza Riera +1
We give some classes of power maps with low -differential uniformity over finite fields of odd characteristic, {for }. Moreover, we give a necessary and sufficient conditi…
A complete characterization of plateaued Boolean functions in terms of their Cayley graphs
Constanza Riera, Patrick Sole, Pantelimon Stanica
In this paper we find a complete characterization of plateaued Boolean functions in terms of the associated Cayley graphs. Precisely, we show that a Boolean function is -pla…
Bisecting binomial coefficients
Eugen J. Ionascu, Thor Martinsen, Pantelimon Stanica
In this paper, we deal with the problem of bisecting binomial coefficients. We find many (previously unknown) infinite classes of integers which admit nontrivial bisections, and a…