A New Construction of Group and Nongroup Perfect Codes - Olof Heden (Inf. Control., 1977)

Maximal partial spreads and two-weight codes. - Olof Heden (Discret. Math., 1986)

Partitions of Finite Abelian Groups. - Olof Heden (Eur. J. Comb., 1986)

No partial 1-spread of class [0, >=2]d in PG(2d-1, q) exists. - Olof Heden (Discret. Math., 1991)

On the modular n-queen problem. - Olof Heden (Discret. Math., 1992)

Maximal partial spreads and the modular n-queen problem. - Olof Heden (Discret. Math., 1993)

A Binary Perfect Code of Length 15 and Codimension 0. - Olof Heden (Des. Codes Cryptogr., 1994)

Maximal partial spreads and the modular n-queen problem II. - Olof Heden (Discret. Math., 1995)

On Bruen chains. - Olof Heden (Discret. Math., 1995)

Another Bruen chain. - Olof Heden (Discret. Math., 1998)

Maximal partial spreads in PG(3, 5). - Olof Heden (Ars Comb., 2000)

Bruen chains in PG(3, pk), k geq 2. - Olof Heden; Maria Saggese (Discret. Math., 2000)

A Maximal Partial Spread of Size 45 in PG(3, 7). - Olof Heden (Des. Codes Cryptogr., 2001)

On the reconstruction of perfect codes. - Olof Heden (Discret. Math., 2002)

Maximal partial spreads and the modular n-queen problem III. - Olof Heden (Discret. Math., 2002)

No maximal partial spread of size 115 in PG(3, 11). - Olof Heden (Ars Comb., 2003)

On the Ranks and Kernels Problem for Perfect Codes. - Sergey V. Avgustinovich; Faina I. Solov'eva; Olof Heden (Probl. Inf. Transm., 2003)

The Classification of Some Perfect Codes. - Sergey V. Avgustinovich; Olof Heden; Faina I. Solov'eva (Des. Codes Cryptogr., 2004)

On the Structure of Symmetry Groups of Vasil'ev Codes. - Sergey V. Avgustinovich; Faina I. Solov'eva; Olof Heden (Probl. Inf. Transm., 2005)

On Intersection Problem for Perfect Binary Codes. - Sergey V. Avgustinovich; Olof Heden; Faina I. Solov'eva (Des. Codes Cryptogr., 2006)

A Full Rank Perfect Code of Length 31. - Olof Heden (Des. Codes Cryptogr., 2006)

On the classification of perfect codes: side class structures. - Olof Heden; Martin Hessler (Des. Codes Cryptogr., 2006)

A remark on full rank perfect codes. - Olof Heden (Discret. Math., 2006)

Non Phelps codes of length 15 and rank 14. - Olof Heden; Thomas Westerbäck (Australas. J Comb., 2007)

The partial order of perfect codes associated to a perfect code. - Olof Heden (Adv. Math. Commun., 2007)

On partitions of an n-cube into nonequivalent perfect codes. - Sergey V. Avgustinovich; Faina I. Solov'eva; Olof Heden (Probl. Inf. Transm., 2007)

A survey of perfect codes. - Olof Heden (Adv. Math. Commun., 2008)

On the non-existence of a maximal partial spread of size 76 in PG(3, 9). - Olof Heden; Stefano Marcugini; Fernanda Pambianco; Leo Storme (Ars Comb., 2008)

On perfect p-ary codes of length p+1. - Olof Heden (Des. Codes Cryptogr., 2008)

Perfect codes from the dual point of view I. - Olof Heden (Discret. Math., 2008)

Perfect Codes of Length n with Kernels of Dimension n-log(n+1)-3. - Olof Heden (SIAM J. Discret. Math., 2008)

On the existence of extended perfect binary codes with trivial symmetry group. - Olof Heden; Fabio Pasticci; Thomas Westerbäck (Adv. Math. Commun., 2009)

Partitions of Fn into non-parallel Hamming codes. - Olof Heden; Faina I. Solov'eva (Adv. Math. Commun., 2009)

Necessary and sufficient conditions for the existence of a class of partitions of a finite vector space. - Olof Heden (Des. Codes Cryptogr., 2009)

Full rank perfect codes and alpha-kernels. - Olof Heden (Discret. Math., 2009)

On the length of the tail of a vector space partition. - Olof Heden (Discret. Math., 2009)

On linear equivalence and Phelps codes. - Olof Heden; Martin Hessler (Adv. Math. Commun., 2010)

On the structure of non-full-rank perfect codes - Denis S. Krotov; Olof Heden (CoRR, 2010)

On kernels of perfect codes. - Olof Heden (Discret. Math., 2010)

On the classification of perfect codes: Extended side class structures. - Olof Heden; Martin Hessler; Thomas Westerbäck (Discret. Math., 2010)

On linear equivalence and Phelps codes. Addendum. - Olof Heden; Martin Hessler (Adv. Math. Commun., 2011)

On the structure of non-full-rank perfect q-ary codes. - Olof Heden; Denis S. Krotov (Adv. Math. Commun., 2011)

On the existence of a (2,3)-spread in V(7,2) - Olof Heden; Papa Amar Sissokho (CoRR, 2011)

On the size of the symmetry group of a perfect code. - Olof Heden (Discret. Math., 2011)

The non-existence of some perfect codes over non-prime power alphabets. - Olof Heden; Cornelis Roos (Discret. Math., 2011)

On the symmetry group of extended perfect binary codes of length n+1 and rank n-log(n+1)+2. - Olof Heden; Fabio Pasticci; Thomas Westerbäck (Adv. Math. Commun., 2012)

Extremal sizes of subspace partitions. - Olof Heden; Juliane Lehmann; Esmeralda Nastase; Papa A. Sissokho (Des. Codes Cryptogr., 2012)

A note on the symmetry group of full rank perfect binary codes. - Olof Heden (Discret. Math., 2012)

Some necessary conditions for vector space partitions. - Juliane Lehmann; Olof Heden (Discret. Math., 2012)

A Survey of the Different Types of Vector Space Partitions. - Olof Heden (Discret. Math. Algorithms Appl., 2012)

The supertail of a subspace partition. - Olof Heden; Juliane Lehmann; Esmeralda Nastase; Papa A. Sissokho (Des. Codes Cryptogr., 2013)

On the type(s) of minimum size subspace partitions. - Olof Heden; Juliane Lehmann; Esmeralda Nastase; Papa A. Sissokho (Discret. Math., 2014)

Linear maps of perfect codes and irregular C-partitions. - Olof Heden (Discret. Math., 2015)

On the existence of a (2, 3)-spread in V(7, 2). - Olof Heden; Papa Amar Sissokho (Ars Comb., 2016)