Hall sets, Lazard sets and comma-free codes
classification
🧮 math.CO
keywords
setscodescomma-freefreehalllazardalgebrasbases
read the original abstract
We investigate the relationship between two constructions of maximal comma-free codes described respectively by Eastman and by Scholtz and the notions of Hall sets and Lazard sets introduced in connection with factorizations of free monoids and bases of free Lie algebras.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.