A New Approach to Cross-Bifix-Free Sets

DOI10.1109/TIT.2012.2189479zbMath1365.94372arXiv1112.3168MaRDI QIDQ5271867

Elisa Pergola, Renzo Pinzani, Stefano Bilotta

Publication date: 12 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.3168

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Prefix, length-variable, comma-free codes (94A45)

Related Items (12)

Avoiding cross-bifix-free binary words ⋮ On factor-free Dyck words with half-integer slope ⋮ 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 ⋮ Cross-bifix-free sets in two dimensions ⋮ Non-overlapping matrices ⋮ Sets of Pictures Avoiding Overlaps

This page was built for publication: A New Approach to Cross-Bifix-Free Sets