Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDIMACS Workshop: Codes and Association Schemes 1999
- Alexander Barg, Simon Litsyn:
Codes and Association Schemes, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, November 9-12, 1999. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 56, DIMACS/AMS 2001, ISBN 978-0-8218-2074-2 - Preface. Codes and Association Schemes 1999: ix-
- Foreword. Codes and Association Schemes 1999: xi-
- Christine Bachoc:
Harmonic weight enumerators of nonbinary codes and MacWilliams identities. 1-23 - Alexander Barg, David B. Jaffe:
Numerical results on the asymptotic rate of binary codes. 25-32 - Jürgen Bierbrauer, Holger Schellwat:
Weakly biased arrays, almost independent arrays and error-correcting codes. 33-46 - Peter G. Boyvalenkov
, Danyo Danev, Peter Kazakov:
Indexes of spherical codes. 47-57 - Paul Camion:
Codes over Zpn and association schemes. 59-86 - Claude Carlet, Philippe Guillot:
Bent, resilient functions and the numerical normal form. 87-96 - Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor:
On identifying codes. 97-109 - Italo J. Dejter, Kevin T. Phelps:
Ternary Hamming and binary perfect covering codes. 111-113 - Iwan M. Duursma:
A Riemann hypothesis analogue for self-dual codes. 115-124 - Tuvi Etzion:
On perfect codes in the Johnson scheme. 125-130 - Tuvi Etzion, Jack H. van Lint:
On perfect constant weight codes. 131-134 - Philippe Gaborit, W. Cary Huffman, Jon-Lark Kim, Vera Pless:
On additive GF(4) codes. 135-149 - Laurent Habsieger:
Integral zeroes of Krawtchouk polynomials. 151-165 - Tatsuro Ito, Kenichiro Tanabe, Paul M. Terwilliger:
Some algebra related to P- and Q-polynomial association schemes. 167-192 - Ilia Krasikov:
Bounds for the Christoffel-Darboux kernel of the binary Krawtchouk polynomials. 193-198 - Ilia Krasikov, Simon Litsyn:
Survey of binary Krawtchouk polynomials. 199-211 - Tero Laihonen:
On an algebraic method for bounding the covering radius. 213-221 - William J. Martin:
Design systems: Combinatorial characterizations of Delsarte $\mathcal T$-designs via partially ordered sets. 223-239 - Mikhail E. Muzychuk, Mikhail H. Klin, Reinhard Pöschel:
The isomorphism problem for circulant graphs via Schur ring theory. 241-264 - Irfan Siap, Nuh Aydin, Dijen K. Ray-Chaudhuri:
New 1-generator quasi-twisted codes over GF(5). 265-275 - Ulrich Tamm:
Communication complexity and orthogonal polynomials. 277-285 - Alexei E. Ashikhmin, Alexander Barg, Simon Litsyn:
Estimates of the distance distribution of nonbinary codes, with applications. 287-301
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 04:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
