Variable-length codes independent or closed with respect to edit relations

DOI10.1016/J.IC.2021.104747OpenAlexW3157844820MaRDI QIDQ2084770FDOQ2084770

Authors: J. Néraud

Publication date: 13 October 2022

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.14185

Recommendations

Complete variable-length codes: an excursion into word edit operations
scientific article; zbMATH DE number 3928880
Maximal and variable word-length comma-free codes
Variable length codes and finite automata
scientific article; zbMATH DE number 176765

zbMATH Keywords

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)

Cites Work

A Mathematical Theory of Communication
Error detecting and error correcting codes
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Synchronization
Title not available (Why is that?)
On Relations Defined by Generalized Finite Automata
Title not available (Why is that?)
A universal algorithm for sequential data compression
A Method for the Construction of Minimum-Redundancy Codes
A Survey of Combinatorial Gray Codes
Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
Completing comma-free codes
Error correction coding. Mathematical methods and algorithms
Combinatorial Gray Codes
On the maximality of languages with combined types of code properties
Completion of recognizable bifix codes
Codes and automata.
Relations on free monoids, their independent sets, and codes¹
Title not available (Why is that?)
Data compression and Gray-code sorting
Symbolic Gray Code As A Data Allocation Scheme For Two-disc Systems
On codes having no finite completions
Error-correction, and finite-delay decodability
Title not available (Why is that?)
Title not available (Why is that?)
Each regular code is included in a maximal regular code
On completion of codes with finite deciphering delay
Complete variable-length codes: an excursion into word edit operations
Error-detecting properties of languages
Finite maximal solid codes
Completing circular codes in regular submonoids
Maximal bifix codes
Embedding a \(\theta \)-invariant code into a complete one

Cited In (6)

Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions
Topologies for error-detecting variable-length codes
Complete variable-length codes: an excursion into word edit operations
When variable-length codes meet the field of error detection
Special issue: Selected papers of the 14th international conference on language and automata theory and applications, LATA 2020
Gray cycles of maximum length related to \(k\)-character substitutions

This page was built for publication: Variable-length codes independent or closed with respect to edit relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2084770)