The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Olof Heden: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Olof Heden
    Maximal partial spreads in PG(3, 5). [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2000, v:57, n:, pp:- [Journal]
  2. Olof Heden
    No maximal partial spread of size 115 in PG(3, 11). [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2003, v:66, n:, pp:- [Journal]
  3. Sergey V. Avgustinovich, Olof Heden, Faina I. Solov'eva
    The Classification of Some Perfect Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2004, v:31, n:3, pp:313-318 [Journal]
  4. Olof Heden
    A Maximal Partial Spread of Size 45 in PG(3, 7). [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2001, v:22, n:3, pp:331-334 [Journal]
  5. Olof Heden
    A Full Rank Perfect Code of Length 31. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2006, v:38, n:1, pp:125-129 [Journal]
  6. Olof Heden
    A Binary Perfect Code of Length 15 and Codimension 0. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1994, v:4, n:3, pp:213-220 [Journal]
  7. Olof Heden, Martin Hessler
    On the classification of perfect codes: side class structures. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2006, v:40, n:3, pp:319-333 [Journal]
  8. Olof Heden
    On the reconstruction of perfect codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:479-485 [Journal]
  9. Olof Heden
    Maximal partial spreads and the modular n-queen problem III. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:243, n:1-3, pp:135-150 [Journal]
  10. Olof Heden, Maria Saggese
    Bruen chains in PG(3, pk), k geq 2. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:214, n:1-3, pp:251-253 [Journal]
  11. Olof Heden
    A remark on full rank perfect codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:16, pp:1975-1980 [Journal]
  12. Olof Heden
    A New Construction of Group and Nongroup Perfect Codes [Citation Graph (0, 0)][DBLP]
    Information and Control, 1977, v:34, n:4, pp:314-323 [Journal]
  13. Olof Heden
    Maximal partial spreads and two-weight codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:62, n:3, pp:277-293 [Journal]
  14. Olof Heden
    Another Bruen chain. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:267- [Journal]
  15. Olof Heden
    No partial 1-spread of class [0, >=2]d in PG(2d-1, q) exists. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:87, n:2, pp:215-216 [Journal]
  16. Olof Heden
    On the modular n-queen problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:102, n:2, pp:155-161 [Journal]
  17. Olof Heden
    Maximal partial spreads and the modular n-queen problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:75-91 [Journal]
  18. Olof Heden
    Maximal partial spreads and the modular n-queen problem II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:142, n:1-3, pp:97-106 [Journal]
  19. Olof Heden
    On Bruen chains. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:146, n:1-3, pp:69-96 [Journal]

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


  21. On the structure of non-full-rank perfect codes [Citation Graph (, )][DBLP]


  22. On perfect p-ary codes of length p+1. [Citation Graph (, )][DBLP]


  23. Necessary and sufficient conditions for the existence of a class of partitions of a finite vector space. [Citation Graph (, )][DBLP]


  24. Perfect codes from the dual point of view I. [Citation Graph (, )][DBLP]


  25. On the length of the tail of a vector space partition. [Citation Graph (, )][DBLP]


  26. Full rank perfect codes and alpha-kernels. [Citation Graph (, )][DBLP]


  27. On the classification of perfect codes: Extended side class structures. [Citation Graph (, )][DBLP]


  28. On kernels of perfect codes. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
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