Université Paris 8

output

20022024

most citedModeling urban street patterns

275 citations

Showing 2019Show all

8 papers · 1 filter

cs.IT2019★ 2 cited

Solving $X^{q + 1} + X + a = 0$ over Finite Fields

Kwang Ho Kim, Junyop Choe, Sihem Mesnager

Solving the equation $P_{a} (X) := X^{q + 1} + X + a = 0$ over finite field $\GF{Q}$, where $Q = p^{n}, q = p^{k}$ and $p$ is a prime, arises in many different contexts including finite geometry, the i…

cs.CL2019★ 10 cited

SWift -- A SignWriting improved fast transcriber

Claudia S. Bianchini, Fabrizio Borgia, Paolo Bottoni +1

We present SWift (SignWriting improved fast transcriber), an advanced editor for computer-aided writing and transcribing using SignWriting (SW). SW is devised to allow deaf people…

cs.HC2019★ 14 cited

SWift -- A SignWriting editor to bridge between deaf world and e-learning

Claudia S. Bianchini, Fabrizio Borgia, Maria de Marsico

SWift (SignWriting improved fast transcriber) is an advanced editor for SignWriting (SW). At present, SW is a promising alternative to provide documents in an easy-to-grasp written…

cs.IT2019★ 3 cited

Further study of $2$ -to- $1$ mappings over $F_{2^{n}}$

Kangquan Li, Sihem Mesnager, Longjiang Qu

$2$ -to- $1$ mappings over finite fields play an important role in symmetric cryptography, in particular in the constructions of APN functions, bent functions, semi-bent functions an…

cs.IT2019

On two-to-one mappings over finite fields

Sihem Mesnager, Longjiang Qu

Two-to-one ( $2$ -to- $1$ ) mappings over finite fields play an important role in symmetric cryptography. In particular they allow to design APN functions, bent functions and semi-bent…

cs.IT2019★ 4 cited

Solving $x^{2^{k} + 1} + x + a = 0$ in $F_{2^{n}}$ with $g cd (n, k) = 1$

Kwang Ho Kim, Sihem Mesnager

Let $N_{a}$ be the number of solutions to the equation $x^{2^{k} + 1} + x + a = 0$ in $\GF {n}$ where $g cd (k, n) = 1$ . In 2004, by Bluher \cite{BLUHER2004} it was known that possible values of $…

Solving Xq+1+X+a=0 over Finite Fields