A simple suboptimal construction of cross-bifix-free codes

DOI10.1007/S12095-013-0088-8MaRDI QIDQ2434764zbMATH OpenOpenAlexFDO

Authors Dragana Bajic, Tatjana Loncar-Turukalo

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)

Recommendations

• Cross-bifix-free sets generation via Motzkin paths
• Cross-bifix-free sets in two dimensions
• Classifications of bifix codes

Cites work

• A construction for a class of binary words avoiding 1ʲ⁰^i
• A Theorem on Self-Overlapping Sequences
• On the expected duration of a search for a fixed pattern in random data (Corresp.)
• Product construction of affine codes

Cited in

(19)

• A 2D non-overlapping code over a q-ary alphabet
• Unbordered pictures: properties and construction
• Cross-bifix-free sets generation via Motzkin paths
• Non-expandable non-overlapping sets of pictures
• Non-overlapping matrices via Dyck words
• Cross-bifix-free sets in two dimensions
• Sets of pictures avoiding overlaps
• scientific article; zbMATH DE number 7731171 (Why is no real title available?)
• In search of maximum non-overlapping codes
• \(q\)-ary \((1, k)\)-overlap-free codes with given restrictions
• Counting overlapping pairs of words
• New construction of non-expandable (1, k)-overlap-free codes
• A generalized construction of variable-length non-overlapping codes
• Convergence of the number of period sets in strings
• On the maximum size of variable-length non-overlapping codes
• Two-dimensional q-ary non-overlapping codes
• Incremental computation of the set of period sets
• Constructions of two-dimensional non-overlapping codes
• Non-overlapping matrices

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

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