Asymptotic Combinatorial Coding Theory / Edition 1

by Volodia Blinovsky

Overview

Asymptotic Combinatorial Coding Theory is devoted to the investigation of the combinatorial properties of transmission systems using discrete signals. The book presents results of interest to specialists in combinatorics seeking to apply combinatorial methods to problems of combinatorial coding theory.
Asymptotic Combinatorial Coding Theory serves as an excellent reference for resarchers in discrete mathematics, combinatorics, and combinatorial coding theory, and may be used as a text for advanced courses on the subject.

Product Details

ISBN-13:	9780792399889
Publisher:	Springer US
Publication date:	08/31/1997
Series:	The Springer International Series in Engineering and Computer Science , #415
Edition description:	1997
Pages:	93
Product dimensions:	6.10(w) x 9.25(h) x 0.01(d)

Table of Contents

1. Coding Bounds.- 2. List Decoding.- 3. Covering And Packing.- 4. Decoding Complexity.- 5. Channel With Defects.- 6. Some Other Problems.- References.

Editorial Reviews

A collection of problems that have been investigated or solved by scientists from Russia and most of which have not been published in monographs before. The main problem in the theory is to prove the tightness of the asymptotic Varshamov-Gilbert bound for a binary code, which is still awaiting the kiss of its Professor Charming. The topics are coding bounds, list decoding, covering anc packing, decoding complexity, a channel with defects, and some other problems. Annotation c. by Book News, Inc., Portland, Or.

Booknews