A graph covering construction of all the finite complete biprefix codes
type: Item
instance of: scholarly article
title: A graph covering construction of all the finite complete biprefix codes
zbMATH Open document ID: 0468.68092
DOI: 10.1016/S0012-365X(81)80022-2
author: Gerard Lallement
author: Dominique Perrin
published in: Discrete Mathematics
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 94A45
zbMATH DE Number: 3735181
zbMATH Keywords: coverings of graphs of homogeneous synchronized automata
zbMATH Keywords: prefix code
zbMATH Keywords: suffix code
zbMATH Keywords: free monoid
zbMATH Keywords: directed graph
zbMATH Keywords: permutation group
MaRDI profile type: Publication
cites work: Sur un algorithme donnant les codes bipréfixes finis
cites work: Generating all graph coverings by permutation voltage assignments
cites work: Team tournaments and finite elementary codes
cites work: Q4100680
cites work: La représentation ergodique d'un automate fini
cites work: On a Special Class of Recurrent Events
description: scientific article; zbMATH DE number 3735181