The SCEAS System
Navigation Menu

Journals in DBLP

Des. Codes Cryptography
2005, volume: 35, number: 3

  1. Petr Lisonek, Mahdad Khatirinejad
    A Family of Complete Caps in PG(n, 2). [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2005, v:35, n:3, pp:259-270 [Journal]
  2. Harri Haanpää, Petteri Kaski
    The Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player Whist Tournaments. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2005, v:35, n:3, pp:271-285 [Journal]
  3. Gennian Ge, Clement W. H. Lam, Alan C. H. Ling, Hao Shen
    Resolvable Maximum Packings with Quadruples. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2005, v:35, n:3, pp:287-302 [Journal]
  4. Yury J. Ionin, Hadi Kharaghani
    A Recursive Construction for New Symmetric Designs. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2005, v:35, n:3, pp:303-310 [Journal]
  5. Stelvio Cimato, Roberto De Prisco, Alfredo De Santis
    Optimal Colored Threshold Visual Cryptography Schemes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2005, v:35, n:3, pp:311-335 [Journal]
  6. Deirdre Luyckx, Joseph A. Thas
    Trialities and 1-Systems of Q+(7, q). [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2005, v:35, n:3, pp:337-352 [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