An Introduction to Algebraic and Combinatorial Coding Theory - 1st Edition - ISBN: 9780121035600, 9781483260297

An Introduction to Algebraic and Combinatorial Coding Theory

1st Edition

Authors: Ian F. Blake Ronald C. Mullin
eBook ISBN: 9781483260297
Imprint: Academic Press
Published Date: 1st January 1976
Page Count: 242
Tax/VAT will be calculated at check-out Price includes VAT (GST)
30% off
30% off
30% off
30% off
30% off
20% off
20% off
30% off
30% off
30% off
30% off
30% off
20% off
20% off
30% off
30% off
30% off
30% off
30% off
20% off
20% off
43.99
30.79
30.79
30.79
30.79
30.79
35.19
35.19
54.95
38.47
38.47
38.47
38.47
38.47
43.96
43.96
72.95
51.06
51.06
51.06
51.06
51.06
58.36
58.36
Unavailable
Price includes VAT (GST)
× DRM-Free

Easy - Download and start reading immediately. There’s no activation process to access eBooks; all eBooks are fully searchable, and enabled for copying, pasting, and printing.

Flexible - Read on multiple operating systems and devices. Easily read eBooks on smart phones, computers, or any eBook readers, including Kindle.

Open - Buy once, receive and download all available eBook formats, including PDF, EPUB, and Mobi (for Kindle).

Institutional Access

Secure Checkout

Personal information is secured with SSL technology.

Free Shipping

Free global shipping
No minimum order.

Description

An Introduction to Algebraic and Combinatorial Coding Theory focuses on the principles, operations, and approaches involved in the combinatorial coding theory, including linear transformations, chain groups, vector spaces, and combinatorial constructions.

The publication first offers information on finite fields and coding theory and combinatorial constructions and coding. Discussions focus on quadratic residues and codes, self-dual and quasicyclic codes, balanced incomplete block designs and codes, polynomial approach to coding, and linear transformations of vector spaces over finite fields.

The text then examines coding and combinatorics, including chains and chain groups, equidistant codes, matroids, graphs, and coding, matroids, and dual chain groups. The manuscript also ponders on Möbius inversion formula, Lucas's theorem, and Mathieu groups.

The publication is a valuable source of information for mathematicians and researchers interested in the combinatorial coding theory.

Table of Contents


Preface

Preface to the Original Edition

Acknowledgment

1. Finite Fields and Coding Theory

1.1 Introduction

1.2 Fields, Extensions, and Polynomials

1.3 Fundamental Properties of Finite Fields

1.4 Vector Spaces over Finite Fields

1.5 Linear Codes

1.6 Polynomials Over Finite Fields

1.7 Cyclic Codes

1.8 Linear Transformations of Vector Spaces Over Finite Fields

1.9 Code Invariance Under Permutation Groups

1.10 The Polynomial Approach to Coding

1.11 Bounds on Code Dictionaries

1.12 Comments

Exercises

2. Combinatorial Constructions and Coding

2.1 Introduction

2.2 Finite Geometries: Their Collineation Groups and Codes

2.3 Balanced Incomplete Block Designs and Codes

2.4 Latin Squares and Steiner Triple Systems

2.5 Quadratic Residues and Codes

2.6 Hadamard Matrices, Difference Sets, and Their Codes

2.7 Self-Dual and Quasicyclic Codes

2.8 Perfect Codes

2.9 Comments

Exercises

3. Coding and Combinatorics

3.1 Introduction

3.2 General t Designs

3.3 Matroids

3.4 Chains and Chain Groups

3.5 Dual Chain Groups

3.6 Matroids, Graphs, and Coding

3.7 Perfect Codes and t Designs

3.8 Nearly Perfect Codes and t Designs

3.9 Balanced Codes and t Designs

3.10 Equidistant Codes

3.11 Comments

Exercises

Appendix A. The Möbius Inversion Formula

Appendix B. Lucas's Theorem

Appendix C. The Mathieu Groups

References

Index

Details

No. of pages:
242
Language:
English
Copyright:
© Academic Press 1976
Published:
Imprint:
Academic Press
eBook ISBN:
9781483260297

About the Author

Ian F. Blake

Ronald C. Mullin