arXiv subjects

Jean Néraud

Publications and source records attributed to Jean Néraud.

9 recordsLinked to original sources

arXiv2023

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

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$\le$i$\le$|X|--1 of X such that each word w [i] is an image under $τ$ of the previous word w [i--1]. We define the complexity measure $λ$A,$τ$ (n), equal to the largest cardinality of a language X having words of length at most n, and st. some $τ$-Gray cycle over X exists. The present paper is concerned with $τ$ = $σ$ k , the so-called k-character substitution, st. (u, v) $\in$ $σ$ k holds if, and only if, the Hamming distance of u and v is k. We present loopless (resp., constant amortized time) algorithms for computing specific maximum length $σ$ k-Gray cycles.

cs.DM↗

arXiv2023

Topologies for Error-Detecting Variable-Length Codes

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}$ holds whenever $d(x,y)\le k$. The error detection capability of variable-length codes is expressed in term of conditions over $τ_{d,k}$. With respect to the prefix metric, the factor one, and any quasi-metric associated with some free monoid (anti-)automorphism, we prove that one can decide whether a given regular variable-length code satisfies any of those error detection constraints.

cs.DM↗

arXiv2022

When Variable-Length Codes Meet the Field of Error Detection

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 the meaning of \cite{W31}) and $k\ge 1$, we associate the relation $τ_{d,k}$ defined by $(x,y)\inτ_{d,k}$ if, and only if, $d(x,y)\le k$ \cite{CP02}.In the spirit of \cite{JK97,N21}, the error detection-correction capability of variable-length codes can be expressed in term of conditions over $τ_{d,k}$. With respect to the prefix metric, the factor one, and every quasi-metric associated to (anti-)automorphisms of the free monoid, we examine whether those conditions are decidable for a given regular code.

cs.IT↗

arXiv2021

Gray Cycles of Maximum Length Related to k-Character Substitutions

Given a word binary relation $τ$ we define a $τ$-Gray cycle over a finite language X to be a permutation w [i] 0$\le$i$\le$|X|--1 of X such that each word wi is an image of the previous word wi--1 by $τ$. In that framework, we introduce the complexity measure $λ$(n), equal to the largest cardinality of a language X having words of length at most n, and such that a $τ$-Gray cycle over X exists. The present paper is concerned with the relation $τ$ = $σ$ k , the so-called k-character substitution, where (u, v) belongs to $σ$ k if, and only if, the Hamming distance of u and v is k. We compute the bound $λ$(n) for all cases of the alphabet cardinality and the argument n.

cs.CL↗

arXiv2021

Variable-Length Codes Independent or Closed with respect to Edit Relations

We investigate inference of variable-length codes in other domains of computer science, such as noisy information transmission or information retrieval-storage: in such topics, traditionally mostly constant-length codewords act. The study is relied upon the two concepts of independent and closed sets. We focus to those word relations whose images are computed by applying some peculiar combinations of deletion, insertion, or substitution. In particular, characterizations of variable-length codes that are maximal in the families of $τ$-independent or $τ$-closed codes are provided.

cs.CL↗

arXiv2019

Complete Variable-Length Codes: An Excursion into Word Edit Operations

Given an alphabet A and a binary relation $τ$ $\subseteq$ A * x A * , a language X $\subseteq$ A * is $τ$-independent if $τ$ (X) $\cap$ X = $\emptyset$; X is $τ$-closed if $τ$ (X) $\subseteq$ X. The language X is complete if any word over A is a factor of some concatenation of words in X. Given a family of languages F containing X, X is maximal in F if no other set of F can stricly contain X. A language X $\subseteq$ A * is a variable-length code if any equation among the words of X is necessarily trivial. The study discusses the relationship between maximality and completeness in the case of $τ$-independent or $τ$-closed variable-length codes. We focus to the binary relations by which the images of words are computed by deleting, inserting, or substituting some characters.

cs.CL↗

arXiv2018

Embedding a $θ$-invariant code into a complete one

Let A be a finite or countable alphabet and let $θ$ be a literal (anti-)automorphism onto A * (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under $θ$ ($θ$-invariant for short) that is, languages L such that $θ$ (L) is a subset of L.We establish an extension of the famous defect theorem. With regards to the so-called notion of completeness, we provide a series of examples of finite complete $θ$-invariant codes. Moreover, we establish a formula which allows to embed any non-complete $θ$-invariant code into a complete one. As a consequence, in the family of the so-called thin $θ$--invariant codes, maximality and completeness are two equivalent notions.

cs.DM↗

arXiv2017

Invariance: a Theoretical Approach for Coding Sets of Words Modulo Literal (Anti)Morphisms

Let $A$ be a finite or countable alphabet and let $θ$ be literal (anti)morphism onto $A^*$ (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under $θ$ ($θ$-invariant for short).We establish an extension of the famous defect theorem. Moreover, we prove that for the so-called thin $θ$-invariant codes, maximality and completeness are two equivalent notions. We prove that a similar property holds in the framework of some special families of $θ$-invariant codes such as prefix (bifix) codes, codes with a finite deciphering delay, uniformly synchronized codes and circular codes. For a special class of involutive antimorphisms, we prove that any regular $θ$-invariant code may be embedded into a complete one.

cs.DM↗

arXiv2017

Ten Conferences WORDS: Open Problems and Conjectures

In connection to the development of the field of Combinatorics on Words, we present a list of open problems and conjectures that were stated during the ten last meetings WORDS. We wish to continually update the present document by adding informations concerning advances in problems solving.

cs.FL↗