default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOlof Heden
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j52]Olof Heden, Papa Amar Sissokho:
On the existence of a (2, 3)-spread in V(7, 2). Ars Comb. 124: 161-164 (2016)- 2015
- [j51]Olof Heden:
Linear maps of perfect codes and irregular C-partitions. Discret. Math. 338(3): 149-163 (2015) - 2014
- [j50]Olof Heden, Juliane Lehmann, Esmeralda Nastase, Papa A. Sissokho
:
On the type(s) of minimum size subspace partitions. Discret. Math. 332: 1-9 (2014) - 2013
- [j49]Olof Heden, Juliane Lehmann, Esmeralda Nastase, Papa A. Sissokho:
The supertail of a subspace partition. Des. Codes Cryptogr. 69(3): 305-316 (2013) - 2012
- [j48]Olof Heden, Fabio Pasticci, Thomas Westerbäck:
On the symmetry group of extended perfect binary codes of length n+1 and rank n-log(n+1)+2. Adv. Math. Commun. 6(2): 121-130 (2012) - [j47]Olof Heden, Juliane Lehmann, Esmeralda Nastase, Papa A. Sissokho:
Extremal sizes of subspace partitions. Des. Codes Cryptogr. 64(3): 265-274 (2012) - [j46]Juliane Lehmann, Olof Heden:
Some necessary conditions for vector space partitions. Discret. Math. 312(2): 351-361 (2012) - [j45]Olof Heden:
A note on the symmetry group of full rank perfect binary codes. Discret. Math. 312(19): 2973-2977 (2012) - [j44]Olof Heden:
A Survey of the Different Types of Vector Space Partitions. Discret. Math. Algorithms Appl. 4(1) (2012) - 2011
- [j43]Olof Heden, Denis S. Krotov:
On the structure of non-full-rank perfect q-ary codes. Adv. Math. Commun. 5(2): 149-156 (2011) - [j42]Olof Heden, Martin Hessler:
On linear equivalence and Phelps codes. Addendum. Adv. Math. Commun. 5(3): 543-546 (2011) - [j41]Olof Heden, Cornelis Roos:
The non-existence of some perfect codes over non-prime power alphabets. Discret. Math. 311(14): 1344-1348 (2011) - [j40]Olof Heden:
On the size of the symmetry group of a perfect code. Discret. Math. 311(17): 1879-1885 (2011) - [i2]Olof Heden, Papa Amar Sissokho:
On the existence of a (2,3)-spread in V(7,2). CoRR abs/1101.5336 (2011) - 2010
- [j39]Olof Heden, Martin Hessler:
On linear equivalence and Phelps codes. Adv. Math. Commun. 4(1): 69-81 (2010) - [j38]Olof Heden, Martin Hessler, Thomas Westerbäck:
On the classification of perfect codes: Extended side class structures. Discret. Math. 310(1): 43-55 (2010) - [j37]Olof Heden:
On kernels of perfect codes. Discret. Math. 310(21): 3052-3055 (2010) - [i1]Denis S. Krotov, Olof Heden:
On the structure of non-full-rank perfect codes. CoRR abs/1001.0001 (2010)
2000 – 2009
- 2009
- [j36]Olof Heden, Fabio Pasticci, Thomas Westerbäck:
On the existence of extended perfect binary codes with trivial symmetry group. Adv. Math. Commun. 3(3): 295-309 (2009) - [j35]Olof Heden, Faina I. Solov'eva:
Partitions of Fn into non-parallel Hamming codes. Adv. Math. Commun. 3(4): 385-397 (2009) - [j34]Olof Heden:
Necessary and sufficient conditions for the existence of a class of partitions of a finite vector space. Des. Codes Cryptogr. 53(2): 69-73 (2009) - [j33]Olof Heden:
Full rank perfect codes and alpha-kernels. Discret. Math. 309(8): 2202-2216 (2009) - [j32]Olof Heden:
On the length of the tail of a vector space partition. Discret. Math. 309(21): 6169-6180 (2009) - 2008
- [j31]Olof Heden:
A survey of perfect codes. Adv. Math. Commun. 2(2): 223-247 (2008) - [j30]Olof Heden, Stefano Marcugini, Fernanda Pambianco, Leo Storme:
On the non-existence of a maximal partial spread of size 76 in PG(3, 9). Ars Comb. 89 (2008) - [j29]Olof Heden:
On perfect p-ary codes of length p+1. Des. Codes Cryptogr. 46(1): 45-56 (2008) - [j28]Olof Heden:
Perfect codes from the dual point of view I. Discret. Math. 308(24): 6141-6156 (2008) - [j27]Olof Heden:
Perfect Codes of Length n with Kernels of Dimension n-log(n+1)-3. SIAM J. Discret. Math. 22(4): 1338-1350 (2008) - 2007
- [j26]Olof Heden, Thomas Westerbäck:
Non Phelps codes of length 15 and rank 14. Australas. J Comb. 38: 141-154 (2007) - [j25]Olof Heden:
The partial order of perfect codes associated to a perfect code. Adv. Math. Commun. 1(4): 399-412 (2007) - [j24]Sergey V. Avgustinovich, Faina I. Solov'eva, Olof Heden:
On partitions of an n-cube into nonequivalent perfect codes. Probl. Inf. Transm. 43(4): 310-315 (2007) - 2006
- [j23]Olof Heden:
A Full Rank Perfect Code of Length 31. Des. Codes Cryptogr. 38(1): 125-129 (2006) - [j22]Sergey V. Avgustinovich, Olof Heden, Faina I. Solov'eva:
On Intersection Problem for Perfect Binary Codes. Des. Codes Cryptogr. 39(3): 317-322 (2006) - [j21]Olof Heden, Martin Hessler:
On the classification of perfect codes: side class structures. Des. Codes Cryptogr. 40(3): 319-333 (2006) - [j20]Olof Heden:
A remark on full rank perfect codes. Discret. Math. 306(16): 1975-1980 (2006) - 2005
- [j19]Sergey V. Avgustinovich, Faina I. Solov'eva, Olof Heden:
On the Structure of Symmetry Groups of Vasil'ev Codes. Probl. Inf. Transm. 41(2): 105-112 (2005) - 2004
- [j18]Sergey V. Avgustinovich, Olof Heden, Faina I. Solov'eva:
The Classification of Some Perfect Codes. Des. Codes Cryptogr. 31(3): 313-318 (2004) - 2003
- [j17]Olof Heden:
No maximal partial spread of size 115 in PG(3, 11). Ars Comb. 66 (2003) - [j16]Sergey V. Avgustinovich, Faina I. Solov'eva, Olof Heden:
On the Ranks and Kernels Problem for Perfect Codes. Probl. Inf. Transm. 39(4): 341-345 (2003) - 2002
- [j15]Olof Heden:
Maximal partial spreads and the modular n-queen problem III. Discret. Math. 243(1-3): 135-150 (2002) - [j14]Olof Heden:
On the reconstruction of perfect codes. Discret. Math. 256(1-2): 479-485 (2002) - 2001
- [j13]Olof Heden:
A Maximal Partial Spread of Size 45 in PG(3, 7). Des. Codes Cryptogr. 22(3): 331-334 (2001) - 2000
- [j12]Olof Heden:
Maximal partial spreads in PG(3, 5). Ars Comb. 57 (2000) - [j11]Olof Heden, Maria Saggese:
Bruen chains in PG(3, pk), k geq 2. Discret. Math. 214(1-3): 251-253 (2000)
1990 – 1999
- 1998
- [j10]Olof Heden:
Another Bruen chain. Discret. Math. 188(1-3): 267 (1998) - 1995
- [j9]Olof Heden:
Maximal partial spreads and the modular n-queen problem II. Discret. Math. 142(1-3): 97-106 (1995) - [j8]Olof Heden:
On Bruen chains. Discret. Math. 146(1-3): 69-96 (1995) - 1994
- [j7]Olof Heden:
A Binary Perfect Code of Length 15 and Codimension 0. Des. Codes Cryptogr. 4(3): 213-220 (1994) - 1993
- [j6]Olof Heden:
Maximal partial spreads and the modular n-queen problem. Discret. Math. 120(1-3): 75-91 (1993) - 1992
- [j5]Olof Heden:
On the modular n-queen problem. Discret. Math. 102(2): 155-161 (1992) - 1991
- [j4]Olof Heden:
No partial 1-spread of class [0, >=2]d in PG(2d-1, q) exists. Discret. Math. 87(2): 215-216 (1991)
1980 – 1989
- 1986
- [j3]Olof Heden:
Maximal partial spreads and two-weight codes. Discret. Math. 62(3): 277-293 (1986) - [j2]Olof Heden:
Partitions of Finite Abelian Groups. Eur. J. Comb. 7(1): 11-25 (1986)
1970 – 1979
- 1977
- [j1]Olof Heden:
A New Construction of Group and Nongroup Perfect Codes. Inf. Control. 34(4): 314-323 (1977)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
