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

Jean Néraud (1, 2)

1 LITIS - Laboratoire d'Informatique, de Traitement de l'Information et des Systèmes
2 UNIROUEN - Université de Rouen Normandie

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 $\tau$-independent or $\tau$-closed codes are provided.

Mots clés: Bernoulli; bifix; channel; closed; code; complete; decoding; deletion; dependence; edition; error; edit relation; embedding; Gray; Hamming; independent; insertion; Levenshtein; maximal; metric; prefix; regular; solid; string; substitution; substring; subword; synchronization; variable-length; word; word relation; Bernoulli

Domaines: Informatique et langage [cs.CL]; Mathématique discrète [cs.DM]

Jean Néraud. Variable-Length Codes Independent or Closed with respect to Edit Relations. 2021. ⟨hal-03208074⟩