A simple suboptimal construction of cross-bifix-free codes

DOI10.1007/s12095-013-0088-8zbMath1290.94027OpenAlexW2067346416MaRDI QIDQ2434764

Tatjana Loncar-Turukalo, Dragana Bajic

Publication date: 7 February 2014

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-013-0088-8

zbMATH Keywords

bifixcross-bifixcross-bifix-free codessynchronization sequences

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45)

Related Items (9)

Non-overlapping matrices via Dyck words ⋮ Cross-bifix-free sets generation via Motzkin paths ⋮ Non-expandable non-overlapping sets of pictures ⋮ Unbordered Pictures: Properties and Construction ⋮ A 2D non-overlapping code over a \(q\)-ary alphabet ⋮ Unnamed Item ⋮ Prefix partitioned Gray codes for particular cross-bifix-free sets ⋮ Non-overlapping matrices ⋮ Sets of Pictures Avoiding Overlaps

Cites Work

• Product Construction of Affine Codes
• A Theorem on Self-Overlapping Sequences
• On the expected duration of a search for a fixed pattern in random data (Corresp.)
• Unnamed Item

This page was built for publication: A simple suboptimal construction of cross-bifix-free codes