Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 3
Volume 3, Numbers 1-3, 1972
- E. F. Assmus Jr., H. F. Mattson Jr.:
On weights in quadratic-residue codes. 1-20 - E. F. Assmus Jr., H. F. Mattson Jr.:
Contractions of self-orthogonal codes. 21-32 - P. Camion:
Linear codes with given automorphism groups. 33-45 - Philippe Delsarte:
Weights of linear codes and strongly regular normed spaces. 47-64 - Jean-Marie Goethals, S. L. Snover:
Nearly perfect binary codes. 65-88 - Mu Y. Hsiao:
Incomplete block design codes for ultra high speed computer applications. 89-108 - Selmer Johnson:
Upper bounds for constant weight error correcting codes. 109-124 - Hendrik W. Lenstra Jr.:
Two theorems on perfect codes. 125-132 - F. Jessie MacWilliams:
Cyclotomic numbers, coding theory and orthogonal polynomials. 133-151 - F. Jessie MacWilliams, Neil J. A. Sloane, John G. Thompson:
Good self dual codes exist. 153-162 - James L. Massey, Michael K. Sain, John M. Geist:
Certain infinite Markov chains and sequential decoding. 163-175 - Robert J. McEliece:
Weight congruences for p-ary cyclic codes. 177-192 - Jim K. Omura:
Iterative decoding of linear codes by a modulo-2 linear program. 193-208 - Vera Pless:
A classification of self-orthogonal codes over GF(2). 209-246 - William J. Rosenberg:
Consecutive zeros in convolutional codewords. 247-264 - Neil J. A. Sloane:
A survey of constructive coding theory, and a table of binary codes of highest known rate. 265-294
Volume 3, Number 4, 1972
- Andreas Blass:
Complexity of winning strategies. 295-300 - Vasek Chvátal, Paul Erdös, Z. Hedrlín:
Ramsey's theorem and self-complementary graphs. 301-304 - Frank H. Clarke:
A graph polynomial and its applications. 305-313 - Robert Cori:
Sur la rationalité de certaines séries génératrices. 315-332 - Jean-Pierre Deschamps:
Parametric solutions of Boolean equations. 333-342 - Haim Hanani, Dwijendra K. Ray-Chaudhuri, Richard M. Wilson:
On resolvable designs. 343-357 - Murray Hochberg:
Restricted Sperner families and s-Systems. 359-364 - Charles L. Lawson:
Transforming triangulations. 365-372 - Michel Tréhel:
Graphes des complements et classes de branches dans un ensemble ordonne fini resultant d'un produit contracte. 373-379 - Jacobus H. van Lint, H. J. Ryser:
Block designs with repeated blocks. 381-396 - W. D. Wallis:
A doubling construction for room squares. 397-399
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-17 20:32 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:
