Sur un algorithme donnant les codes bipréfixes finis
From MaRDI portal
Publication:5652538
DOI10.1007/BF01706090zbMath0241.94015OpenAlexW2064582997MaRDI QIDQ5652538
Publication date: 1972
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01706090
Related Items (15)
Finite biprefix sets of paths in a graph ⋮ Le degré minimal du groupe d'un code biprefixe fini ⋮ La représentation ergodique d'un automate fini ⋮ On the factorization conjecture ⋮ Bifix codes and Sturmian words ⋮ A graph covering construction of all the finite complete biprefix codes ⋮ A property of biprefix codes ⋮ Unnamed Item ⋮ La transitivite du groupe d'un code biprefixe fini ⋮ Finite maximal solid codes ⋮ Sur le produit de concatenation non ambigu ⋮ Embedding a \(\theta \)-invariant code into a complete one ⋮ Codes asynchrones ⋮ On a complete set of operations for factorizing codes ⋮ A partial result about the factorization conjecture for finite variable- length codes
Cites Work
This page was built for publication: Sur un algorithme donnant les codes bipréfixes finis
