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 this the
Self-dual codes and invariant theory
โ Scribed by G Nebe; Eric M Rains; N J A Sloane
- Publisher
- Springer
- Year
- 2006
- Tongue
- English
- Leaves
- 453
- Series
- Algorithms and computation in mathematics, v. 17
- Category
- Library
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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, which has inspired hundreds of papers about generalizations and applications of this theorem to different types of
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, which has inspired hundreds of papers about generalizations and applications of this theorem to different types of