Degree and decomposability of variable-length codes

DOI10.1007/3-540-54233-7_165MaRDI QIDQ4036595zbMATH OpenFDO

Authors Véronique Bruyère, Clelia De Felice

Publication date 18 May 1993

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

Full work available at URL https://doi.org/10.1007/3-540-54233-7_165

zbMATH Keywords

degreefinite maximal codesindecomposable codesnumber of factorizations

Mathematics Subject Classification ID

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

Recommendations

• Combinatorial properties of codes with degree \(n\)
• Complete variable-length ``fix-free codes
• A partial result about the factorization conjecture for finite variable- length codes
• scientific article; zbMATH DE number 4059292
• scientific article; zbMATH DE number 2102735
• Variable-length codes and the Fano metric
• Bounds for identifying codes in terms of degree parameters
• Noncommutative factorization of variable-length codes
• On a class of efficient error-limiting variable-length codes
• STACS 2005

Cited in

(9)

• A partial result about the factorization conjecture for finite variable- length codes
• Synchronization and decomposability for a family of codes. II
• Variable-length codes independent or closed with respect to edit relations
• Codes and automata in minimal sets
• SYNCHRONIZATION AND DECOMPOSABILITY FOR A FAMILY OF CODES
• Une famille remarquable de codes indecomposables
• scientific article; zbMATH DE number 2032371 (Why is no real title available?)
• On the decomposition of prefix codes
• An application of Hajós factorizations to variable-length codes

This page was built for publication: Degree and decomposability of variable-length codes

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