• Publications
  • Influence
A Survey of the Different Types of Vector Space Partitions
  • Olof Heden
  • Computer Science, Mathematics
  • Discret. Math. Algorithms Appl.
  • 5 March 2011
TLDR
This talk contains a survey of known results on the type of a vector space partition, the theorem of Beutelspacher and Heden on $\mathrm{T}$-partitions, rather recent results of El-Zanati et al. on the different types that appear in the spaces. Expand
A Maximal Partial Spread of Size 45 in PG(3,7)
  • Olof Heden
  • Computer Science, Mathematics
  • Des. Codes Cryptogr.
  • 1 April 2001
TLDR
This example shows that a conjecture of Bruen and Thasfrom 1976 is false and an upper bound for thenumber of lines of a maximal partial spread, given by Blockhuisin 1994, cannot be improved in general. Expand
Maximal partial spreads and the modular n-queen problem
On the reconstruction of perfect codes
  • Olof Heden
  • Computer Science, Mathematics
  • Discret. Math.
  • 28 September 2002
We show how to reconstruct a perfect 1-error correcting binary code of length n from the code words of weight (n+ 1)/2.
A survey of perfect codes
  • Olof Heden
  • Computer Science, Mathematics
  • Adv. Math. Commun.
  • 1 April 2008
TLDR
This survey paper is devoted to the rather many recent results, that have appeared during the last ten years, on perfect 1-error correcting binary codes. Expand
On the length of the tail of a vector space partition
  • Olof Heden
  • Computer Science, Mathematics
  • Discret. Math.
  • 1 November 2009
TLDR
Lower bounds on the length of the tail of P are shown to be tight and the elements in the subspaces in tails of minimal length will constitute a subspace of V of dimension 2d"1 respectively d"2. Expand
A New Construction of Group and Nongroup Perfect Codes
  • Olof Heden
  • Computer Science, Mathematics
  • Inf. Control.
  • 1 August 1977
TLDR
From two perfect 1-codes C and C in cartesian products S, it is shown how the codes C might be chosen so that the code C will be equivalent respective not equivalent to a subgroup of S. Expand
Maximal partial spreads and the modular n-queen problem II
We prove that if q + 1 E 8 or 16 (mod 24) then, for any integer n in the interval (q2 + 1)/2 + 3 < n < (Sq’ + 4q + 7)/8, there is a maximal partial spread of size n in PG(3, q).
Maximal partial spreads and the modular n-queen problem III
  • Olof Heden
  • Computer Science, Mathematics
  • Discret. Math.
  • 15 July 1995
Maximal partial spreads in PG(3, q) q = p(k), p odd prime and q greater than or equal to 7, are constructed for any integer n in the interval (q(2) + 1)/2 + 6 less than or equal to n less than or eExpand
On the Ranks and Kernels Problem for Perfect Codes
A construction is proposed which, for n large enough, allows one to build perfect binary codes of length n and rank r, with kernel of dimension k, for any admissible pair (r, k) within the limits ofExpand
...
1
2
3
4
5
...