A partial result about the factorization conjecture for finite variable- length codes
type: Item
instance of: scholarly article
title: A partial result about the factorization conjecture for finite variable- length codes
zbMATH Open document ID: 0798.68084
DOI: 10.1016/0012-365X(93)90291-Z
author: Clelia De Felice
published in: Discrete Mathematics
publication date: 1994-03-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 94A45
zbMATH DE Number: 500633
zbMATH Keywords: finite variable-length codes
zbMATH Keywords: finite maximal codes
zbMATH Keywords: factorization conjecture
MaRDI profile type: Publication
Wikidata QID: Q122943772
cites work: Q4430300
cites work: Q3691074
cites work: Q3329658
cites work: Q4036595
cites work: Sur un algorithme donnant les codes bipréfixes finis
cites work: Q4725767
cites work: Construction of a family of finite maximal codes
cites work: Q4079524
cites work: Q3281123
cites work: Sur le problème de factorisation des groupes cycliques
cites work: Codes asynchrones
cites work: Q3942894
cites work: On codes having no finite completions
cites work: On the factorization of codes
cites work: Noncommutative factorization of variable-length codes
cites work: Sur certains sous-monoïdes libres
cites work: Q3683550
cites work: On the factorization conjecture
Recommended article: An alternative formulation of the factorization conjecture for codes
Recommended article: Q4536365
Recommended article: An application of Hajós factorizations to variable-length codes
Recommended article: Q4330720
Recommended article: Q4347989
Recommended article: On the factorization of codes
Recommended article: Q4825982
Recommended article: Q4725767
Recommended article: Shortening Array Codes and the Perfect $1$-Factorization Conjecture
Recommended article: Noncommutative factorization of variable-length codes
description: scientific article; zbMATH DE number 500633