AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
Codes and Association Schemes
About this Title
Alexander Barg, Bell Labs - Lucent Technologies, Murray Hill, NJ and Simon Litsyn, Tel Aviv University, Tel Aviv, Israel, Editors
Publication: DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Publication Year:
2001; Volume 56
ISBNs: 978-0-8218-2074-2 (print); 978-1-4704-4014-5 (online)
DOI: https://doi.org/10.1090/dimacs/056
MathSciNet review: MR1816383
MSC: Primary 94-06; Secondary 05-06
ReadershipTable of Contents
Front/Back Matter
Chapters
- Harmonic weight enumerators of nonbinary codes and MacWilliams identities
- Numerical results on the asymptotic rate of binary codes
- Weakly biased arrays, almost independent arrays and error-correcting codes
- Indexes of spherical codes
- Codes over $\mathbb Z_{p^n}$ and association schemes
- Bent, resilient functions and the numerical normal form
- On identifying codes
- Ternary Hamming and binary perfect covering codes
- A Riemann hypothesis analogue for self-dual codes
- On perfect codes in the Johnson scheme
- On perfect constant weight codes
- On additive $GF(4)$ codes
- Integral zeroes of Krawtchouk polynomials
- Some algebra related to $P$- and $Q$-polynomial association schemes
- Bounds for the Christoffel-Darboux kernel of the binary Krawtchouk polynomials
- Survey of binary Krawtchouk polynomials
- On an algebraic method for bounding the covering radius
- Design systems: Combinatorial characterizations of Delsarte $\mathcal T$-designs via partially ordered sets
- The isomorphism problem for circulant graphs via Schur ring theory
- New 1-generator quasi-twisted codes over GF(5)
- Communication complexity and orthogonal polynomials
- Estimates of the distance distribution of nonbinary codes, with applications