Self-dual codes and invariant theory
β G Nebe; Eric M Rains; N J A Sloane
π Library
π
2006
π Springer
π English
β¦ LIBER β¦
π
Self-Dual Codes and Invariant Theory (Algorithms and Computation in Mathematics)
β Scribed by Gabriele Nebe, Eric M. Rains, Neil J. A. Sloane
- Year
- 2006
- Tongue
- English
- Leaves
- 448
- Edition
- 1
- Category
- Library
β¬ Acquire This Volume
No coin nor oath required. For personal study only.
β¦ Synopsis
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 codes. This self-contained book develops a new theory which is powerful enough to include all the earlier generalizations.
π SIMILAR VOLUMES
Self-Dual Codes and Invarient Theory
β Gabriele Nebe, Eric M. Rains, Neil J. A. Sloane
π Library
π
2006
π Springer
π English
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
β Gabriele Nebe, Eric M. Rains, Neil J. A. Sloane
π Library
π
2010
π Springer
π English
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
Self-Dual Codes and Invariant Theory
β Gabriele Nebe, Eric M. Rains, Neil J.A. Sloane
π Library
π
2006
π Springer
π English
Algorithms in Invariant Theory (Texts an
β Bernd Sturmfels
π Library
π
2008
π English
This book is both an easy-to-read textbook for invariant theory and a challenging research monograph that introduces a new approach to the algorithmic side of invariant theory. Students will find the book an easy introduction to this "classical and new" area of mathematics. Researchers in mathematic
Classification Algorithms for Codes and
β Petteri Kaski, Patric R.J. ΓstergΓ₯rd
π Library
π
2005
π Springer
π English
<P>This book considers one of the basic problems in discrete mathematics: given a collection of constraints, describe up to isomorphism all the objects that meet them. Only a handful of classification results for combinatorial objects are dated before the mid-20th century; indeed, it is through mode