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

被引:17
作者
Bernini, Antonio [1 ]
Bilotta, Stefano [1 ]
Pinzani, Renzo [1 ]
Sabri, Ahmad [2 ]
Vajnovszki, Vincent [2 ]
机构
[1] Univ Florence, Dipartimento Matemat & Informat U Dini, I-50134 Florence, Italy
[2] Univ Bourgogne, LE2I, F-21078 Dijon, France
来源
CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES | 2014年 / 6卷 / 04期
关键词
Gray codes; Cross-bifix-free sets; CAT algorithms; q-ary words; SEQUENCES;
D O I
10.1007/s12095-014-0105-6
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A set of words with the property that no prefix of any word is the suffix of any other word is called cross-bifix-free set. We provide an efficient generating algorithm producing Gray codes for a remarkable family of cross-bifix-free sets.
引用
收藏
页码:359 / 369
页数:11
相关论文
共 22 条
[1]  
Bajic D., 2007, CONTRUCTION CROSS BI
[2]   A simple suboptimal construction of cross-bifix-free codes [J].
Bajic, Dragana ;
Loncar-Turukalo, Tatjana .
CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2014, 6 (01) :27-37
[3]   Gray code for derangements [J].
Baril, JL ;
Vajnovszki, V .
DISCRETE APPLIED MATHEMATICS, 2004, 140 (1-3) :207-221
[4]  
Berstel J., 2009, Codes and Automata, Encyclopedia of Mathematics and its Applications
[5]   A New Approach to Cross-Bifix-Free Sets [J].
Bilotta, Stefano ;
Pergola, Elisa ;
Pinzani, Renzo .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (06) :4058-4063
[6]   Cross-Bifix-Free Codes Within a Constant Factor of Optimality [J].
Chee, Yeow Meng ;
Kiah, Han Mao ;
Purkayastha, Punarbasu ;
Wang, Chengmin .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (07) :4668-4674
[7]  
Crochemore M., 2007, Algorithms on Strings, DOI DOI 10.1017/CBO9780511546853
[8]   ON GENERATING THE N-ARY REFLECTED GRAY CODES [J].
ER, MC .
IEEE TRANSACTIONS ON COMPUTERS, 1984, 33 (08) :739-741
[9]  
Gray F., 1953, United States Patent
[10]   ERROR DETECTING AND ERROR CORRECTING CODES [J].
HAMMING, RW .
BELL SYSTEM TECHNICAL JOURNAL, 1950, 29 (02) :147-160