4 papers
cs.IT2022
When Variable-Length Codes Meet the Field of Error Detection
Jean Néraud
Given a finite alphabet and a binary relation , a set is -{\it independent} if . Given a quasi-metric over (in…
cs.CL2021
Gray Cycles of Maximum Length Related to k-Character Substitutions
Jean Néraud
Given a word binary relation we define a -Gray cycle over a finite language X to be a permutation w [i] 0i|X|--1 of X such that each word wi is an image of the pre…
cs.CL2021
Variable-Length Codes Independent or Closed with respect to Edit Relations
Jean Néraud
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, tra…
cs.CL2019
Complete Variable-Length Codes: An Excursion into Word Edit Operations
Jean Néraud
Given an alphabet A and a binary relation A * x A * , a language X A * is -independent if (X) X = ; X is -closed if (X)…