Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 106-107
Volume 106-107, September 1992
- Emile H. L. Aarts, Peter J. M. van Laarhoven:
Local search in coding theory. 11-18 - K. T. Arasu, Alexander Pott:
Cyclic affine planes and Paley difference sets. 19-23 - E. F. Assmus Jr.:
On the Reed-Muller codes. 25-33 - Richard E. Blahut:
A note on binary cyclic codes of blocklength 63. 35-43 - Vladimir M. Blinovsky:
List decoding. 45-51 - Aart Blokhuis, Andries E. Brouwer:
Locally K3, 3 or Petersen graphs. 53-60 - Aart Blokhuis, Tamás Szönyi:
Note on the structure of semiovals in finite projective planes. 61-65 - C. J. Bouwkamp:
On some new simple perfect squared squares. 67-75 - Andries E. Brouwer, Willem H. Haemers
:
Structure and uniqueness of the (81, 20, 1, 6) strongly regular graph. 77-82 - Andries E. Brouwer, Henny A. Wilbrink, Willem H. Haemers:
Some 2-ranks. 83-92 - Aiden A. Bruen, J. Chris Fisher:
An observation on certain point-line configurations in classical planes. 93-96 - N. G. de Bruijn:
Penrose patterns are almost entirely determined by two points. 97-104 - A. Robert Calderbank:
Covering machines. 105-110 - Peter J. Cameron:
Almost all quasigroups have rank 2. 111-115 - Pier Vittorio Ceccherini, J. W. P. Hirschfeld:
The dimension of projective geometry codes. 117-126 - Frank De Clerck, Norman L. Johnson:
Subplane covered nets and semipartial geometries. 127-134 - Peter J. Cameron, Arjeh M. Cohen:
On the number of fixed point free elements in a permutation group. 135-138 - Arjeh M. Cohen, Bruce N. Cooperstein:
Generalized hexagons of even order. 139-146 - Gérard D. Cohen, Simon Litsyn:
On the covering radius of Reed-Muller codes. 147-155 - József Dénes, A. Donald Keedwell:
A new authentication scheme based on latin squares. 157-161 - Michel Deza, Monique Laurent:
Extension operations for cuts. 163-179 - Persi Diaconis, Ronald L. Graham:
Binomial coefficient codes over GF(2). 181-188 - Sam Dolinar, Tsz-Mei Ko, Robert J. McEliece:
Some VLSI decompositions of the de Bruijn graph. 189-198 - Thomas H. E. Ericson, Victor A. Zinoviev:
On spherical codes generating the kissing number in dimensions 8 and 24. 199-207 - Gerard van der Geer, Marcel van der Vlugt:
Weight distributions for a certain class of codes and maximal curves. 209-218 - Solomon W. Golomb:
Probability, information theory, and prime number theory. 219-229 - Dirk Hachenberger, Dieter Jungnickel:
Translation nets: a survey. 231-242 - J. I. Hall:
Local indecomposability of certain geometric graphs. 243-254 - Ronald H. Hardin, Neil J. A. Sloane:
New spherical 4-designs. 255-264 - Tor Helleseth:
Projective codes meeting the Griesmer bound. 265-271 - Ray Hill, Jehangir P. Karim:
Searching with lies: the Ulam problem. 273-283 - Alan J. Hoffman:
On simple combinatorial optimization problems. 285-289 - Iiro S. Honkala:
On lengthening of covering codes. 291-295 - William M. Kantor:
Kerdock codes and related planes. 297-302 - David A. Klarner, Karel A. Post:
Some fascinating integer sequences. 303-309 - Torleiv Kløve:
Support weight distribution of linear codes. 311-316 - Ivan N. Landgev:
On block designs with repeated blocks. 317-328 - Hendrik W. Lenstra Jr.:
On the inverse Fermat equation. 329-331 - Antoine Lobstein:
On perfect arithmetic codes. 333-336 - James L. Massey:
Linear codes with complementary duals. 337-342 - Harold F. Mattson:
Fault-detection in networks. 343-352 - Arnold Neumaier:
Completely regular codes. 353-360 - Harald Niederreiter:
Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes. 361-367 - Ruud Pellikaan:
On decoding by error location and dependent sets of error positions. 369-381 - Fred Piper, Peter R. Wild:
Incidence structures applied to cryptography. 383-389 - Vera Pless:
More on the uniqueness of the Golay codes. 391-398 - Dwijendra K. Ray-Chaudhuri, Tianbao Zhu:
A recursive method for construction of designs. 399-406 - J. Pieter M. Schalkwijk:
Some aspects of the information theoretic dialogue. 407-413 - Alexander Schrijver:
Circuits in graphs embedded on the torus. 415-433 - J. J. Seidel:
A note on path-zero graphs. 435-438 - Juriaan Simonis:
The [18, 9, 6] code is unique. 439-448 - Edward Spence:
Is Taylor's graph geometric? 449-454 - Leo Storme, Joseph A. Thas:
Complete k-arcs in PG(n, q), q even. 455-469 - Aimo Tietäväinen:
On the cardinality of sets of sequences with given maximum correlation. 471-477 - Henk C. A. van Tilborg:
Fire codes revisited. 479-482 - Ludo M. G. M. Tolhuizen, C. P. M. J. Baggen:
On the weight enumerator of product codes. 483-488 - Vladimir D. Tonchev:
Some small non-embeddable designs. 489-492 - Vladimir D. Tonchev, Scott A. Vanstone:
On Kirkman triple systems of order 33. 493-496 - Jack K. Wolf:
Efficient circuits for multiplying in GF(2m) for certain values of m. 497-502
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-19 19:21 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:
