The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1992, volume: 106, number:

  1. Emile H. L. Aarts, Peter J. M. van Laarhoven
    Local search in coding theory. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:11-18 [Journal]
  2. K. T. Arasu, Alexander Pott
    Cyclic affine planes and Paley difference sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:19-23 [Journal]
  3. E. F. Assmus Jr.
    On the Reed-Muller codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:25-33 [Journal]
  4. Richard E. Blahut
    A note on binary cyclic codes of blocklength 63. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:35-43 [Journal]
  5. V. M. Blinovsky
    List decoding. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:45-51 [Journal]
  6. Aart Blokhuis, Andries E. Brouwer
    Locally K3, 3 or Petersen graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:53-60 [Journal]
  7. Aart Blokhuis, Tamás Szönyi
    Note on the structure of semiovals in finite projective planes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:61-65 [Journal]
  8. C. J. Bouwkamp
    On some new simple perfect squared squares. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:67-75 [Journal]
  9. Andries E. Brouwer, Willem H. Haemers
    Structure and uniqueness of the (81, 20, 1, 6) strongly regular graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:77-82 [Journal]
  10. Andries E. Brouwer, Henny A. Wilbrink, Willem H. Haemers
    Some 2-ranks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:83-92 [Journal]
  11. A. A. Bruen, J. Chris Fisher
    An observation on certain point-line configurations in classical planes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:93-96 [Journal]
  12. N. G. de Bruijn
    Penrose patterns are almost entirely determined by two points. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:97-104 [Journal]
  13. A. Robert Calderbank
    Covering machines. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:105-110 [Journal]
  14. Peter J. Cameron
    Almost all quasigroups have rank 2. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:111-115 [Journal]
  15. Pier Vittorio Ceccherini, J. W. P. Hirschfeld
    The dimension of projective geometry codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:117-126 [Journal]
  16. Frank De Clerck, N. L. Johnson
    Subplane covered nets and semipartial geometries. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:127-134 [Journal]
  17. Peter J. Cameron, Arjeh M. Cohen
    On the number of fixed point free elements in a permutation group. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:135-138 [Journal]
  18. Arjeh M. Cohen, Bruce N. Cooperstein
    Generalized hexagons of even order. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:139-146 [Journal]
  19. Gérard D. Cohen, Simon Litsyn
    On the covering radius of Reed-Muller codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:147-155 [Journal]
  20. József Dénes, A. Donald Keedwell
    A new authentication scheme based on latin squares. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:157-161 [Journal]
  21. Michel Deza, Monique Laurent
    Extension operations for cuts. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:163-179 [Journal]
  22. Persi Diaconis, Ronald L. Graham
    Binomial coefficient codes over GF(2). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:181-188 [Journal]
  23. Sam Dolinar, Tsz-Mei Ko, Robert J. McEliece
    Some VLSI decompositions of the de Bruijn graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:189-198 [Journal]
  24. Gerard van der Geer, Marcel van der Vlugt
    Weight distributions for a certain class of codes and maximal curves. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:209-218 [Journal]
  25. Solomon W. Golomb
    Probability, information theory, and prime number theory. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:219-229 [Journal]
  26. Dirk Hachenberger, Dieter Jungnickel
    Translation nets: a survey. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:231-242 [Journal]
  27. J. I. Hall
    Local indecomposability of certain geometric graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:243-254 [Journal]
  28. R. H. Hardin, N. J. A. Sloane
    New spherical 4-designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:255-264 [Journal]
  29. Tor Helleseth
    Projective codes meeting the Griesmer bound. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:265-271 [Journal]
  30. Ray Hill, Jehangir P. Karim
    Searching with lies: the Ulam problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:273-283 [Journal]
  31. Iiro S. Honkala
    On lengthening of covering codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:291-295 [Journal]
  32. William M. Kantor
    Kerdock codes and related planes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:297-302 [Journal]
  33. David A. Klarner, Karel Post
    Some fascinating integer sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:303-309 [Journal]
  34. Torleiv Kløve
    Support weight distribution of linear codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:311-316 [Journal]
  35. Ivan N. Landgev
    On block designs with repeated blocks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:317-328 [Journal]
  36. H. W. Lenstra
    On the inverse Fermat equation. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:329-331 [Journal]
  37. Antoine Lobstein
    On perfect arithmetic codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:333-336 [Journal]
  38. James L. Massey
    Linear codes with complementary duals. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:337-342 [Journal]
  39. H. F. Mattson
    Fault-detection in networks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:343-352 [Journal]
  40. Arnold Neumaier
    Completely regular codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:353-360 [Journal]
  41. Harald Niederreiter
    Orthogonal arrays and other combinatorial aspects in the theory of uniform point distributions in unit cubes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:361-367 [Journal]
  42. Ruud Pellikaan
    On decoding by error location and dependent sets of error positions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:369-381 [Journal]
  43. Fred Piper, Peter R. Wild
    Incidence structures applied to cryptography. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:383-389 [Journal]
  44. Vera Pless
    More on the uniqueness of the Golay codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:391-398 [Journal]
  45. D. K. Ray-Chaudhuri, Tianbao Zhu
    A recursive method for construction of designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:399-406 [Journal]
  46. J. Pieter M. Schalkwijk
    Some aspects of the information theoretic dialogue. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:407-413 [Journal]
  47. Alexander Schrijver
    Circuits in graphs embedded on the torus. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:415-433 [Journal]
  48. J. J. Seidel
    A note on path-zero graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:435-438 [Journal]
  49. Juriaan Simonis
    The [18, 9, 6] code is unique. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:439-448 [Journal]
  50. Edward Spence
    Is Taylor's graph geometric? [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:449-454 [Journal]
  51. Leo Storme, Joseph A. Thas
    Complete k-arcs in PG(n, q), q even. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:455-469 [Journal]
  52. Aimo Tietäväinen
    On the cardinality of sets of sequences with given maximum correlation. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:471-477 [Journal]
  53. Henk C. A. van Tilborg
    Fire codes revisited. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:479-482 [Journal]
  54. Ludo M. G. M. Tolhuizen, C. P. M. J. Baggen
    On the weight enumerator of product codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:483-488 [Journal]
  55. Vladimir D. Tonchev
    Some small non-embeddable designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:489-492 [Journal]
  56. Vladimir D. Tonchev, Scott A. Vanstone
    On Kirkman triple systems of order 33. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:493-496 [Journal]
  57. Jack K. Wolf
    Efficient circuits for multiplying in GF(2m) for certain values of m. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:497-502 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002