research
∙
09/05/2023
Topologies for Error-Detecting Variable-Length Codes
Given a finite alphabet A, a quasi-metric d over A^*, and a non-negative...
share
research
∙
09/04/2023
Loopless Algorithms to Generate Maximum Length Gray Cycles wrt. k-Character Substitution
Given a binary word relation τ onto A * and a finite language X ⊆ A * , ...
research
∙
08/31/2022
When Variable-Length Codes Meet the Field of Error Detection
Given a finite alphabet A and a binary relation τ⊆ A^*× A^*, a set X is ...
research
∙
08/31/2021
Gray Cycles of Maximum Length Related to k-Character Substitutions
Given a word binary relation τ we define a τ-Gray cycle over a finite la...
research
∙
04/29/2021
Variable-Length Codes Independent or Closed with respect to Edit Relations
We investigate inference of variable-length codes in other domains of co...
research
∙
12/05/2019
Complete Variable-Length Codes: An Excursion into Word Edit Operations
Given an alphabet A and a binary relation τ⊆ A * x A * , a language X ⊆ ...
research
∙
01/16/2018