A New Approach to Cross-Bifix-Free Sets

Cross-bifix-free sets are sets of words such that no prefix of any word is a suffix of any other word. In this paper, we introduce a general constructive method for the sets of cross-bifix-free binary words of fixed length. It enables us to determine a cross-bifix-free words subset which has the property to be non-expandable.

• Publication year

  2011

• Venue

  IEEE Transactions on Information Theory

• Publication date

  2011-12-14

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/TIT.2012.2189479arXiv 1112.3168
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On the Search for a Sequence from a Predefined Set of Sequences in Random and Framed Data Streams

  2012cited by this paper
• Enumerative Combinatorics: Volume 1

  2011cited by this paper
• On-Line Encyclopedia of Integer Sequences

  2010cited by this paper
• Codes and Automata (Encyclopedia of Mathematics and its Applications)

  2009cited by this paper
• On Frame Synchronization for Multiple Access Channels

  2009cited by this paper
• Algorithms on strings

  2007cited by this paper
• Counting bordered and primitive words with a fixed weight

  2005cited by this paper
• Distributed sequences and search process

  2004cited by this paper
• The On-Line Encyclopedia of Integer Sequences

  2003cited by this paper
• Frame synchronization using distributed sequences

  2000cited by this paper
• Enumerative Combinatorics: Index

  1999cited by this paper
• Combinatorics on words: Bibliography

  1997cited by this paper
• Duration of search for a fixed pattern in random data: distribution function and variance

  1995cited by this paper
• Enumerative Combinatorics

  1986cited by this paper
• COMBINATORICS ON WORDS (Encyclopedia of Mathematics and Its Applications, 17)

  1984cited by this paper
• Frame Synchronization Techniques

  1980cited by this paper
• Binary sequences up to length 40 with best possible autocorrelation function

  1975cited by this paper
• Advanced Combinatorics: The Art of Finite and Infinite Expansions

  1974cited by this paper
• On the expected duration of a search for a fixed pattern in random data

  1973cited by this paper
• A note on bifix-free sequences (Corresp.)

  1973cited by this paper
• A Note on Bifix-Free Sequences

  1973cited by this paper
• Synchronization of binary messages

  1960cited by this paper

• New construction of non-expandable (1, k)-overlap-free codes

  2025cites this paper
• Constrained Coding Bounds via Goulden–Jackson Cluster Theorem

  2025cites this paper
• Q-ary (1,k)-overlap-free Codes with given Restrictions

  2025cites this paper
• Constructions and Bounds for q-Ary (1, k)-Overlap-Free Codes

  2024cites this paper
• On maximal almost balanced non-overlapping codes and non-overlapping codes with restricted run-lengths

  2024cites this paper
• Incremental computation of the set of period sets

  2024cites this paper
• Constrained coding upper bounds via Goulden-Jackson cluster theorem

  2024cites this paper
• Counting Overlapping Pairs of Words

  2024cites this paper
• Constructions of Non-Expandable Cross-Bifix-Free Codes via Expandable Codes

  2024cites this paper
• Secure Information Embedding in Forensic 3D Fingerprinting

  2024cites this paper
• Two-dimensional q-ary non-overlapping codes

  2024cites this paper
• Secure Information Embedding and Extraction in Forensic 3D Fingerprinting

  2024cites this paper
• In search of maximum non-overlapping codes

  2023cites this paper
• Diletter and triletter comma-free codes over finite alphabets

  2023cites this paper
• Break-Resilient Codes

  2023cites this paper
• On non-expandable cross-bifix-free codes

  2023cites this paper
• Constructions and Bounds for Codes With Restricted Overlaps

  2022cites this paper
• Convergence of the Number of Period sets in Strings

  2022cites this paper
• Equivalence classes of circular codes induced by permutation groups

  2021cites this paper
• Q-Ary Non-Overlapping Codes: A Generating Function Approach

  2021cites this paper
• Non-overlapping matrices via Dyck words

  2021cites this paper
• Mutual Borders and Overlaps

  2020cites this paper
• Variable dimension non-overlapping matrices

  2020cites this paper
• Sets of Pictures Avoiding Overlaps

  2019cites this paper
• Maximality on Construction of Ternary Cross Bifix Free Code

  2019influential citation
• On factor-free Dyck words with half-integer slope

  2018cites this paper
• Mutually Uncorrelated Codes for DNA Storage

  2018cites this paper
• Exhaustive generation of positive lattice paths

  2018cites this paper
• A Gray code for a regular language

  2018cites this paper
• Non-overlapping Dyck matrices

  2018cites this paper
• Mutually Uncorrelated Primers for DNA-Based Data Storage

  2017cites this paper
• Properties of Two-Dimensional Words

  2017cites this paper
• Non-expandable non-overlapping sets of pictures

  2017cites this paper
• Avoiding Overlaps in Pictures

  2017cites this paper
• Pattern Avoiding Languages and Recurrence Relations Interpretation

  2017cites this paper
• Mutually uncorrelated codes for DNA storage

  2017cites this paper
• A 2D non-overlapping code over a q-ary alphabet

  2017cites this paper
• Non-overlapping matrices

  2016cites this paper
• Construction of Non-expandable Non-overlapping Sets of Pictures

  2016cites this paper
• Variable-Length Non-Overlapping Codes

  2016cites this paper
• Cross-bifix-free sets generation via Motzkin paths

  2016cites this paper
• Weakly mutually uncorrelated codes

  2016cites this paper
• Cross-bifix-free sets in two dimensions

  2015cites this paper
• DNA-Based Storage: Trends and Methods

  2015cites this paper
• A generating function for bit strings with no Grand Dyck pattern matching

  2015cites this paper
• Unbordered Pictures: Properties and Construction

  2015cites this paper
• Gray codes and efficient exhaustive generation for several classes of restricted words. (Codes de gray et génération exhaustive pour certaines classes de mots sous contrainte)

  2015cites this paper
• Fe b 20 15 Cross-bifix-free sets in two dimensions

  2015cites this paper
• Cross-bifix-free sets via Motzkin paths generation

  2014influential citation
• Prefix partitioned gray codes for particular cross-bifix-free sets

  2014cites this paper
• A Gray code for cross-bifix-free sets

  2014cites this paper
• A simple suboptimal construction of cross-bifix-free codes

  2014cites this paper
• Non-Overlapping Codes

  2013cites this paper
• Avoiding cross-bifix-free binary words

  2013cites this paper
• DOTTORATO DI RICERCA IN

  2012cites this paper
• Cross-Bifix-Free Codes Within a Constant Factor of Optimality

  2012influential citation