Variable-length maximal codes

DOI10.1007/3-540-61440-0_115MaRDI QIDQ4818822zbMATH OpenFDO

Authors Véronique Bruyère, Michel Latteux

Publication date 24 September 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-61440-0_115

Mathematics Subject Classification ID

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

Cited in

(14)

• A conjecture on continued fractions
• Generating functions of circular codes
• Completion of codes with finite bi-decoding delays.
• Some combinatorial results on Bernoulli sets and codes
• On some Schützenberger conjectures
• On factorizing codes: Structural properties and related decision problems
• An enhanced property of factorizing codes
• Completing codes and the Rédei property of groups
• A note on the factorization conjecture
• On a complete set of operations for factorizing codes
• Fixed-Rate Maximum-Runlength-Limited Codes From Variable-Rate Bit Stuffing
• On a class of efficient error-limiting variable-length codes
• Degree and decomposability of variable-length codes
• A completion algorithm for codes with bounded synchronization delay

This page was built for publication: Variable-length maximal codes

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