The SCEAS System
Navigation Menu

Journals in DBLP

Des. Codes Cryptography
2003, volume: 29, number: 1-3

  1. Aart Blokhuis, James W. P. Hirschfeld, Dieter Jungnickel, Joseph A. Thas
    Finite Geometries. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:29, n:1-3, pp:5- [Journal]
  2. Angela Aguglia, Antonio Cossidente, Gary L. Ebert
    Complete Spans on Hermitian Varieties. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:29, n:1-3, pp:7-15 [Journal]
  3. Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian
    Forbidden (0, 1)-Vectors in Hyperplanes of Rn: The Restricted Case. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:29, n:1-3, pp:17-28 [Journal]
  4. Rudolf Ahlswede, Levon H. Khachatrian
    Cone Dependence - A Basic Combinatorial Concept. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:29, n:1-3, pp:29-40 [Journal]
  5. Laura Bader, Nicola Durante, Maska Law, Guglielmo Lunardon, Tim Penttila
    Symmetries of BLT-Sets. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:29, n:1-3, pp:41-50 [Journal]
  6. Thomas Beth, Chris Charnes, Markus Grassl, Gernot Alber, Aldo Delgado, Michael Mussinger
    A New Class of Designs Which Protect against Quantum Jumps. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:29, n:1-3, pp:51-70 [Journal]
  7. Jürgen Bierbrauer, Stefano Marcugini, Fernanda Pambianco
    Projective Planes, Coverings and a Network Problem. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:29, n:1-3, pp:71-89 [Journal]
  8. Aart Blokhuis, Tamás Szonyi, Zsuzsa Weiner
    On Sets without Tangents in Galois Planes of Even Order. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:29, n:1-3, pp:91-98 [Journal]
  9. Yves Edel, Jürgen Bierbrauer
    The Largest Cap in AG(4, 4) and Its Uniqueness. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:29, n:1-3, pp:99-104 [Journal]
  10. Sandy Ferret, Leo Storme
    Results on Maximal Partial Spreads in PG(3, p3) and on Related Minihypers. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:29, n:1-3, pp:105-122 [Journal]
  11. András Gács, Tamás Szonyi
    On Maximal Partial Spreads in PG(n, q). [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:29, n:1-3, pp:123-129 [Journal]
  12. András Gács, Zsuzsa Weiner
    On (q + t, t)-Arcs of Type (0, 2, t). [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:29, n:1-3, pp:131-139 [Journal]
  13. Patrick Govaerts, Dieter Jungnickel, Leo Storme, Joseph A. Thas
    Some New Maximal Sets of Mutually Orthogonal Latin Squares. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:29, n:1-3, pp:141-147 [Journal]
  14. Gohar M. M. Kyureghyan, Alexander Pott
    On the Linear Complexity of the Sidelnikov-Lempel-Cohn-Eastman Sequences. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:29, n:1-3, pp:149-164 [Journal]
  15. Ivan N. Landjev, Assya Rousseva, Tatsuya Maruta, Ray Hill
    On Optimal Codes Over the Field with Five Elements. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:29, n:1-3, pp:165-175 [Journal]
  16. Dimitri Leemans
    The Residually Weakly Primitive Geometries of M22. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:29, n:1-3, pp:177-178 [Journal]
  17. Deirdre Luyckx, Joseph A. Thas
    On 1-Systems of Q(6, q), q Even. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:29, n:1-3, pp:179-197 [Journal]
  18. Hendrik Van Maldeghem
    Some Remarks on Steiner Systems. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:29, n:1-3, pp:199-213 [Journal]
  19. Klaus Metsch
    On the Characterization of the Folded Halved Cubes by Their Intersection Arrays. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:29, n:1-3, pp:215-225 [Journal]
  20. Koen Thas
    Symmetry in Generalized Quadrangles. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:29, n:1-3, pp:227-245 [Journal]
  21. Vladimir D. Tonchev
    A Note on MDS Codes, n-Arcs and Complete Designs. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:29, n:1-3, pp:247-250 [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