Jean Néraud

collaborators

3 papers

cs.DM2023

Loopless Algorithms to Generate Maximum Length Gray Cycles wrt. k-Character Substitution

Jean Néraud

Given a binary word relation $τ$ onto A * and a finite language X $\subseteq$ A * , a $τ$ -Gray cycle over X consists in a permutation w [i] 0 $\leq$ i $\leq$ |X|--1 of X such that each w…

cs.DM2023

Topologies for Error-Detecting Variable-Length Codes

Jean Néraud

Given a finite alphabet $A$ , a quasi-metric $d$ over $A^{*}$ , and a non-negative integer $k$ , we introduce the relation $τ_{d, k} \subseteq A^{*} \times A^{*}$ such that $(x, y) \in τ_{d, k}$ h…

cs.IT2022

When Variable-Length Codes Meet the Field of Error Detection

Jean Néraud

Given a finite alphabet $A$ and a binary relation $τ \subseteq A^{*} \times A^{*}$ , a set $X$ is $τ$ -{\it independent} if $τ (X) \cap X = \emptyset$ . Given a quasi-metric $d$ over $A^{*}$ (in…