Catalogo Articoli (Spogli Riviste)

OPAC HELP

Titolo:
On codes with a finite deciphering delay: constructing uncompletable words
Autore:
Neraud, J; Selmi, C;
Indirizzi:
Univ Rouen, Fac Sci, Lab Informat Fond & Appl Rouen, F-76821 Mt St Aignan,France Univ Rouen Mt St Aignan France F-76821 ouen, F-76821 Mt St Aignan,France
Titolo Testata:
THEORETICAL COMPUTER SCIENCE
fascicolo: 1-2, volume: 255, anno: 2001,
pagine: 151 - 162
SICI:
0304-3975(20010328)255:1-2<151:OCWAFD>2.0.ZU;2-S
Fonte:
ISI
Lingua:
ENG
Keywords:
code; prefix code; uniform code; deciphering delay; complete subset.; right uncompletable word; uncompletable word;
Tipo documento:
Article
Natura:
Periodico
Settore Disciplinare:
Engineering, Computing & Technology
Citazioni:
14
Recensione:
Indirizzi per estratti:
Indirizzo: Neraud, J Univ Rouen, Fac Sci, Lab Informat Fond & Appl Rouen, Pl Emile Blondel, F-76821 Mt St Aignan, France Univ Rouen Pl Emile Blondel Mt St Aignan France F-76821 France
Citazione:
J. Neraud e C. Selmi, "On codes with a finite deciphering delay: constructing uncompletable words", THEOR COMP, 255(1-2), 2001, pp. 151-162

Abstract

Let X be a non-complete code with a finite deciphering delay. We prove that an uncompletable word w of length O(m(2)d(2)) exists, where d stands for the delay and m stands for the length of the longest words in X. The proof leads to an explicit construction of w. This result partially resolves a conjecture proposed by Antonio Restive in 1979. (C) 2001 Elsevier Science B.V. All rights reserved.

ASDD Area Sistemi Dipartimentali e Documentali, Università di Bologna, Catalogo delle riviste ed altri periodici
Documento generato il 06/04/20 alle ore 21:40:30