#### Filter Results:

- Full text PDF available (77)

#### Publication Year

1991

2017

- This year (5)
- Last 5 years (36)
- Last 10 years (68)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Patric R. J. Östergård
- Discrete Applied Mathematics
- 2002

- Patric R. J. Östergård
- Nord. J. Comput.
- 1999

- Patric R. J. Östergård
- Des. Codes Cryptography
- 2002

- Ronald L. Graham, Boris D. Lubachevsky, Kari J. Nurmela, Patric R. J. Östergård
- Discrete Mathematics
- 1998

The problem of finding packings of congruent circles in a circle, or, equivalently, of spreading points in a circle, is considered. Two packing algorithms are discussed, and the best packings found of up to 65 circles are presented.

- Patric R. J. Östergård, Mattias Svanström
- Electr. J. Comb.
- 2002

Let A3(n, d,w) denote the maximum cardinality of a ternary code with length n, minimum distance d, and constant Hamming weight w. Methods for proving upper and lower bounds on A3(n, d,w) are presented, and a table of exact values and bounds in the range n ≤ 10 is given.

- Kari J. Nurmela, Patric R. J. Östergård
- Discrete & Computational Geometry
- 1997

The Hungarian mathematician Farkas Bolyai (1775–1856) published in his principal work (‘Tentamen’, 1832–33 [Bol04]) a dense regular packing of equal circles in an equilateral triangle (see Fig. 1). He defined an infinite packing series and investigated the limit of vacuitas (in Latin, the gap in the triangle outside the circles). It is interesting that… (More)

- Andries E. Brouwer, Heikki O. Hämäläinen, Patric R. J. Östergård, N. J. A. Sloane
- IEEE Trans. Information Theory
- 1998

Upper and lower bounds are presented for the maximal possible size of mixed binary/ternary error-correcting codes. A table up to length 13 is included. The upper bounds are obtained by applying the linear programming bound to the product of two association schemes. The lower bounds arise from a number of different constructions.

- Patric R. J. Östergård
- IEEE Transactions on Information Theory
- 2010

A binary code <i>C</i> ⊆ F<sub>2</sub><i>n</i> with minimum distance at least <i>d</i> and codewords of Hamming weight <i>w</i> is called an <i>(n</i>,<i>d</i>,<i>w</i>) constant weight code. The maximum size of an <i>(n</i>,<i>d</i>,<i>w</i>) constant weight code is denoted by <i>A</i>(<i>n</i>,<i>d</i>,<i>w</i>), and codes of this size are said to… (More)

- Mattias Svanström, Patric R. J. Östergård, Galina T. Bogdanova
- IEEE Trans. Information Theory
- 2002

- Patric R. J. Östergård, Tsonka Stefanova Baicheva, Emil Kolev
- IEEE Trans. Information Theory
- 1999

The maximum number of codewords in a binary code with length n and minimum distance d is denoted by A(n; d). By construction it is known that A(10; 3) 72 and A(11; 3) 144. These bounds have long been conjectured to be the exact values. This is here proved by classifying various codes of smaller length and lengthening these using backtracking and isomorphism… (More)