On a Family of Codes with Bounded Deciphering Delay

Autor:	Long Van Do, Igor Litovsky
Rok vydání:	2003
Předmět:	Block code Theoretical computer science Regular language Bounded function Luby transform code Linear code Online codes Decoding methods Mathematics
Zdroj:	Developments in Language Theory ISBN: 9783540404316 Developments in Language Theory
Popis:	A special kind of codes with bounded deciphering delay, called k-comma-free codes, is considered. The advantage in using these codes is that the decoding can begin "anywhere" in a coded message. This means that a coded message can be deciphered even when it might be lost partially. Related families of codes with bounded deciphering delay are also considered. Criteria to test these codes are established in a unified way.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::70bcfe8a55d6ffb066d6a12d1d0796de https://doi.org/10.1007/3-540-45005-x_33 Zobrazit plný text záznamu