Maximal bifix codes of degree 3

DOI10.1007/S40840-016-0399-YMaRDI QIDQ723611zbMATH OpenOpenAlexFDO

Authors Liyan Bai, Lianyan Jin, Yun Liu

Publication date 24 July 2018

Published in Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40840-016-0399-y

zbMATH Keywords

directed acyclic graphenumerationprefix codedegree of codesmaximal bifix code

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Algebraic theory of languages and automata (68Q70)

Recommendations

• On the degree of finite maximal biprefix codes
• Structure of 3-infix-outfix maximal codes.
• scientific article; zbMATH DE number 1740160
• Classifications of bifix codes
• Bifix codes and Sturmian words

Cites work

• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• scientific article; zbMATH DE number 3203853 (Why is no real title available?)
• scientific article; zbMATH DE number 3409391 (Why is no real title available?)
• A property of biprefix codes
• Codes and automata.
• Completely simple codes
• Compositions of maximal codes
• Groups and decompositions of codes
• On a Special Class of Recurrent Events

Cited in

(3)

• Bifix codes and Sturmian words
• scientific article; zbMATH DE number 1740160 (Why is no real title available?)
• The finite index basis property

This page was built for publication: Maximal bifix codes of degree 3

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