A New Approach to Cross-Bifix-Free Sets

被引：32

作者：

Bilotta, Stefano ^{[1
]}

Pergola, Elisa ^{[1
]}

Pinzani, Renzo ^{[1
]}

机构：

[1] Univ Florence, Dept Sistemi & Informat, I-50134 Florence, Italy

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2012年 / 58卷 / 06期

关键词：

Algorithms; binary sequences; combinatorial mathematics; FIXED PATTERN; DURATION; SEARCH;

D O I：

10.1109/TIT.2012.2189479

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：4058 / 4063

页数：6

共 17 条

[1] Distributed sequences and search process [J].

Bajic, D ;

Stojanovic, J .

2004 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-7, 2004, :514-518

[2] DURATION OF SEARCH FOR A FIXED PATTERN IN RANDOM DATA - DISTRIBUTION FUNCTION AND VARIANCE [J].

BAJIC, D ;

DRAJIC, D .

ELECTRONICS LETTERS, 1995, 31 (08) :631-632

[3]

Bajic D., 2007, 2 MCM COST 2100 LISB

[4]

Barker R. H., 1953, COMMUN THEOR, V273

[5]

Berstel J., 2009, ENCY MATH ITS APPL

[6]

Comtet L., 1974, ADV COMBINATORICS AR

[7]

Crochemore M., 2007, Algorithms on Strings, DOI DOI 10.1017/CBO9780511546853

[8] Counting bordered and primitive words with a fixed weight [J].

Harju, T ;

Nowotka, D .

THEORETICAL COMPUTER SCIENCE, 2005, 340 (02) :273-279

[9] BINARY SEQUENCES UP TO LENGTH 40 WITH BEST POSSIBLE AUTOCORRELATION FUNCTION [J].

LINDNER, J .

ELECTRONICS LETTERS, 1975, 11 (21) :507-507

[10] BIFIX-FREE SEQUENCES [J].

NIELSEN, PT .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1973, 19 (05) :704-706

← 1 2 →