For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Power-Properties of Codes
IEICE TRANSACTIONS on Information and Systems
Publication Date: 2002/03/01
Print ISSN: 0916-8532
Type of Manuscript: LETTER
Category: Theory of Automata, Formal Language Theory
prefix code, suffix code, infix code, strongly infix code,
Full Text: PDF>>
We consider the following three statements for a code L. (P1) For every n 2, both wn Ln and wn+1 Ln+1 imply w L. (P2) For every n 2, if wn Ln, then w L. (P3) For every m, k 2 with m k, wk Lm implies w L. First we show that for every code L, P1 holds. Next we show that for every infix code L, P2 holds, and that a code L is an infix code iff P2 holds and L is a weakly infix code. Last we show that for every strongly infix code L, P3 holds, and that a code L is a strongly infix code iff P3 holds and L is a hyper infix code.