On maximal codes with bounded synchronization delay
type: Item
instance of: scholarly article
title: On maximal codes with bounded synchronization delay
zbMATH Open document ID: 0913.68160
DOI: 10.1016/S0304-3975(98)00028-0
author: Véronique Bruyère
published in: Theoretical Computer Science
publication date: 1999-01-12T00:00:00Z
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1238860
zbMATH Keywords: variable-length codes
zbMATH Keywords: combinatorics on words
zbMATH Keywords: finite automata
MaRDI profile type: Publication
cites work: Algorithms for sliding block codes - An application of symbolic dynamics to information theory
cites work: Surjective Extensions of Sliding-Block Codes
cites work: The method of poles: a coding method for constrained channels
cites work: Q4430300
cites work: On completion of codes with finite deciphering delay
cites work: On some properties of very pure codes
cites work: Codes which are minimal generators of languages of biinfinite words
cites work: Precircular codes and periodic biinfinite words
cites work: Each regular code is included in a maximal regular code
cites work: A General Method for Channel Coding
cites work: Q4942638
cites work: Q5645285
cites work: Q5533188
cites work: Q4281535
cites work: Completing biprefix codes
cites work: A combinatorial property of codes having finite synchronization delay
cites work: On codes having no finite completions
cites work: On a Factorisation of Free Monoids
cites work: Q5596858
cites work: Q5665310
cites work: Completion of recognizable bifix codes
full work available at URL: s0304-3975(98)00028-0
OpenAlex ID: W1992676512
Wikidata QID: Q127957444
description: scientific article; zbMATH DE number 1238860