Sur un algorithme donnant les codes bipréfixes finis

DOI10.1007/BF01706090zbMATH Open0241.94015OpenAlexW2064582997MaRDI QIDQ5652538FDOQ5652538

Yves Cesari

Publication date: 1972

Published in: Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01706090

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99)

Cites Work

• On a Special Class of Recurrent Events

Cited In (15)

• A partial result about the factorization conjecture for finite variable- length codes
• Title not available (Why is that?)
• Finite biprefix sets of paths in a graph
• A graph covering construction of all the finite complete biprefix codes
• Le degré minimal du groupe d'un code biprefixe fini
• Sur le produit de concatenation non ambigu
• Codes asynchrones
• La transitivite du groupe d'un code biprefixe fini
• La représentation ergodique d'un automate fini
• On a complete set of operations for factorizing codes
• On the factorization conjecture
• A property of biprefix codes
• Bifix codes and Sturmian words
• Finite maximal solid codes
• Embedding a \(\theta \)-invariant code into a complete one

This page was built for publication: Sur un algorithme donnant les codes bipréfixes finis

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