Infinite Two-Dimensional Strong Prefix Codes: Characterization and Properties

被引：3

作者：

Anselmo, Marcella ^{[1
]}

Giammarresi, Dora ^{[2
]}

Madonia, Maria ^{[3
]}

机构：

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

[2] Univ Roma Tor Vergata, Dipartimento Matemat, Via Ric Sci, I-00133 Rome, Italy

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

来源：

CELLULAR AUTOMATA AND DISCRETE COMPLEX SYSTEMS (AUTOMATA 2017) | 2017年 / 10248卷

关键词：

Two-dimensional languages; Prefix codes; Measure; PICTURE; AUTOMATA; TILINGS;

D O I：

10.1007/978-3-319-58631-1_2

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A two-dimensional code is defined as a set of rectangular pictures over an alphabet S such that any picture over S is tilable in at most one way with pictures in X. It is in general undecidable whether a set of pictures is a code, even in the finite case. Recently, finite strong prefix codes were introduced in [3] as a family of decidable picture codes. In this paper we study infinite strong prefix codes and give a characterization for the maximal ones based on iterated extensions. Moreover, we prove some properties regarding the measure of these codes.

引用

页码：19 / 31

页数：13

共 50 条

[21] TWO-DIMENSIONAL CROSSTALK AVOIDANCE CODES
Wu, Xuebin
Yan, Zhiyuan
Xie, Yuan
2008 IEEE WORKSHOP ON SIGNAL PROCESSING SYSTEMS: SIPS 2008, PROCEEDINGS, 2008, : 106 - +
[22] TWO-DIMENSIONAL CYCLIC CODES.
Ikai, Takao
Kosako, Hideo
Kojima, Yosiaki
1600, (57):
[23] Two-dimensional codes come into focus
Hahn, J
LASER FOCUS WORLD, 2000, 36 (08): : 99 - 100
[24] On the redundancy of two-dimensional balanced codes
Ordentlich, E
Roth, RM
1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, : 113 - 113
[25] Two-dimensional codes for low power
Stan, MR
Burleson, WP
1996 INTERNATIONAL SYMPOSIUM ON LOW POWER ELECTRONICS AND DESIGN - DIGEST OF TECHNICAL PAPERS, 1996, : 335 - 340
[26] Conflict detection and resolution in two-dimensional prefix router tables
Lu, HB
Sahni, S
IEEE-ACM TRANSACTIONS ON NETWORKING, 2005, 13 (06) : 1353 - 1363
[27] Two-dimensional prefix string matching and covering on square matrices
Crochemore, M
Iliopoulos, CS
Korda, M
ALGORITHMICA, 1998, 20 (04) : 353 - 373
[28] Two-Dimensional Prefix String Matching and Covering on Square Matrices
M. Crochemore
C. S. Iliopoulos
M. Korda
Algorithmica, 1998, 20 : 353 - 373
[29] Facets of two-dimensional infinite group problems
Dey, Santanu S.
Richard, Jean-Philippe P.
MATHEMATICS OF OPERATIONS RESEARCH, 2008, 33 (01) : 140 - 166
[30] Infinite-alphabet prefix codes optimal for β-exponential penalties
Baer, Michael B.
2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 891 - 895

← 1 2 3 4 5 →