On the degree of finite maximal biprefix codes

DOI10.1007/BF02573681zbMATH Open0802.94012OpenAlexW2057395428MaRDI QIDQ1322583

Laurent Rosaz

Publication date: 5 May 1994

Published in: Semigroup Forum (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/135322

zbMATH Keywords

degreebiprefix code

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Prefix, length-variable, comma-free codes (94A45)

Cites Work

• On a Special Class of Recurrent Events
• Title not available (Why is that?)

Related Items (1)

On encoding symbol degrees of array BP-XOR codes

This page was built for publication: On the degree of finite maximal biprefix codes

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