List Decoding of Error-Correcting Codes Winning Thesis of the 2002 ACM Doctoral Dissertation Competition /

How can one exchange information e?ectively when the medium of com- nication introduces errors? This question has been investigated extensively starting with the seminal works of Shannon (1948) and Hamming (1950), and has led to the rich theory of "error-correcting codes". This theory has...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Guruswami, Venkatesan (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
Edición:1st ed. 2005.
Colección:Lecture Notes in Computer Science, 3282
Temas:
Data structures (Computer science).
Information theory.
Coding theory.
Algorithms.
Computer science.
Computer science-Mathematics.
Discrete mathematics.
Data Structures and Information Theory.
Coding and Information Theory.
Models of Computation.
Discrete Mathematics in Computer Science.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 1 Introduction
  • 1 Introduction
  • 2 Preliminaries and Monograph Structure
  • I Combinatorial Bounds
  • 3 Johnson-Type Bounds and Applications to List Decoding
  • 4 Limits to List Decodability
  • 5 List Decodability Vs. Rate
  • II Code Constructions and Algorithms
  • 6 Reed-Solomon and Algebraic-Geometric Codes
  • 7 A Unified Framework for List Decoding of Algebraic Codes
  • 8 List Decoding of Concatenated Codes
  • 9 New, Expander-Based List Decodable Codes
  • 10 List Decoding from Erasures
  • III Applications
  • Interlude
  • III Applications
  • 11 Linear-Time Codes for Unique Decoding
  • 12 Sample Applications Outside Coding Theory
  • 13 Concluding Remarks
  • A GMD Decoding of Concatenated Codes.

Ejemplares similares