Maximal bifix codes

DOI10.1016/S0304-3975(98)00253-9MaRDI QIDQ1292485zbMATH OpenOpenAlexFDO

Authors Véronique Bruyère, Dominique Perrin

Publication date 21 June 1999

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(98)00253-9

zbMATH Keywords

combinatorics on wordsvariable-length codes

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites work

• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 1988973 (Why is no real title available?)
• scientific article; zbMATH DE number 3203853 (Why is no real title available?)
• A property of biprefix codes
• Completing biprefix codes
• Completion of recognizable bifix codes

Cited in

(7)

• Variable-length codes independent or closed with respect to edit relations
• Maximal solid codes
• Bi-infinitary codes
• On maximal synchronous codes.
• Completion of codes with finite bi-decoding delays.
• Completing circular codes in regular submonoids
• On maximal codes with a finite interpreting delay.

This page was built for publication: Maximal bifix codes

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