Asymptotic Combinatorial Coding Theory
Volodia BlinovskyBooks.org participates in affiliate programs including Bookshop.org and the Amazon Services LLC Associates Program. We may earn a commission from qualifying purchases made through links on this page, at no additional cost to you.
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.
Synopsis
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.
Booknews
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.