PREFIX PICTURE CODES: A DECIDABLE CLASS OF TWO-DIMENSIONAL CODES

Author:

ANSELMO MARCELLA1,GIAMMARRESI DORA2,MADONIA MARIA3

Affiliation:

1. Dipartimento di Informatica, Università di Salerno, V. Giovanni Paolo II, 132 I-84084, Fisciano (SA), Italy

2. Dipartimento di Matematica. Università di Roma “Tor Vergata” Via della Ricerca Scientifica 00133 Roma, Italy

3. Dipartimento di Matematica e Informatica, Università di Catania, Viale Andrea Doria 6/a 95125 Catania, Italy

Abstract

A two-dimensional code of pictures is defined as a set X ⊆ Σ** such that any picture over Σ is tilable in at most one way with pictures in X. It is proved that in general it is undecidable whether a finite set of picture is a code. The subclass of prefix codes is introduced and it is proved that it is decidable whether a finite set of pictures is a prefix code. Further a polynomial time decoding algorithm for finite prefix codes is given. Maximality and completeness of finite prefix codes are studied.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Cited by 15 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Two-dimensional Fibonacci words: Tandem repeats and factor complexity;Advances in Applied Mathematics;2023-08

2. Characterization and measure of infinite two-dimensional strong prefix codes;Information and Computation;2020-10

3. Two-Dimensional Codes;Lecture Notes in Computer Science;2020

4. Sets of Pictures Avoiding Overlaps;International Journal of Foundations of Computer Science;2019-09

5. Full sets of pictures to encode pictures;Theoretical Computer Science;2019-07

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3