#### Filter Results:

- Full text PDF available (18)

#### Publication Year

2006

2017

- This year (1)
- Last 5 years (5)
- Last 10 years (24)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- P. Ostergard, O. Pottonen
- IEEE Transactions on Information Theory
- 2009

A complete classification of the perfect binary one-error-correcting codes of length 15 as well as their extensions of length 16 is presented. There are 5983 such inequivalent perfect codes and 2165 extended perfect codes. Efficient generation of these codes relies on the recent classification of Steiner quadruple systems of order 16. Utilizing a result of… (More)

- Patric R. J. Östergård, Olli Pottonen, Kevin T. Phelps
- IEEE Trans. Information Theory
- 2010

A complete classification of the perfect binary oneerror-correcting codes of length 15 as well as their extensions of length 16 was recently carried out in [P. R. J. Östergård and O. Pottonen, “The perfect binary one-error-correcting codes of length 15: Part I—Classification,” submitted for publication]. In the current accompanying work, the classified… (More)

- Patric R. J. Östergård, Olli Pottonen
- IEEE Trans. Information Theory
- 2009

A complete classification of the perfect binary one-error-correcting codes of length 15 as well as their extensions of length 16 is presented. There are 5 983 such inequivalent perfect codes and 2 165 extended perfect codes. Efficient generation of these codes relies on the recent classification of Steiner quadruple systems of order 16. Utilizing a result… (More)

- Patric R. J. Östergård, Olli Pottonen
- Des. Codes Cryptography
- 2011

The doubly shortened perfect codes of length 13 are classified utilizing the classification of perfect codes in [P.R.J. Österg̊ard and O. Pottonen, The perfect binary one-error-correcting codes of length 15: Part I— Classification, IEEE Trans. Inform. Theory, to appear]; there are 117821 such (13,512,3) codes. By applying a switching operation to those… (More)

The metric dimension of a graph G is the size of a smallest subset L ⊆ V (G) such that for any x, y ∈ V (G) there is a z ∈ L such that the graph distance between x and z differs from the graph distance between y and z. Even though this notion has been part of the literature for almost 40 years, the computational complexity of determining the metric… (More)

- Lauri Ahlroth, Olli Pottonen, André Schumacher
- Algorithmica
- 2013

In many complex computational processes one may want to store a sample of the process’ history for later use by placing checkpoints. In this paper we consider the problem of maintaining, in an online fashion, a collection of k checkpoints as an approximately uniformly spaced sample in the history of a continuous-time process. We present deterministic… (More)

- Petteri Kaski, Patric R. J. Östergård, Olli Pottonen
- J. Comb. Theory, Ser. A
- 2006

The Steiner quadruple systems of order 16 are classified up to isomorphism by means of an exhaustive computer search. The number of isomorphism classes of such designs is 1,054,163. Properties of the designs—including the orders of the automorphism groups and the structures of the derived Steiner triple systems of order 15—are tabulated. A double-counting… (More)

- Charles J. Colbourn, Petteri Kaski, Patric R. J. Östergård, David A. Pike, Olli Pottonen
- Discrete Mathematics
- 2011

- Ivan Yu. Mogilnykh, Patric R. J. Östergård, Olli Pottonen, Faina I. Solov'eva
- IEEE Transactions on Information Theory
- 2009

The minimum distance graph of a code has the codewords as vertices and edges exactly when the Hamming distance between two codewords equals the minimum distance of the code. A constructive proof for reconstructibility of an extended perfect binary one-error-correcting code from its minimum distance graph is presented. Consequently, inequivalent such codes… (More)

A method for compressing Steiner triple systems is presented. This method has been used to compress the 11,084,874,829 Steiner triple systems of order 19 into approximately 39 gigabytes of memory. The compressed data can be obtained by contacting the authors.