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

arXiv: https://arxiv.org/abs/2104.14185 · HTML: https://mlsanity.com/paper/2104.14185/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- Builds on 2 of its 45 references that are in the map.
- First posted on arXiv 29 Apr 2021.

## Builds on (most cited first, 2 of 2)

- [Embedding a θ-invariant code into a complete one](https://mlsanity.com/paper/1801.05164/) (2018)
- [Complete Variable-Length Codes: An Excursion into Word Edit Operations](https://mlsanity.com/paper/1912.02646/) (2019)

## Built on by (most cited first, 2 of 2)

- [Gray Cycles of Maximum Length Related to k-Character Substitutions](https://mlsanity.com/paper/2108.13659/) (2021)
- [When Variable-Length Codes Meet the Field of Error Detection](https://mlsanity.com/paper/2208.14681/) (2022)

## Abstract (arXiv)

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.