Density of k-ary words with 0, 1, 2-error overlaps

被引：0

作者：

Anselmo, Marcella ^{[1
]}

Flores, Manuela ^{[2
]}

Madonia, Maria ^{[3
]}

机构：

[1] Univ Salerno, Dipartimento Informat, Via Giovanni Paolo II 132, I-84084 Fisciano, SA, Italy

[2] Univ Palermo, Dipartimento Matemat & Informat, Via Archirafi 34, I-90123 Palermo, Italy

[3] Univ Catania, Dipartimento Matemat & Informat, Viale Andrea Doria 6-a, I-95125 Catania, Italy

来源：

THEORETICAL COMPUTER SCIENCE | 2025年 / 1025卷

关键词：

Isometric; Overlap with errors; Hamming and Lee distance; Density; SETS;

D O I：

10.1016/j.tcs.2024.114958

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

An overlap, or border, of a word is a prefix that is equal to the suffix of the same length. An overlap with q errors is a prefix which has distance q from the suffix of the same length; here, 0-error overlaps are classic ones. Unbordered, or bifix-free, words are a central notion in combinatorics on words and have a prominent role in many related areas, such as pattern matching or frame synchronization. On the other hand, words with 2-error overlaps arose as a characterization of isometric words, a notion recently introduced in the framework of hypercubes and their isometric subgraphs. This paper investigates the density of words with 0, 1, 2-error overlaps, where the words are taken over a generic k-ary alphabet, k >= 2, and the distance they refer to is the Hamming or the Lee distance. Estimates on the limit density values are provided and compared in the case of binary and quaternary alphabets.

引用

页数：15

共 50 条

[21] Embedding complete k-ary trees into k-square 2-D meshes with optimal edge congestion
Trdlicka, J
Tvrdíik, P
PARALLEL COMPUTING, 2000, 26 (06) : 783 - 790
[22] k-ary Lyndon Words and Necklaces Arising as Rational Arguments of Hurwitz-Lerch Zeta Function and Apostol-Bernoulli Polynomials
Kucukoglu, Irem
Bayad, Abdelmejid
Simsek, Yilmaz
MEDITERRANEAN JOURNAL OF MATHEMATICS, 2017, 14 (06)
[23] BINARY AND 2(K)-ARY CYCLIC AN CODES FOR BURST ERROR-CORRECTION
MURAKAMI, R
OHKURA, Y
SHIMADA, R
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1995, E78A (05) : 556 - 559
[24] Paired 2-disjoint path covers of k-ary n-cubes under the partitioned edge fault model
Zhuang, Hongbin
Li, Xiao-Yan
Chang, Jou-Ming
Liu, Ximeng
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2024, 190
[25] Burst error correcting 2(k)-ary cyclic AN codes generated by natural number A(1)center dot p
Murakami, R
Shimada, R
Ohkura, Y
ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 1996, 79 (02): : 1 - 11
[26] THE 2-ERROR LINEAR COMPLEXITY OF 2~n-PERIODIC BINARY SEQUENCES WITH LINEAR COMPLEXITY 2~n-1
Zhu Fengxiang Qi Wenfeng (Department of Applied Mathematics
JournalofElectronics(China), 2007, (03) : 390 - 395
[27] Human Posture Estimation and Sustainable Events Classification via Pseudo-2D Stick Model and K-ary Tree Hashing
Jalal, Ahmad
Akhtar, Israr
Kim, Kibum
SUSTAINABILITY, 2020, 12 (23) : 1 - 24
[28] THE TRANSFORMATION K-2(0)-]K-1(0) BY ELECTRONS
ZELDOVICH, YB
SOVIET PHYSICS JETP-USSR, 1959, 9 (05): : 984 - 987
[29] K0/1-K0/2 MASS DIFFERENCE .2.
BARGER, V
KAZES, E
NUOVO CIMENTO, 1963, 28 (02): : 394 - +
[30] k-error linear complexity of q-ary sequence of period p2
Wu C.
Xu C.
Du X.
Tongxin Xuebao/Journal on Communications, 2019, 40 (12): : 21 - 28

← 1 2 3 4 5 →