Variable-length codes independent or closed with respect to edit relations
type: Item
instance of: scholarly article
title: Variable-length codes independent or closed with respect to edit relations
author: J. Néraud
published in: Information and Computation
publication date: 2022-10-13T00:00:00Z
full work available at URL: https://arxiv.org/abs/2104.14185
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 94A45
zbMATH DE Number: 7601277
zbMATH Keywords: Bernoulli
zbMATH Keywords: bifix
zbMATH Keywords: channel
zbMATH Keywords: closed
zbMATH Keywords: code
zbMATH Keywords: complete
zbMATH Keywords: decoding
zbMATH Keywords: deletion
zbMATH Keywords: dependence
zbMATH Keywords: edition
zbMATH Keywords: error
zbMATH Keywords: edit relation
zbMATH Keywords: embedding
zbMATH Keywords: Gray
zbMATH Keywords: Hamming
zbMATH Keywords: independent
zbMATH Keywords: insertion
zbMATH Keywords: Levenshtein
zbMATH Keywords: maximal
zbMATH Keywords: metric
zbMATH Keywords: prefix
zbMATH Keywords: regular
zbMATH Keywords: solid
zbMATH Keywords: string
zbMATH Keywords: substitution
zbMATH Keywords: substring
zbMATH Keywords: subword
zbMATH Keywords: synchronization
zbMATH Keywords: variable-length
zbMATH Keywords: word
zbMATH Keywords: word relation
MaRDI profile type: Publication
OpenAlex ID: W3157844820
cites work: Q3653240
cites work: Maximal bifix codes
cites work: On completion of codes with finite deciphering delay
cites work: Symbolic Gray Code As A Data Allocation Scheme For Two-disc Systems
cites work: Q3910579
cites work: Each regular code is included in a maximal regular code
cites work: Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
cites work: On Relations Defined by Generalized Finite Automata
cites work: Error Detecting and Error Correcting Codes
cites work: A Method for the Construction of Minimum-Redundancy Codes
cites work: Combinatorial Gray Codes
cites work: Synchronization
cites work: Q4714446
cites work: Relations on free monoids, their independent sets, and codes1
cites work: On the maximality of languages with combined types of code properties
cites work: Q4681162
cites work: Q5422240
cites work: Error-detecting properties of languages
cites work: Finite maximal solid codes
cites work: Completing comma-free codes
cites work: Q5528329
cites work: Q4146667
cites work: Error Correction Coding
cites work: Completing circular codes in regular submonoids
cites work: Complete variable-length codes: an excursion into word edit operations
cites work: Embedding a \(\theta \)-invariant code into a complete one
cites work: Q4105657
cites work: Q5665102
cites work: On codes having no finite completions
cites work: Data compression and Gray-code sorting
cites work: Q4140407
cites work: Q3651209
cites work: A Survey of Combinatorial Gray Codes
cites work: A Mathematical Theory of Communication
cites work: Completion of recognizable bifix codes
cites work: A universal algorithm for sequential data compression
DOI: 10.1016/J.IC.2021.104747