The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Leo Storme: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sandy Ferret, Leo Storme
    A classification result on weighted {deltavµ+1, deltavµ;N, p3}-minihypers. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:2, pp:277-293 [Journal]
  2. Keisuke Shiromoto, Leo Storme
    A Griesmer Bound for Linear Codes Over Finite Quasi-Frobenius Rings. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:128, n:1, pp:263-274 [Journal]
  3. János Barát, Leo Storme
    Multiple Blocking Sets in PG(n, q), n>3. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2004, v:33, n:1, pp:5-21 [Journal]
  4. Simeon Ball, Patrick Govaerts, Leo Storme
    On Ovoids of Parabolic Quadrics. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2006, v:38, n:1, pp:131-145 [Journal]
  5. János Barát, Alberto Del Fra, Stefano Innamorati, Leo Storme
    Minimal Blocking Sets in PG(2, 8) and Maximal Partial Spreads in PG(3, 8). [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2004, v:31, n:1, pp:15-26 [Journal]
  6. Jörg Eisfeld, Leo Storme, Péter Sziklai
    On the Spectrum of the Sizes of Maximal Partial Line Spreads in PG(2n, q), n >= 3. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2005, v:36, n:1, pp:101-110 [Journal]
  7. Sandy Ferret, Leo Storme
    Minihypers and Linear Codes Meeting the Griesmer Bound: Improvements to Results of Hamada, Helleseth and Maekawa. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2002, v:25, n:2, pp:143-162 [Journal]
  8. 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]
  9. 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]
  10. Patrick Govaerts, Leo Storme
    On a Particular Class of Minihypers and Its Applications. I. The Result for General varrho. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2003, v:28, n:1, pp:51-63 [Journal]
  11. Klaus Metsch, Leo Storme
    Partial-Spreads in. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1999, v:18, n:1/3, pp:199-216 [Journal]
  12. Leo Storme
    Normal Rational Curves over Prime Fields. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1997, v:12, n:1, pp:89-96 [Journal]
  13. Leo Storme, Zsuzsa Weiner
    On 1-Blocking Sets in PG(n, q), n >= 3. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2000, v:21, n:1/3, pp:235-251 [Journal]
  14. Jon-Lark Kim, Keith E. Mellinger, Leo Storme
    Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2007, v:42, n:1, pp:73-92 [Journal]
  15. Jan De Beule, Leo Storme
    On the smallest minimal blocking sets of Q(2n, q), for q an odd prime. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:294, n:1-2, pp:83-107 [Journal]
  16. Jörg Eisfeld, Leo Storme, Tamás Szonyi, Péter Sziklai
    Covers and blocking sets of classical generalized quadrangles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:238, n:1-3, pp:35-51 [Journal]
  17. Dieter Jungnickel, Leo Storme
    Maximal partial spreads in PG(3, 4) and maximal sets of mutually orthogonal latin squares of order 16. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:261, n:1-3, pp:361-371 [Journal]
  18. Klaus Metsch, Leo Storme
    Partial linear complexes of PG(3, q). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:255, n:1-3, pp:287-296 [Journal]
  19. Matthew R. Brown, Jan De Beule, Leo Storme
    Maximal partial spreads of T2(O) and T3. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2003, v:24, n:1, pp:73-84 [Journal]
  20. Patrick Govaerts, Leo Storme, Hendrik Van Maldeghem
    On a Particular Class of Minihypers and its Applications. III. Applications. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2002, v:23, n:6, pp:659-672 [Journal]
  21. Olga Polverino, Leo Storme
    Small Minimal Blocking Sets in PG(2, q3). [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2002, v:23, n:1, pp:83-92 [Journal]
  22. Leo Storme
    Transitive Arcs in Planes of Even Order. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1996, v:17, n:8, pp:757-768 [Journal]
  23. Aart Blokhuis, Simeon Ball, Andries E. Brouwer, Leo Storme, Tamás Szonyi
    On the Number of Slopes of the Graph of a Function Defined on a Finite Field. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1999, v:86, n:1, pp:187-196 [Journal]
  24. Yves Edel, Sandy Ferret, Ivan N. Landjev, Leo Storme
    The Classification of the Largest Caps in AG(5, 3). [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2002, v:99, n:1, pp:95-110 [Journal]
  25. Jörg Eisfeld, Leo Storme, Péter Sziklai
    Minimal Covers of the Klein Quadric. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:95, n:1, pp:145-157 [Journal]
  26. Patrick Govaerts, Leo Storme
    On a Particular Class of Minihypers and Its Applications: II. Improvements for q Square. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2002, v:97, n:2, pp:369-393 [Journal]
  27. Dieter Jungnickel, Leo Storme
    A note on maximal partial spreads with deficiency q+1, q even . [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2003, v:102, n:2, pp:443-446 [Journal]
  28. Tim Penttila, Leo Storme
    Monomial Flocks and Herds Containing a Monomial Oval. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1998, v:83, n:1, pp:21-41 [Journal]
  29. Fernanda Pambianco, Leo Storme
    Small Complete Caps in Spaces of Even Characteristic. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1996, v:75, n:1, pp:70-84 [Journal]
  30. Leo Storme
    On the Largest Caps Contained in the Klein Quadric of PG(5, q), q Odd. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1999, v:87, n:2, pp:357-378 [Journal]
  31. Leo Storme, Hendrik Van Maldeghem
    Primitive Arcs in PG(2, q). [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1995, v:69, n:2, pp:200-216 [Journal]
  32. Leo Storme, Joseph A. Thas
    M. D. S. Codes and Arcs in PG(n, q) with q Even: An Improvement of the Bounds of Bruen, Thas, and Blokhuis. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1993, v:62, n:1, pp:139-154 [Journal]
  33. Patrick Govaerts, Leo Storme
    The classification of the smallest nontrivial blocking sets in PG(n, 2). [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2006, v:113, n:7, pp:1543-1548 [Journal]
  34. Leo Storme, Alexis De Vos, Gerald Jacobs
    Group Theoretical Aspects of Reversible Logic Gates. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1999, v:5, n:5, pp:307-321 [Journal]
  35. Lynn Margaret Batten, Michelle Davidson, Leo Storme
    An analysis of Chen's construction of minimum-distance five codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:2, pp:505-511 [Journal]
  36. Francesco Mazzocca, Olga Polverino, Leo Storme
    Blocking Sets in PG(r, qn). [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2007, v:44, n:1-3, pp:97-113 [Journal]
  37. Jan De Beule, Klaus Metsch, Leo Storme
    Characterization results on small blocking sets of the polar spaces Q +(2 n + 1, 2) and Q +(2 n + 1, 3). [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2007, v:44, n:1-3, pp:197-207 [Journal]
  38. Ivan N. Landjev, Leo Storme
    A weighted version of a result of Hamada on minihypers and on linear codes meeting the Griesmer bound. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2007, v:45, n:1, pp:123-138 [Journal]
  39. Antonio Cossidente, Leo Storme
    Cyclic and elementary Abelian caps in projective spaces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:208, n:, pp:139-156 [Journal]
  40. 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]
  41. Leo Storme, Joseph A. Thas
    k-Arcs and dual k-arcs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:357-370 [Journal]

  42. On the non-existence of a maximal partial spread of size 76 in PG(3, 9). [Citation Graph (, )][DBLP]


  43. Minimal blocking sets in PG(2, 9). [Citation Graph (, )][DBLP]


  44. On the small weight codewords of the functional codes C_2(Q), Q a non-singular quadric [Citation Graph (, )][DBLP]


  45. Partial ovoids and partial spreads in hermitian polar spaces. [Citation Graph (, )][DBLP]


  46. On the code generated by the incidence matrix of points and hyperplanes in PG(n, q) and its dual. [Citation Graph (, )][DBLP]


  47. Small weight codewords in the codes arising from Desarguesian projective planes. [Citation Graph (, )][DBLP]


  48. Characterization results on arbitrary non-weighted minihypers and on linear codes meeting the Griesmer bound. [Citation Graph (, )][DBLP]


  49. Tight sets, weighted m -covers, weighted m -ovoids, and minihypers. [Citation Graph (, )][DBLP]


  50. A study of (x(q + 1), x; 2, q)-minihypers. [Citation Graph (, )][DBLP]


  51. Minimal codewords in Reed-Muller codes. [Citation Graph (, )][DBLP]


  52. Weighted {delta(q+1), delta;k-1, q}-minihypers. [Citation Graph (, )][DBLP]


  53. On codewords in the dual code of classical generalised quadrangles and classical polar spaces. [Citation Graph (, )][DBLP]


  54. On the smallest maximal partial ovoids and spreads of the generalized quadrangles W(q) and Q(4, q). [Citation Graph (, )][DBLP]


  55. Partial ovoids and partial spreads in symplectic and orthogonal polar spaces. [Citation Graph (, )][DBLP]


  56. A spectrum result on maximal partial ovoids of the generalized quadrangle Q(4, q), q even. [Citation Graph (, )][DBLP]


  57. Partial covers of PG(n, q). [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.010secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002