Vyhledávat v databázi titulů je možné dle ISBN, ISSN, EAN, č. ČNB, OCLC či vlastního identifikátoru. Vyhledávat lze i v databázi autorů dle id autority či jména.
Projekt ObalkyKnih.cz sdružuje různé zdroje informací o knížkách do jedné, snadno použitelné webové služby. Naše databáze v tuto chvíli obsahuje 3150225 obálek a 950558 obsahů českých a zahraničních publikací. Naše API využívá většina knihoven v ČR.
List decoding of error-correcting codes :winning thesis of the 2002 ACM doctoral dissertation competition
Autor: Guruswami Venkatesan
Rok: c2004
ISBN: 9783540240518
OKCZID: 110050975
Citace (dle ČSN ISO 690):
GURUSWAMI, Venkatesan. List decoding of error-correcting codes: winning thesis of the 2002 ACM doctoral dissertation competition. Berlin: Springer, c2004. xix, 350 s. Lecture notes in computer science, 3282.
Anotace
This monograph is a thoroughly revised and extended version of the author's PhD thesis, which was selected as the winning thesis of the 2002 ACM Doctoral Dissertation Competition. Venkatesan Guruswami did his PhD work at the MIT with Madhu Sudan as thesis adviser. Starting with the seminal work of Shannon and Hamming, coding theory has generated a rich theory of error-correcting codes. This theory has traditionally gone hand in hand with the algorithmic theory of decoding that tackles the problem of recovering from the transmission errors efficiently. This book presents some spectacular new results in the area of decoding algorithms for error-correcting codes. Specificially, it shows how the notion of list-decoding can be applied to recover from far more errors, for a wide variety of error-correcting codes, than achievable before The style of the exposition is crisp and the enormous amount of information on combinatorial results, polynomial time list decoding algorithms, and applications is presented in well structured form.