CONGRUENCES, INFIX AND COHESIVE PREFIX CODES

Authors
ITO M THIERRIN G
Citation
M. Ito et G. Thierrin, CONGRUENCES, INFIX AND COHESIVE PREFIX CODES, Theoretical computer science, 136(2), 1994, pp. 471-485
Citations number
6
Categorie Soggetti
Computer Sciences","Computer Science Theory & Methods
Journal title
Theoretical computer science → ACNP
ISSN journal
03043975
Volume
136
Issue
2
Year of publication
1994
Pages
471 - 485
Database
ISI
SICI code
0304-3975(1994)136:2<471:CIACPC>2.0.ZU;2-7
Abstract
A language L subset of or equal to X is called a cohesive prefix code if xLy boolean AND L not equal 0 implies that y=1 and xL subset of or equal to L for any x, y is an element of X. An example of cohesive p refix codes is an infix code. We determine first the structure of cohe sive prefix codes and then we study several relationships between maxi mal infix; codes and maximal cohesive prefix codes. Finally, we determ ine the structure of a cohesive prefix code that is a right semaphore code.