A new binary code of length 10 and covering radius 1. - Patric R. J. Östergård (IEEE Trans. Inf. Theory, 1991)

Upper bounds for q-ary covering codes. - Patric R. J. Östergård (IEEE Trans. Inf. Theory, 1991)

Correction to 'Upper Bounds for q-ary Covering Codes'. - Patric R. J. Östergård (IEEE Trans. Inf. Theory, 1991)

Further results on (k, t)-subnormal covering codes. - Patric R. J. Östergård (IEEE Trans. Inf. Theory, 1992)

New Upper Bounds for the Football Pool Problem for 11 and 12 Matches. - Patric R. J. Östergård (J. Comb. Theory A, 1994)

New multiple covering codes by tabu search. - Patric R. J. Östergård (Australas. J Comb., 1995)

Bounds for Binary Codes That Are Multiple Coverings of the Farthest-Off Points. - Heikki O. Hämäläinen; Iiro S. Honkala; Simon Litsyn; Patric R. J. Östergård (SIAM J. Discret. Math., 1995)

A Combinatorial Proof for the Football Pool Problem for Six Matches. - Patric R. J. Östergård (J. Comb. Theory A, 1996)

New single-error-correcting codes. - Patric R. J. Östergård; Markku K. Kaikkonen (IEEE Trans. Inf. Theory, 1996)

A New Table of Binary/Ternary Mixed Covering Codes. - Patric R. J. Östergård; Heikki O. Hämäläinen (Des. Codes Cryptogr., 1997)

Packing up to 50 Equal Circles in a Square. - Kari J. Nurmela; Patric R. J. Östergård (Discret. Comput. Geom., 1997)

A Coloring Problem in Hamming Spaces. - Patric R. J. Östergård (Eur. J. Comb., 1997)

Ternary Covering Codes Derived from BCH Codes. - John C. Cock; Patric R. J. Östergård (J. Comb. Theory A, 1997)

Improved bounds for ternary linear codes of dimension 7. - T. Aaron Gulliver; Patric R. J. Östergård (IEEE Trans. Inf. Theory, 1997)

New constant weight codes from linear permutation groups. - Kari J. Nurmela; Markku K. Kaikkonen; Patric R. J. Östergård (IEEE Trans. Inf. Theory, 1997)

Improved Bounds for Quaternary Linear Codes of Dimension 6. - T. Aaron Gulliver; Patric R. J. Östergård (Appl. Algebra Eng. Commun. Comput., 1998)

Dense packings of congruent circles in a circle. - Ronald L. Graham; Boris D. Lubachevsky; Kari J. Nurmela; Patric R. J. Östergård (Discret. Math., 1998)

On the structure of optimal error-correcting codes. - Patric R. J. Östergård (Discret. Math., 1998)

New upper bounds for binary covering codes. - Patric R. J. Östergård; Markku K. Kaikkonen (Discret. Math., 1998)

Bounds on Mixed Binary/Ternary Codes. - Andries E. Brouwer; Heikki O. Hämäläinen; Patric R. J. Östergård; Neil J. A. Sloane (IEEE Trans. Inf. Theory, 1998)

Greedy and Heuristic Algorithms for Codes and Colorings. - Tuvi Etzion; Patric R. J. Östergård (IEEE Trans. Inf. Theory, 1998)

On Binary/Ternary Error-Correcting Codes with Minimum Distance 4. - Patric R. J. Östergård (AAECC, 1999)

New Constructions for q-ary Covering Codes. - Patric R. J. Östergård (Ars Comb., 1999)

Covering t-sets with (t+2)-sets. - Kari J. Nurmela; Patric R. J. Östergård (Discret. Appl. Math., 1999)

New Linear Codes with Covering Radius 2 and Odd Basis. - Alexander A. Davydov; Patric R. J. Östergård (Des. Codes Cryptogr., 1999)

Constructing Covering Codes with Given Automorphisms. - Patric R. J. Östergård; William D. Weakley (Des. Codes Cryptogr., 1999)

More Optimal Packings of Equal Circles in a Square. - Kari J. Nurmela; Patric R. J. Östergård (Discret. Comput. Geom., 1999)

Optimal Binary One-Error-Correcting Codes of Length 10 Have 72 Codewords. - Patric R. J. Östergård; Tsonka Stefanova Baicheva; Emil Kolev (IEEE Trans. Inf. Theory, 1999)

Enumeration of 2-(12, 3, 2) designs. - Patric R. J. Östergård (Australas. J Comb., 2000)

New Binary Linear Codes. - T. Aaron Gulliver; Patric R. J. Östergård (Ars Comb., 2000)

Classification of binary/ternary one-error-correcting codes. - Patric R. J. Östergård (Discret. Math., 2000)

On Saturating Sets in Small Projective Geometries. - Alexander A. Davydov; Patric R. J. Östergård (Eur. J. Comb., 2000)

Values of Domination Numbers of the Queen's Graph. - Patric R. J. Östergård; William D. Weakley (Electron. J. Comb., 2001)

Error-Correcting Codes over an Alphabet of Four Elements. - Galina T. Bogdanova; Andries E. Brouwer; Stoyan N. Kapralov; Patric R. J. Östergård (Des. Codes Cryptogr., 2001)

Bounds on codes over an alphabet of five elements. - Galina T. Bogdanova; Patric R. J. Östergård (Discret. Math., 2001)

Improved Bounds for Ternary Linear Codes of Dimension 8 Using Tabu Search. - T. Aaron Gulliver; Patric R. J. Östergård (J. Heuristics, 2001)

A New Algorithm for the Maximum-Weight Clique Problem. - Patric R. J. Östergård (Nord. J. Comput., 2001)

Linear codes with covering radius R = 2, 3 and codimension tR. - Alexander A. Davydov; Patric R. J. Östergård (IEEE Trans. Inf. Theory, 2001)

On the size of optimal binary codes of length 9 and covering radius 1. - Patric R. J. Östergård; Uri Blass (IEEE Trans. Inf. Theory, 2001)

Ternary Constant Weight Codes. - Patric R. J. Östergård; Mattias Svanström (Electron. J. Comb., 2002)

A fast algorithm for the maximum clique problem. - Patric R. J. Östergård (Discret. Appl. Math., 2002)

A 2-(22, 8, 4) Design Cannot Have a 2-(10, 4, 4) Subdesign. - Patric R. J. Östergård (Des. Codes Cryptogr., 2002)

Classifying Subspaces of Hamming Spaces. - Patric R. J. Östergård (Des. Codes Cryptogr., 2002)

Enumeration of 2-(9, 3, lambda) Designs and Their Resolutions. - Patric R. J. Östergård; Petteri Kaski (Des. Codes Cryptogr., 2002)

Self-dual and maximal self-orthogonal codes over F7. - Masaaki Harada; Patric R. J. Östergård (Discret. Math., 2002)

Classification of Extremal Formally Self-Dual Even Codes of Length 22. - Masaaki Harada; Patric R. J. Östergård (Graphs Comb., 2002)

A New Lower Bound for the Football Pool Problem for Six Matches. - Patric R. J. Östergård; Alfred Wassermann (J. Comb. Theory A, 2002)

Bounds and constructions for ternary constant-composition codes. - Mattias Svanström; Patric R. J. Östergård; Galina T. Bogdanova (IEEE Trans. Inf. Theory, 2002)

Binary Two-Error-Correcting Codes are Better than Quaternary. - Patric R. J. Östergård (Appl. Algebra Eng. Commun. Comput., 2003)

Classification of whist tournaments with up to 12 players. - Harri Haanpää; Patric R. J. Östergård (Discret. Appl. Math., 2003)

More c-Bhaskar Rao designs with small block size. - Dameng Deng; Malcolm Greig; Patric R. J. Östergård (Discret. Math., 2003)

Optimal linear rate 1/2 codes over F5 and F2. - T. Aaron Gulliver; Patric R. J. Östergård; Nikolai Senkevitch (Discret. Math., 2003)

On the Classification of Self-Dual Codes over F5. - Masaaki Harada; Patric R. J. Östergård (Graphs Comb., 2003)

An improved upper bound for the football pool problem for nine matches. - Franco Di Pasquale; Patric R. J. Östergård (J. Comb. Theory A, 2003)

Optimal quaternary linear rate-1/2 codes of length <18. - T. Aaron Gulliver; Patric R. J. Östergård; Nikolai Senkevitch (IEEE Trans. Inf. Theory, 2003)

Disproof of a conjecture on the existence of balanced optimal covering codes. - Patric R. J. Östergård (IEEE Trans. Inf. Theory, 2003)

Sets in Z nwith distinct sums of pairs. - Harri Haanpää; Antti Huima; Patric R. J. Östergård (Discret. Appl. Math., 2004)

Enumeration of balanced ternary designs. - Petteri Kaski; Patric R. J. Östergård (Discret. Appl. Math., 2004)

Binary optimal linear rate 1/2 codes. - T. Aaron Gulliver; Patric R. J. Östergård (Discret. Math., 2004)

Miscellaneous classification results for 2-designs. - Petteri Kaski; Patric R. J. Östergård (Discret. Math., 2004)

On a hypercube coloring problem. - Patric R. J. Östergård (J. Comb. Theory A, 2004)

The Steiner triple systems of order 19. - Petteri Kaski; Patric R. J. Östergård (Math. Comput., 2004)

Resolving the Existence of Full-Rank Tilings of Binary Hamming Spaces. - Patric R. J. Östergård; Alexander Vardy (SIAM J. Discret. Math., 2004)

There exists no Hermitian self-dual quaternary [26, 13, 10]4 code. - Patric R. J. Östergård (IEEE Trans. Inf. Theory, 2004)

Constructing combinatorial objects via cliques. - Patric R. J. Östergård (BCC, 2005)

One-Factorizations of Regular Graphs of Order 12. - Petteri Kaski; Patric R. J. Östergård (Electron. J. Comb., 2005)

Near-Extremal Formally Self-Dual Even Codes of Lengths 24 and 32. - T. Aaron Gulliver; Masaaki Harada; Takuji Nishimura; Patric R. J. Östergård (Des. Codes Cryptogr., 2005)

Bounds for Covering Codes over Large Alphabets. - Gerzson Kéri; Patric R. J. Östergård (Des. Codes Cryptogr., 2005)

Two New Four-Error-Correcting Binary Codes. - Patric R. J. Östergård (Des. Codes Cryptogr., 2005)

New Results on Codes with Covering Radius 1 and Minimum Distance 2. - Patric R. J. Östergård; Jörn Quistorff; Alfred Wassermann (Des. Codes Cryptogr., 2005)

Classification of Self-Orthogonal Codes over F3 and F4. - Iliya Bouyukliev; Patric R. J. Östergård (SIAM J. Discret. Math., 2005)

A New Bound for the Zero-Error Capacity Region of the Two-User Binary Adder Channel. - M. Mattas; Patric R. J. Östergård (IEEE Trans. Inf. Theory, 2005)

New constructions of optimal self-dual binary codes of length 54. - Stefka Bouyuklieva; Patric R. J. Östergård (Des. Codes Cryptogr., 2006)

There are exactly five biplanes with k=11. - Patric R. J. Östergård; Petteri Kaski (Electron. Notes Discret. Math., 2006)

The Steiner quadruple systems of order 16. - Petteri Kaski; Patric R. J. Östergård; Olli Pottonen (J. Comb. Theory A, 2006)

Unidirectional covering codes. - Patric R. J. Östergård; Esa Antero Seuranen (IEEE Trans. Inf. Theory, 2006)

There exists no symmetric configuration with 33 points and line size 6. - Petteri Kaski; Patric R. J. Östergård (Australas. J Comb., 2007)

Further results on the covering radius of small codes. - Gerzson Kéri; Patric R. J. Östergård (Discret. Math., 2007)

Elementary P-Groups with the RÉdei Property. - Patric R. J. Östergård; Sándor Szabó (Int. J. Algebra Comput., 2007)

New Uniquely Decodable Codes for the T-User Binary Adder Channel With 3<=T<=5. - Lasse Kiviluoto; Patric R. J. Östergård (IEEE Trans. Inf. Theory, 2007)

On the minimum size of binary codes with length 2 R + 4 and covering radius R. - Gerzson Kéri; Patric R. J. Östergård (Des. Codes Cryptogr., 2008)

Steiner triple systems of order 19 and 21 with subsystems of order 7. - Petteri Kaski; Patric R. J. Östergård; Svetlana Topalova; Rosen Zlatarski (Discret. Math., 2008)

Small P-Groups with Full-Rank Factorization. - Harri Haanpää; Patric R. J. Östergård; Sándor Szabó (Int. J. Algebra Comput., 2008)

There exists no Steiner system S(4, 5, 17). - Patric R. J. Östergård; Olli Pottonen (J. Comb. Theory A, 2008)

P.G. Szabó, M.C. Markót, T. Csendes, E. Specht, L.G. Casado, I. García, New Approaches to Circle Packing in a Square, Springer, Berlin, 2007, ISBN: 978-0-387-45673-7, pp 238. - Patric R. J. Östergård (Oper. Res. Lett., 2008)

Sperner capacity of small digraphs. - Lasse Kiviluoto; Patric R. J. Östergård; Vesa P. Vaskelainen (Adv. Math. Commun., 2009)

Classification of the (0, 2)-graphs of valency 8. - Andries E. Brouwer; Patric R. J. Östergård (Discret. Math., 2009)

Reconstructing extended perfect binary one-error-correcting codes from their minimum distance graphs. - Ivan Yu. Mogilnykh; Patric R. J. Östergård; Olli Pottonen; Faina I. Solov'eva (IEEE Trans. Inf. Theory, 2009)

The perfect binary one-error-correcting codes of length 15: part I-classification. - Patric R. J. Östergård; Olli Pottonen (IEEE Trans. Inf. Theory, 2009)

A census of one-factorizations of the complete 3-uniform hypergraph of order 9. - Mahdad Khatirinejad; Patric R. J. Östergård (Australas. J Comb., 2010)

Properties of the Steiner Triple Systems of Order 19. - Charles J. Colbourn; Anthony D. Forbes; Mike J. Grannell; Terry S. Griggs; Petteri Kaski; Patric R. J. Östergård; David A. Pike; Olli Pottonen (Electron. J. Comb., 2010)

A tournament of order 14 with disjoint Banks and Slater sets. - Patric R. J. Östergård; Vesa P. Vaskelainen (Discret. Appl. Math., 2010)

Linear codes with covering radius 3. - Alexander A. Davydov; Patric R. J. Östergård (Des. Codes Cryptogr., 2010)

Classification of binary constant weight codes. - Patric R. J. Östergård (IEEE Trans. Inf. Theory, 2010)

The perfect binary one-error-correcting codes of length 15: part II-properties. - Patric R. J. Östergård; Olli Pottonen; Kevin T. Phelps (IEEE Trans. Inf. Theory, 2010)

Computing the Domination Number of Grid Graphs. - Samu Alanko; Simon Crevals; Anton Isopoussu; Patric R. J. Östergård; Ville Pettersson (Electron. J. Comb., 2011)

On Optimal Binary One-Error-Correcting Codes of Lengths $2^m-4$ and $2^m-3$ - Denis S. Krotov; Patric R. J. Östergård; Olli Pottonen (CoRR, 2011)

Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes. - Patric R. J. Östergård; Olli Pottonen (Des. Codes Cryptogr., 2011)

Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19. - Charles J. Colbourn; Petteri Kaski; Patric R. J. Östergård; David A. Pike; Olli Pottonen (Discret. Math., 2011)

The Cycle Switching Graph of the Steiner Triple Systems of Order 19 is Connected. - Petteri Kaski; Veli Mäkinen; Patric R. J. Östergård (Graphs Comb., 2011)

The number of Latin squares of order 11. - Alexander Hulpke; Petteri Kaski; Patric R. J. Östergård (Math. Comput., 2011)

Russian doll search for the Steiner triple covering problem. - Patric R. J. Östergård; Vesa P. Vaskelainen (Optim. Lett., 2011)

On Optimal Binary One-Error-Correcting Codes of Lengths 2m-4 and 2m-3. - Denis S. Krotov; Patric R. J. Östergård; Olli Pottonen (IEEE Trans. Inf. Theory, 2011)

On the Size of Optimal Three-Error-Correcting Binary Codes of Length 16. - Patric R. J. Östergård (IEEE Trans. Inf. Theory, 2011)

Steiner triple systems satisfying the 4-vertex condition. - Petteri Kaski; Mahdad Khatirinejad; Patric R. J. Östergård (Des. Codes Cryptogr., 2012)

Switching codes and designs. - Patric R. J. Östergård (Discret. Math., 2012)

On triple systems and strongly regular graphs. - Majid Behbahani; Clement W. H. Lam; Patric R. J. Östergård (J. Comb. Theory A, 2012)

On optimal binary codes with unbalanced coordinates. - Patric R. J. Östergård (Appl. Algebra Eng. Commun. Comput., 2013)

On the Shannon Capacity of Triangular Graphs. - Ashik Mathew Kizhakkepallathu; Patric R. J. Östergård; Alexandru Popa 001 (Electron. J. Comb., 2013)

Enumerating Cube Tilings. - K. Ashik Mathew; Patric R. J. Östergård; Alexandru Popa 001 (Discret. Comput. Geom., 2013)

The quaternary complex Hadamard matrices of orders 10, 12, and 14. - Pekka H. J. Lampio; Ferenc Szöllösi; Patric R. J. Östergård (Discret. Math., 2013)

Enumerating Perfect Matchings in n-Cubes. - Patric R. J. Östergård; Ville Pettersson (Order, 2013)

Classification of MDS Codes over Small Alphabets. - Janne I. Kokkala; Denis S. Krotov; Patric R. J. Östergård (ICMCTA, 2014)

Switching in One-Factorisations of Complete Graphs. - Petteri Kaski; André de Souza Medeiros; Patric R. J. Östergård; Ian M. Wanless (Electron. J. Comb., 2014)

Non-existence of a ternary constant weight $(16, 5, 15; 2048)$ diameter perfect code. - Denis S. Krotov; Patric R. J. Östergård; Olli Pottonen (CoRR, 2014)

On the minimum size of 4-uniform hypergraphs without property B. - Patric R. J. Östergård (Discret. Appl. Math., 2014)

On the maximum length of coil-in-the-box codes in dimension 8. - Patric R. J. Östergård; Ville H. Pettersson (Discret. Appl. Math., 2014)

A Note on Toeplitz' Conjecture. - Ville Pettersson; Helge A. Tverberg; Patric R. J. Östergård (Discret. Comput. Geom., 2014)

Large sets of t-designs over finite fields. - Michael Braun; Axel Kohnert; Patric R. J. Östergård; Alfred Wassermann (J. Comb. Theory A, 2014)

Counting Hamiltonian cycles in bipartite graphs. - Harri Haanpää; Patric R. J. Östergård (Math. Comput., 2014)

Bounds on the domination number of Kneser graphs. - Patric R. J. Östergård; Zehui Shao; Xiaodong Xu 006 (Ars Math. Contemp., 2015)

A coloring of the square of the 8-cube with 13 colors. - Janne I. Kokkala; Patric R. J. Östergård (CoRR, 2015)

Permutation codes invariant under isometries. - Ingo Janiszczak; Wolfgang Lempken; Patric R. J. Östergård; Reiner Staszewski (Des. Codes Cryptogr., 2015)

Independent domination of grids. - Simon Crevals; Patric R. J. Östergård (Discret. Math., 2015)

Exhaustive Search for Snake-in-the-Box Codes. - Patric R. J. Östergård; Ville H. Pettersson (Graphs Comb., 2015)

On hypercube packings, blocking sets and a covering problem. - K. Ashik Mathew; Patric R. J. Östergård (Inf. Process. Lett., 2015)

Enumeration of Steiner triple systems with subsystems. - Petteri Kaski; Patric R. J. Östergård; Alexandru Popa 001 (Math. Comput., 2015)

On the Classification of MDS Codes. - Janne I. Kokkala; Denis S. Krotov; Patric R. J. Östergård (IEEE Trans. Inf. Theory, 2015)

Further results on the classification of MDS codes. - Janne I. Kokkala; Patric R. J. Östergård (Adv. Math. Commun., 2016)

Non-existence of a ternary constant weight (16, 5, 15;2048) diameter perfect code. - Denis S. Krotov; Patric R. J. Östergård; Olli Pottonen (Adv. Math. Commun., 2016)

Algorithms for finding maximum transitive subtournaments. - Lasse Kiviluoto; Patric R. J. Östergård; Vesa P. Vaskelainen (J. Comb. Optim., 2016)

New Lower Bounds on Error-Correcting Ternary, Quaternary and Quinary Codes. - Antti Laaksonen; Patric R. J. Östergård (ICMCTA, 2017)

LCL Problems on Grids. - Sebastian Brandt 002; Juho Hirvonen; Janne H. Korhonen; Tuomo Lempiäinen; Patric R. J. Östergård; Christopher Purcell; Joel Rybicki; Jukka Suomela; Przemyslaw Uznanski (PODC, 2017)

Constructing error-correcting binary codes using transitive permutation groups. - Antti Laaksonen; Patric R. J. Östergård (Discret. Appl. Math., 2017)

New lower bounds for the Shannon capacity of odd cycles. - K. Ashik Mathew; Patric R. J. Östergård (Des. Codes Cryptogr., 2017)

Planar Hypohamiltonian Graphs on 40 Vertices. - Mohammadreza Jooyandeh; Brendan D. McKay; Patric R. J. Östergård; Ville H. Pettersson; Carol T. Zamfirescu (J. Graph Theory, 2017)

Mappings of Butson-type Hadamard matrices. - Patric R. J. Östergård; William T. Paavola (Discret. Math., 2018)

Switching of covering codes. - Patric R. J. Östergård; William D. Weakley (Discret. Math., 2018)

Enumeration of Seidel matrices. - Ferenc Szöllösi; Patric R. J. Östergård (Eur. J. Comb., 2018)

New Lower Bounds for Binary Constant-Dimension Subspace Codes. - Michael Braun; Patric R. J. Östergård; Alfred Wassermann (Exp. Math., 2018)

There is no McLaughlin geometry. - Patric R. J. Östergård; Leonard H. Soicher (J. Comb. Theory A, 2018)

The chromatic number of the square of the 8-cube. - Janne I. Kokkala; Patric R. J. Östergård (Math. Comput., 2018)

New lower bounds on q-ary error-correcting codes. - Antti Laaksonen; Patric R. J. Östergård (Cryptogr. Commun., 2019)

The sextuply shortened binary Golay code is optimal. - Patric R. J. Östergård (Des. Codes Cryptogr., 2019)

New Results on Tripod Packings. - Patric R. J. Östergård; Antti Pöllänen (Discret. Comput. Geom., 2019)

Constructions of Maximum Few-Distance Sets in Euclidean Spaces. - Ferenc Szöllösi; Patric R. J. Östergård (Electron. J. Comb., 2020)

Kirkman triple systems with subsystems. - Janne I. Kokkala; Patric R. J. Östergård (Discret. Math., 2020)

Orderly generation of Butson Hadamard matrices. - Patric R. J. Östergård; Pekka H. J. Lampio; Ferenc Szöllösi (Math. Comput., 2020)

Switching 3-edge-colorings of cubic graphs. - Jan Goedgebeur; Patric R. J. Östergård (Discret. Math., 2022)

Improving Uniquely Decodable Codes in Binary Adder Channels. - József Balogh; The Nguyen; Patric R. J. Östergård; Ethan Patrick White; Michael C. Wigal (CoRR, 2023)

Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161). - Lucia Moura; Anamari Nakic; Patric R. J. Östergård; Alfred Wassermann; Charlene Weiß (Dagstuhl Reports, 2023)

Spherical Codes With Prescribed Signed Permutation Automorphisms Inside Shells of Low-Dimensional Integer Lattices. - Mikhail Ganzhinov; Patric R. J. Östergård (IEEE Trans. Inf. Theory, 2024)