paper.html

1. O. Heden, Perfect codes in antipodal distance-transitive graphs,
Math.Scand 35(1974) 29-37.

2. O. Heden, A generalized Lloyd theorem and mixed perfect codes,
Math.Scand 37(1975) 13-26.

3. O. Heden, A new construction of group and nongroup perfect codes,
Information and control, 34(1977)314-323.

4. O. Heden, Existence and non-existence conditions for mixed perfect codes,
Preprint series, University of Stockholm Mathematical department, No. 2 1977.

5. O. Heden, Partitions of finite abelian groups,
Europ. J. Combinatorics 7(1986)11-25.

6. O. Heden, The Frobenius number and partitions of a finite vector space,
Arch. Math. 42(1984)185-192.

7. O. Heden, On partitions of finite vector spaces of small dimensions,
Arch. Math. 43(1984)507-509.

8. O. Heden, Embeddings of partial $T$-partitions of finite vector spaces,
Arch. Math. 44(1985)190-192.

9. O. Heden, Maximal partial spreads and two-weight codes,
Discrete Math. 62(1986)277-293.

10. O. Heden, A binary perfect code of length 15 and codimension 0,
Designs, Codes and Cryptography 4 (1994) 213-220.

11. O. Heden, No maximal partial spread of size 10 in $PG(3,5)$,
Ars Combin. 29(1990)297-298.

12. O. Heden, No partial 1-spread of class $\lbrack 0,\geq2\rbrack_d$ in $PG(2d-1,q)$ exists,
Discrete Math. 87(1991)215-216.

13. O. Heden, A greedy search for maximal partial spreads in $PG(3,7)$,
Ars Combin (1991)253-255.

14. O. Heden, Maximal partial spreads and the modular $n$-queen problem,
Discrete Math., 120(1993)75-91.

15. O. Heden, On the modular n-queen problem,
Discrete Math. 102(1992)155-161.

16. O. Heden, On Bruen chains,
Discrete Math. 146(1995)69-96.

17. O. Heden, Maximal partial spreads and the modular $n$-queen problem II,
Discrete Math. 142(1995)97-106.

18. O. Heden, Another Bruen chain,
Discrete Math. 188(1998)267.

19. O. Heden and M. Saggese, Bruen chains in $PG(3,p^k)$, $k\geq 2$,
Discrete Math. 214(2000)251-253.

20. O. Heden, Maximal partial spreads and the modular $n$-queen problem III,
Discrete Math., 243(2002)135-150.

21. O. Heden, Maximal partial spreads in $PG(3,5)$,
Ars Combin. 57(2000)97-101.

22. O. Heden, A construction of binary perfect 1-error correcting codes,
unpublished manuscript (1999).

23. O. Heden, A maximal partial spread of size 45 in $PG(3,7)$,
Des. Codes Cryptogr 22(2001)331-334.

24. O. Heden, No maximal partial spread of size 115 in $PG(3,11)$,
Ars Combin. 66(2003)139-155.

25. O. Heden, On the reconstruction of perfect codes,
Discrete Mathematics 256 (2002)479-485.

26. O. Heden, On tilings with different perfect codes,
submitted.

27. P. Goeverts, O. Heden, L. Storme, On the spectrum for the sizes of
maximal partial spreads in $PG(3,q)$, $q$ even,
manuscript in preparation.

28. O. Heden, S. Marcugini, F. Pambianco, L. Storme, On the non-existence of a maximal partial spread of size 76 in $PG(3,9)$,
Ars Combinatoria 89(2008)369-382.

29. O. Heden, On the classification of perfect binary 1-error correcting codes,
submitted.

30. O. Heden, On the symmetry group of perfect 1-error correcting binary codes,
JCMCC52(2005)109-115.

31. O. Heden, On the faces problem for perfect codes, Congressus Numernatium 162(2003)161-171.

32. O. Heden, G. Faina, S. Marcugini, F. Pambianco, The maximal size of a maximal partial spread in PG(3,9),
Quaderni di Matematica, 19(2009)77-112.

33. S.V. Avgustinovich, O. Heden, F.I. Solov'eva , The classification of some binary perfect codes,
Designs, Codes and Cryptography, 31(3)(2004)313-318.

34. S.V. Avgustinovich, O. Heden, F.I. Solov'eva , On ranks and kernels of perfect codes,
Stockholm: Royal Inst. of Technology, 2001. (Preprint / Trita-mat.-2001-13).

35. S.V. Avgustinovich, O. Heden, F.I. Solov'eva , Perfect codes of full rank with big kernels,
Discrete Analysis and Oper. Research, 1 (8) 4 (2001) 3--8 (in Russian).

36. S.V. Avgustinovich, O. Heden, F.I. Solov'eva , On perfect codes ranks and kernels problem,
Probl. of Inform. Transm. 39(4)(2003)30-34.

37. S.V. Avgustinovich, O. Heden, F.I. Solov'eva , On the Structure of Symmetry Groups of Vasil’ev Codes,
Problems of Information Transmission, 41(2 )(2005)105 - 112.

38. O Heden, Perfect codes from the dual point of view I, Discrete Math., 308(24) (2008) 6141-6156.

39. O. Heden, A remark on full rank perfect codes, Discrete Mathematics 306(2006)1975-1980.

40. O. Heden, A property of the transpose of a perfect code,
submitted to Discrete Mathematics.

41. O. Heden, A full rank perfect code of length 31, Designs, Codes and Cryptygraphy 38(2006)125-129.

42. O. Heden, Full rank perfect codes and alfa-kernels, Discrete Math., 309(8)(2009) 2202-2216.

43. S. V. Avgustinovich, O. Heden, F. I. Solov eva, On intersections of perfect binary codes,
Bayeuther Mathematishe Schriften 71(2005) 8-13.

44. S. V. Avgustinovich, O. Heden, F. I. Solov eva, On intersection problems for perfect binary codes,
Designs, Codes and Cryptography 39(2006) 317-322.

45. O. Heden, M. Hessler, On the classification of perfect codes: Side class structures,
Designs, Codes and Cryptography 40(2006) 319-333.

46. O. Heden, T. Westerbäck, Non Phelps codes of length 15 and rank 14,
Australasian Journal of Combinatorics 38(2007) 141-153.

47. O. Heden, Perfect codes of length n with kernels of dimension n-log(n+1)-3,
SIAM Journal on Discrete Mathematics, 22(2008)1338-1350.

48. O. Heden, On perfect p-ary codes of length p+1, Designs, Codes and Cryptography 46(2008) 45-56

49. S. V. Avgustinovich, O. Heden, F. I. Solov'eva, On partitions of n-cube into perfect codes,
Problems of Information Transmission, 49(4)(2007), 310-315.

50. O. Heden, The partial order of perfect codes associated to a perfect code,
Advances in Mathematics of Communications, 1(4)(2007) 399-412.

51. O. Heden, M. Hessler, T. Westerbäck, On the classification of perfect codes: Extended side class structures, Discrete Math., 310(2010) 43-55.

52. O. Heden, A survey of perfect codes, Advances in Mathematics of Communications, 2(2)(2008)223 - 247.

53. O. Heden, Fabio Pasticci, Thomas Westerbäck, On the existence of extended perfect binary codes with trivial symmetry group, Advances in Mathematics of Communications, 3(3)(2009)295-309.

54. O. Heden, On the length of the tail of a vector space partition, Discrete Math., 309 (21) (2009) 6169-6180.

55. O. Heden, Necessary and sufficient conditions for the existence of a class of partitions of a finite vector space, Designs, Codes and Cryptography, 53(2)(2009)69-73.

56. O. Heden, S. El-Zanati, G. Seelinger, P. Sissokho, L. Spence and C. Vanden Eynden, Partitions of the 8-dimensional vector space over GF(2), Journal of Combinatorial designs 18(2010)462–474.

57. O. Heden, M. Hessler, On linear equivalence and Phelps codes, Advances in Mathematics of Communications, 4(1)(2010)69-81.

58. O. Heden, F. Solov'eva, Partitions of F^n into non-parallel Hamming codes, Advances in Mathematics of Communications, 3(2009)385-397.

59. O. Heden, I. Yu. Mogilnykh, F. I. Solov'eva, Intersections of perfect binary codes, manuscript.

60. O. Heden, D. S. Krotov, On the structure of non-full-rank perfect q-ary codes, Advances in Mathematics of Communications, 5(2)(2011)149-156.

61. O. Heden, On Perfect codes over non prime power alphabets, Contemporary Mathematics, 523 (2010), 173-184.

62. O. Heden, On kernels of perfect codes, Discrete Mathematics, 310(2010)3052-3055.

63. O. Heden, P. A. Sissokho, On the existence of a (2,3)-spread in V(7,2), to appear in ARS Combinatoria.

64. O. Heden, C. Roos, The non existence of some perfect codes over non prime power alphabets, Discrete Mathematics, 311 (2011) 1344-1348.

65. O. Heden, On the size of the symmetry group of a perfect code, Discrete Mathematics 311(2011)1879-1885.

66. O. Heden, M. Hessler, On linear equivalence and Phelps codes. Addendum, Advances in Mathematics of Communications, 5(3)(2011)543-546.

67. J. Lehmann and O. Heden, Some necessary conditions for vector space partitions, Discrete Mathematics, 312 (2012) 351-361.

68. O. Heden, J. Lehmann, E. Nastase, and P. Sissokho, Extremal sizes of subspace partitions, Designs, Codes and Cryptography, 64(3) (2012), 265-274.

69. O Heden, F. Pasticci, T. Westerbäck, On the symmetry group of extended perfect binary codes of length n+1 and rank n-log(n+1)+2, Advances in Mathematics of Communications, 6(2) (2012), 121 - 130.

70. O. Heden, A survey of the different types of vector space partitions, Discrete Mathematics, Algorithms and Applications, Vol. 4, No. 1 (2012) 1250001, 1-14.

71. O. Heden, J. Lehmann, E. Nastase, and P. Sissokho, The supertail of a subspace partition, Designs, Codes and Cryptography, published on-line.

72. O. Heden, A note on the symmetry group of perfect codes, Discrete Mathematics, 312 (19) (2012) 2973–2977.