English [en] · PDF · 4.7MB · 2006 · 📘 Book (non-fiction) · 🚀/lgli/scihub/upload/zlib · Save
description
"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 theorem to different types of codes. This self-contained book develops a new theory which is powerful enough to include all the earlier generalizations. It is also in part an encyclopedia that gives a very extensive list of the different types of self-dual codes and their properties, including tables of the best codes that are presently known. Besides self-dual codes, the book also discusses two closely-related subjects, lattices and modular forms, and quantum error-correcting codes. This book, written by the leading experts in the subject, has no equivalent in the literature and will be of great interest to mathematicians, communication theorists, computer scientists and physicists."--Publisher's description
Alternative filename
scihub/10.1007/3-540-30731-1.pdf
Alternative filename
scihub/10.1007/978-3-540-30731-0.pdf
Alternative title
Self-Dual Codes and Invariant Theory (Algorithms and Computation in Mathematics Book 17)
Alternative title
Unbekannt
Alternative author
Gabriele Nebe, Eric M. Rains, Neil J. A. Sloane, Gabriele Nebe
Alternative author
Nebe, Gabriele, Rains, Eric M., Sloane, Neil J. A.
Alternative author
Springer-Verlag GmbH & Co. KG
Alternative author
G Nebe, (Gabriele), 1967-
Alternative publisher
Springer Spektrum. in Springer-Verlag GmbH
Alternative publisher
Steinkopff. in Springer-Verlag GmbH
Alternative edition
Algorithms and Computation in Mathematics, 17, 1st ed. 2006, Berlin, Heidelberg, 2006
Alternative edition
Algorithms and computation in mathematics, v. 17, Berlin ; New York, 2006
Alternative edition
Algorithms and Computation in Mathematics (Book 17), May 20, 2006
Alternative edition
Algorithms and computation in mathematics, Berlin, c2006
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.
Alternative description
One of the most remarkable theorems in coding theory is Gleason's 1970 theorem about the weight enumerators of self-dual codes and their connections with invariant theory. Part of an encyclopedia listing the different types of self-dual codes and their properties, this book develops a different theory.
Repository ID for the 'libgen' repository in Libgen.li. Directly taken from the 'libgen_id' field in the 'files' table. Corresponds to the 'thousands folder' torrents.
Repository ID for the 'scimag' repository in Libgen.li. Directly taken from the 'scimag_id' field in the 'files' table. Corresponds to the 'thousands folder' torrents.
All download options have the same file, and should be safe to use. That said, always be cautious when downloading files from the internet, especially from sites external to Anna’s Archive. For example, be sure to keep your devices updated.
Support authors and libraries
✍️ If you like this and can afford it, consider buying the original, or supporting the authors directly.
📚 If this is available at your local library, consider borrowing it for free there.
📂 File quality
Help out the community by reporting the quality of this file! 🙌
A “file MD5” is a hash that gets computed from the file contents, and is reasonably unique based on that content. All shadow libraries that we have indexed on here primarily use MD5s to identify files.
A file might appear in multiple shadow libraries. For information about the various datasets that we have compiled, see the Datasets page.