๐”– Scriptorium
โœฆ   LIBER   โœฆ
๐Ÿ“

Asymptotic Combinatorial Coding Theory

โœ Scribed by Volodia Blinovsky (auth.)

Publisher
Springer US
Year
1997
Tongue
English
Leaves
115
Series
The Springer International Series in Engineering and Computer Science 415
Edition
1
Category
Library
โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ 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.

โœฆ Table of Contents

Front Matter....Pages i-xxvii
Coding Bounds....Pages 1-6
List Decoding....Pages 7-40
Covering and Packing....Pages 41-61
Decoding Complexity....Pages 63-73
Channel with Defects....Pages 75-78
Some Other Problems....Pages 79-87
Back Matter....Pages 89-93

โœฆ Subjects

Electrical Engineering; Combinatorics; Discrete Mathematics in Computer Science

๐Ÿ“œ SIMILAR VOLUMES

Combinatorial Optimization: Theory and A
๐Ÿ“ Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)
โœ Bernhard Korte, Jens Vygen ๐Ÿ“‚ Library ๐Ÿ“… 2005 ๐Ÿ› Springer ๐ŸŒ English

This is the most comprehensive compilation on combinatorial optiomization I have seen so far. Usually, Papadimitriou's book is a good place for this material - but in many cases, looking for proofs and theorems - I had to use several books: (*) Combinatorial Optimization Algorithms and Complexity by

Combinatorial Optimization: Theory and A
๐Ÿ“ Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)
โœ Bernhard Korte ๐Ÿ“‚ Library ๐Ÿ“… 2012 ๐Ÿ› Springer ๐ŸŒ English

<span>This comprehensive textbook on combinatorial optimization places specialemphasis on theoretical results and algorithms with provably goodperformance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This

Code Based Secret Sharing Schemes: Appli
๐Ÿ“ Code Based Secret Sharing Schemes: Applied Combinatorial Coding Theory
โœ Selda Calkavur, Alexis Bonnecaze, Romar Dela Cruz, Patrick Sole ๐Ÿ“‚ Library ๐Ÿ“… 2022 ๐Ÿ› World Scientific Pub Co Inc ๐ŸŒ English

<p><span>Secret sharing schemes form one of the most important topic in Cryptography. These protocols are used in many areas, applied mathematics, computer science, electrical engineering. A secret is divided into several pieces called shares. Each share is given to a user of the system. Each user h

Code Based Secret Sharing Schemes: Appli
๐Ÿ“ Code Based Secret Sharing Schemes: Applied Combinatorial Coding Theory
โœ Selda Calkavur, Alexis Bonnecaze, Romar Dela Cruz, Patrick Sole ๐Ÿ“‚ Library ๐Ÿ“… 2022 ๐Ÿ› World Scientific Pub Co Inc ๐ŸŒ English

<p><span>Secret sharing schemes form one of the most important topic in Cryptography. These protocols are used in many areas, applied mathematics, computer science, electrical engineering. A secret is divided into several pieces called shares. Each share is given to a user of the system. Each user h

Code Based Secret Sharing Schemes: Appli
๐Ÿ“ Code Based Secret Sharing Schemes: Applied Combinatorial Coding Theory
โœ Selda Calkavur, Alexis Bonnecaze, Romar Dela Cruz, Patrick Sole ๐Ÿ“‚ Library ๐Ÿ“… 2022 ๐Ÿ› World Scientific Pub Co Inc ๐ŸŒ English

<p><span>Secret sharing schemes form one of the most important topic in Cryptography. These protocols are used in many areas, applied mathematics, computer science, electrical engineering. A secret is divided into several pieces called shares. Each share is given to a user of the system. Each user h