scientific article; zbMATH DE number 176765

zbMATH Open0766.68071MaRDI QIDQ4036595FDOQ4036595

Authors: Véronique Bruyère, Clelia De Felice 

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

degreefinite maximal codesnumber of factorizationsindecomposable codes

Mathematics Subject Classification ID

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

Cited In (6)

• Title not available (Why is that?)
• SYNCHRONIZATION AND DECOMPOSABILITY FOR A FAMILY OF CODES
• A partial result about the factorization conjecture for finite variable- length codes
• An application of Hajós factorizations to variable-length codes
• Synchronization and decomposability for a family of codes. II
• Une famille remarquable de codes indecomposables

This page was built for publication:

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