Prefix partitioned Gray codes for particular cross-bifix-free sets

DOI10.1017/S0960129515000067zbMATH Open1297.68189arXiv1401.4650OpenAlexW2005112909MaRDI QIDQ458743FDOQ458743

Authors: Antonio Bernini, S. Bilotta, R. Pinzani, Ahmad Sabri, Vincent Vajnovszki 

Publication date: 8 October 2014

Published in: Cryptography and Communications, Mathematical Structures in Computer Science (Search for Journal in Brave)

Abstract: A cross-bifix-free set of words is a set in which no prefix of any length of any word is the suffix of any other word in the set. A construction of cross-bifix-free sets has recently been proposed by Chee {it et al.} in 2013 within a constant factor of optimality. We propose a emph{trace partitioned} Gray code for these cross-bifix-free sets and a CAT algorithm generating it.

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

Recommendations

• Prefix partitioned Gray codes for particular cross-bifix-free sets
• Gray codes for noncrossing and nonnesting partitions of classical types
• A Gray code for set partitions
• Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
• scientific article; zbMATH DE number 731846
• Gray codes, loopless algorithm and partitions
• Gray codes for non-crossing partitions and dissections of a convex polygon
• Gray code sequences of partitions
• scientific article; zbMATH DE number 5975298
• Some classes of bipartite graphs induced by Gray codes

zbMATH Keywords

CAT algorithmsGray codes\(q\)-ary wordscross-bifix-free sets

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45) Combinatorics on words (68R15)

Cites Work

• Title not available (Why is that?)
• Error Detecting and Error Correcting Codes
• Pattern avoidance in set partitions.
• A Note on Gray Code and Odd-Even Merge
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithms on Strings
• Generation of Permutations by Adjacent Transposition
• Combinatorial Gray Codes
• A simple suboptimal construction of cross-bifix-free codes
• A note on bifix-free sequences (Corresp.)
• A New Approach to Cross-Bifix-Free Sets
• Cross-Bifix-Free Codes Within a Constant Factor of Optimality
• Title not available (Why is that?)
• Efficient generation of the binary reflected gray code and its applications
• Data compression and Gray-code sorting
• Gray visiting Motzkins
• Gray code for derangements
• Gray codes for involutions
• An algebraic explanation for the family structure of quarks and leptons.
• Title not available (Why is that?)
• On Generating the N-ary Reflected Gray Codes
• The \(r\)-generalized Fibonacci numbers and polynomial coefficients
• Title not available (Why is that?)
• Symbolic Gray Code As A Data Allocation Scheme For Two-disc Systems
• Prefix partitioned Gray codes for particular cross-bifix-free sets

Cited In (15)

• Loop-free Gray code algorithms for the set of compositions
• Title not available (Why is that?)
• A simple suboptimal construction of cross-bifix-free codes
• Title not available (Why is that?)
• A 2D non-overlapping code over a \(q\)-ary alphabet
• Non-overlapping matrices via Dyck words
• Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions
• Title not available (Why is that?)
• Gray codes for noncrossing and nonnesting partitions of classical types
• Prefix partitioned Gray codes for particular cross-bifix-free sets
• Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions
• A Construction for Variable Dimension Strong Non-Overlapping Matrices
• Cross-bifix-free sets generation via Motzkin paths
• Cross-bifix-free sets in two dimensions
• Gray cycles of maximum length related to \(k\)-character substitutions

This page was built for publication: Prefix partitioned Gray codes for particular cross-bifix-free sets

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