Self-Dual Codes and Invariant Theory
One of the most remarkable and beautiful theorems in coding theory is Gleason's 1970 theorem about the weight enumerators of self-dual codes and their connections with invariant theory. In the past 35 years there have been hundreds of papers written about generalizations and applications of thi...
| Main Authors: | , , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg
Springer Berlin Heidelberg
2006, 2006
|
| Edition: | 1st ed. 2006 |
| Series: | Algorithms and Computation in Mathematics
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer eBooks 2005- - Collection details see MPG.ReNa |
Table of Contents:
- The Type of a Self-Dual Code
- Weight Enumerators and Important Types
- Closed Codes
- The Category Quad
- The Main Theorems
- Real and Complex Clifford Groups
- Classical Self-Dual Codes
- Further Examples of Self-Dual Codes
- Lattices
- Maximal Isotropic Codes and Lattices
- Extremal and Optimal Codes
- Enumeration of Self-Dual Codes
- Quantum Codes