Patric Östergård
Professor, Information Theory at Aalto University School of Business
Biography
Aalto University School of Business
Peer-reviewed scientific articles
Journal article-refereed, Original researchClassification of Cyclic Steiner Quadruple Systems
Chang, Yanxun; Fan, Bingli; Feng, Tao; Holt, Derek F.; Östergård, Patric R J2017 in JOURNAL OF COMBINATORIAL DESIGNS (John Wiley and Sons Inc.)ISSN: 1063-8539Total domination of grid graphs
Crevals, Simon; Ostergard, Patric R.J.2017 in JCMCC (Charles Babbage Research Centre)ISSN: 0835-3026Planar Hypohamiltonian Graphs on 40 Vertices
Jooyandeh, Mohammadreza; Mckay, Brendan D.; Östergård, Patric R J; Pettersson, Ville H.; Zamfirescu, Carol T.2017 in JOURNAL OF GRAPH THEORY (Wiley-Liss Inc.)ISSN: 0364-9024Constructing error-correcting binary codes using transitive permutation groups
Laaksonen, Antti; Östergård, Patric R.J.2017 in DISCRETE APPLIED MATHEMATICS (Elsevier)ISSN: 0166-218XNew lower bounds for the Shannon capacity of odd cycles
Mathew, K. Ashik; Östergård, Patric R J2017 in DESIGNS CODES AND CRYPTOGRAPHY (Springer Netherlands)ISSN: 0925-1022Existence of q-analogs of Steiner systems
Braun, Michael; Etzion, Tuvi ; Östergård, Patric R. J.; Vardy, Alexander; Wassermann, Alfred2016 in FORUM OF MATHEMATICS, PI (Springer Netherlands)ISSN: 2050-5086New Lower Bounds for Binary Constant-Dimension Subspace Codes
Braun, Michael; Östergård, Patric R J; Wassermann, Alfred2016 in EXPERIMENTAL MATHEMATICS (A K Peters)ISSN: 1058-6458Algorithms for finding maximum transitive subtournaments
Kiviluoto, Lasse; Östergård, Patric R J; Vaskelainen, Vesa P.2016 in JOURNAL OF COMBINATORIAL OPTIMIZATION (Springer Netherlands)ISSN: 1382-6905Further results on the classification of MDS codes
Kokkala, Janne I.; Östergård, Patric R J2016 in ADVANCES IN MATHEMATICS OF COMMUNICATIONS (American Institute of Mathematical Sciences)ISSN: 1930-5346Non-existence of a ternary constant weight (16, 5, 15; 2048) diameter perfect code
Krotov, Denis S.; Östergård, Patric R J; Pottonen, Olli2016 in ADVANCES IN MATHEMATICS OF COMMUNICATIONS (American Institute of Mathematical Sciences)ISSN: 1930-5346Independent domination of grids
Crevals, Simon; Östergård, Patric R.J.2015 in Discrete Mathematics (Elsevier)ISSN: 0012-365XPermutation codes invariant under isometries
Janiszczak, Ingo; Lempken, Wolfgang; Östergård, Patric R.J.; Staszewski, Reiner2015 in DESIGNS CODES AND CRYPTOGRAPHY (Springer Netherlands)ISSN: 0925-1022Enumeration of Steiner triple systems with subsystems,
Kaski, Petteri; Östergård, Patric R.J.; Popa, Alexandru2015 in MATHEMATICS OF COMPUTATION (Springer Netherlands)ISSN: 0025-5718On hypercube packings, blocking sets and a covering problem
Kizhakkepallathu, Ashik Mathew; Östergård, Patric R.J.2015 in INFORMATION PROCESSING LETTERS (Elsevier)ISSN: 0020-0190Hypercube packings and their holes
Kizhakkepallathu, Ashik Mathew; Östergård, Patric R.J.2015 in Congressus Numerantium (Elsevier)On the Classification of MDS codes
Kokkala, Janne I.; Krotov, Denis S.; Östergård, Patric R.J.2015 in IEEE Transactions on information theory (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)ISSN: 0018-9448Classification of Graeco-Latin cubes
Kokkala, Janne I.; Östergård, Patric R.J.2015 in JOURNAL OF COMBINATORIAL DESIGNS (John Wiley and Sons Inc.)ISSN: 1063-8539Exhaustive search for snake-in-the-box codes
Östergård, Patric R.J.; Pettersson, Ville H.2015 in GRAPHS AND COMBINATORICS (Springer Japan)ISSN: 0911-0119Bounds on the domination number of Kneser graphs
Östergård, Patric R.J.; Shao, Zehui; Xu, Xiaodong2015 in ARS MATHEMATICA CONTEMPORANEA (DMFA Slovenije)ISSN: 1855-3966Large sets of t-designs over finite fields
Braun, Michael; Kohnert, Axel; Östergård, Patric R.J.; Wassermann, Alfred2014 in JOURNAL OF COMBINATORIAL THEORY SERIES A (Academic Press Inc.)ISSN: 0097-3165COUNTING HAMILTONIAN CYCLES IN BIPARTITE GRAPHS
Haanpää, Harri; Östergård, Patric R.J.2014 in MATHEMATICS OF COMPUTATION (Academic Press Inc.)ISSN: 0025-5718Switching in one-factorisations of complete graphs
Kaski, Petteri; de Souza Medeiros, André; Östergård, Patric R.J.; Wanless, Ian M.2014 in ELECTRONIC JOURNAL OF COMBINATORICS (Electronic Journal of Combinatorics)ISSN: 1097-1440The Mendelsohn Triple Systems of Order 13
Khatirinejad, Mahdad; Östergård, Patric R.J.; Popa, Alexandru2014 in JOURNAL OF COMBINATORIAL DESIGNS (John Wiley and Sons Inc.)ISSN: 1063-8539A Note on Toeplitz' Conjecture
Pettersson, Ville H.; Tverberg, Helge A.; Östergård, Patric R.J.2014 in DISCRETE AND COMPUTATIONAL GEOMETRY (Springer New York)ISSN: 0179-5376On the Maximum Length of Coil-in-the-Box Codes in Dimension 8
Östergård, Patric R.J; Pettersson, Ville H.2014 in DISCRETE APPLIED MATHEMATICS (Elsevier)ISSN: 0166-218XOn the minimum size of 4-uniform hypergraphs without property B
Östergård, Patric R.J.2014 in DISCRETE APPLIED MATHEMATICS (Elsevier)ISSN: 0166-218XEnumerating Cube Tilings
Kizhakkepallathu, Ashik Mathew; Östergård, Patric RJ; Popa, Alexandru2013 in DISCRETE AND COMPUTATIONAL GEOMETRY (Springer New York)ISSN: 0179-5376On the Shannon Capacity of Triangular Graphs
Kizhakkepallathu, Ashik Mathew; Östergård, Patric RJ; Popa, Alexandru2013 in ELECTRONIC JOURNAL OF COMBINATORICS (Electronic Journal of Combinatorics)ISSN: 1097-1440The quaternary complex Hadamard matrices of orders 10, 12 and 14
Lampio, Pekka; Szöllösi, Ferenc; Östergård, Patric Ralf Johan2013 in Discrete Mathematics (Elsevier)ISSN: 0012-365XEnumerating Perfect Matchings in n-Cubes
Östergård, Patric R.J; Pettersson, Ville2013 in ORDER: A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS (Springer Netherlands)ISSN: 0167-8094On optimal binary codes with unbalanced coordinates, Applicable Algebra in Engineering
Östergård, Patric R.J.2013 in APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING (Springer Verlag)ISSN: 0938-1279On triple systems and strongly regular graphs
Behbahani, Majid; Lam, Clement; Östergård, Patric R.J.2012 in JOURNAL OF COMBINATORIAL THEORY SERIES A (Academic Press Inc.)ISSN: 0097-3165Packing Costas arrays
Dinitz, Jeffrey H.; Östergård, Patric R.J.; Stinson, Douglas R.2012 in JCMCC (Charles Babbage Research Centre)ISSN: 0835-3026Steiner triple systems satisfying the 4-vertex condition
Kaski, Petteri; Khatirinejad, Mahdad; Östergård, Patric R.J.2012 in DESIGNS CODES AND CRYPTOGRAPHY (Springer Netherlands)ISSN: 0925-1022Switching codes and designs
Östergård, Patric Ralf Johan2012 in Discrete Mathematics (Elsevier)ISSN: 0012-365XComputing the domination number of grid graphs
Alanko, Samu; Crevals, Simon; Isopoussu, Anton; Östergård, Patric; Pettersson, Ville2011 in ELECTRONIC JOURNAL OF COMBINATORICS (Electronic Journal of Combinatorics)ISSN: 1097-1440Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19
Colbourn, Charles J; Kaski, Petteri; Östergård, Patric R.J; Pike, David A; Pottonen, Olli2011 in Discrete Mathematics (Elsevier)ISSN: 0012-365XThe number of Latin squares of order 11
Hulpke, Alexander; Kaski, Petteri; Östergård, Patric R.J.2011 in MATHEMATICS OF COMPUTATION (Elsevier)ISSN: 0025-5718The Cycle Switching Graph of the Steiner Triple Systems of Order 19 is Connected
Kaski, Petteri; Mäkinen, Veli; Östergård, Patric R.J.2011 in GRAPHS AND COMBINATORICS (Springer Japan)ISSN: 0911-0119On optimal binary one-error-correcting codes of lengths 2^{m-4} and 2^{m-3}
Krotov, Denis S; Östergård, Patric R.J; Pottonen, Olli2011 in IEEE Transactions on information theory (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)ISSN: 0018-9448Classification of difference matrices over cyclic groups
Lampio, Pekka; Östergård, Patric R.J.2011 in JOURNAL OF STATISTICAL PLANNING AND INFERENCE (Elsevier)ISSN: 0378-3758Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes
Östergård, Patric R.J; Pottonen, Olli2011 in DESIGNS CODES AND CRYPTOGRAPHY (Springer Netherlands)ISSN: 0925-1022Russian doll search for the Steiner triple covering problem
Östergård, Patric R.J.; Vaskelainen, Vesa P.2011 in OPTIMIZATION LETTERS (Springer Verlag)ISSN: 1862-4472On the size of optimal three-error-correcting binary codes of length 16
Östergård, Patric R.J.2011 in IEEE Transactions on information theory (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)ISSN: 0018-9448Properties of the Steiner triple systems of order 19
Colbourn, Charles J; Forbes, Anthony D; Grannell, Mike J; Griggs, Terry S; Kaski, Petteri; Östergård, Patric R.J; Pike, David A; Pottonen, Olli2010 in ELECTRONIC JOURNAL OF COMBINATORICS (Electronic Journal of Combinatorics)ISSN: 1097-1440Linear codes with covering radius 3
Davydov, Alexander A; Östergård, Patric R.J.2010 in DESIGNS CODES AND CRYPTOGRAPHY (Springer Netherlands)ISSN: 0925-1022The nonexistence of a (K_6-e)-decomposition of the complete graph K_29
Hartke, Stephen G; Östergård, Patric R.J; Bryant, Darryn; El-Zanati, Saad I.2010 in JOURNAL OF COMBINATORIAL DESIGNS (John Wiley and Sons Inc.)ISSN: 1063-8539A census of one-factorizations of the complete 3-uniform hypergraph of order 9
Khatirinejad, Mahdad; Östergård, Patric R.J.2010 in AUSTRALASIAN JOURNAL OF COMBINATORICS (University of Queensland Press)ISSN: 1034-4942Classification of starters
Linja-aho, Vesa; Östergård, Patric R.J.2010 in JCMCC (Charles Babbage Research Centre)ISSN: 0835-3026A tournament of order 14 with disjoint Banks and Slater sets
Östergård, Patric R.J; Vaskelainen, Vesa2010 in DISCRETE APPLIED MATHEMATICS (Elsevier)ISSN: 0166-218XThe perfect binary one-error-correcting codes of length 15 Part II-Properties
Östergård, Patric R.J.; Pottonen, Olli; Phelps, Kevin2010 in IEEE Transactions on information theory (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)ISSN: 0018-9448Classification of binary constant weight codes
Östergård, Patric R.J.2010 in IEEE Transactions on information theory (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)ISSN: 0018-9448Classification of the (0,2)-graphs of valency 8
Brouwer, Andries E.; Östergård, Patric R.J.2009 in Discrete Mathematics (Elsevier)There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations of K14
Kaski, Petteri; Östergård, Patric R.J.2009 in JOURNAL OF COMBINATORIAL DESIGNS (John Wiley and Sons Inc.)Classification of resolvable balanced incomplete block designs -- The unitals on 28 points
Kaski, Petteri; Östergård, Patric R.J.2009 in MATHEMATICA SLOVACA (Versita)A catalogue of the Steiner triple systems of order 19
Kaski, Petteri; Östergård, Patric R.J.; Pottonen, Olli; Kiviluoto, Lasse2009 in Bulletin of the Institute of Combinatorics and its Applications (Versita)Sperner capacity of small digraphs
Kiviluoto, Lasse; Östergård, Patric R.J.; Vaskelainen, Vesa P.2009 in ADVANCES IN MATHEMATICS OF COMMUNICATIONS (American Institute of Mathematical Sciences)Reconstructing extended perfect binary one-error-correcting codes from their minimum distance graphs
Mogilnykh, Ivan Yu.; Östergård, Patric R.J.; Pottonen, Olli; "Solov'eva", Faina I.2009 in IEEE Transactions on information theory (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)The perfect binary one-error-correcting codes of length 15: Part I -- Classification
Östergård, Patric R.J.; Pottonen, Olli2009 in IEEE Transactions on information theory (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)ISSN: 0018-9448Small p-groups with full-rank factorization
Haanpää, Harri; Östergård, Patric R.J; Szabó, Sándor2008 in INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION (World Scientific Publishing Co. Pte Ltd)There are exactly five biplanes with k = 11
Kaski, Petteri; Östergård, Patric R.J.2008 in JOURNAL OF COMBINATORIAL DESIGNS (John Wiley and Sons Inc.)Steiner triple systems of order 19 and 21 with subsystems of order 7
Kaski, Petteri; Östergård, Patric R.J.; Topalova, Svetlana; Zlatarksi, Rosen2008 in Discrete Mathematics (Elsevier)On the minimum size of binary codes with length 2R + 4 and covering radius R
Keri, Gerzson; Östergard, Patric R.J.2008 in DESIGNS CODES AND CRYPTOGRAPHY (Springer Netherlands)ISSN: 0925-1022There exists no Steiner system S(4,5,17)
Östergård, Patric; Pottonen, Olli2008 in JOURNAL OF COMBINATORIAL THEORY SERIES A (Academic Press Inc.)Sets in Abelian groups with distinct sums of pairs
Haanpää, Harri; Östergård, Patric2007 in JOURNAL OF NUMBER THEORY (Academic Press Inc.)There exists no symmetric configuration with 33 points and line size 6
Kaski, Petteri; Östergård, Patric2007 in AUSTRALASIAN JOURNAL OF COMBINATORICS (University of Queensland Press)Further results on the covering radius of small codes
Östergård, Patric Ralf Johan; Kéri, Gerzson2007 in Discrete Mathematics (Elsevier)New uniquely decodable codes for the T-user binary adder channel with 3
Östergård, Patric; Kiviluoto, Lasse2007 in IEEE Transactions on information theory (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)Algorithms for the combinatorial best barbeque problem
Östergård, Patric; Vaskelainen, Vesa; Mosig, Axel2007 in MATCH: COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY (UNIV KRAGUJEVAC, FAC SCIENCE)There exist Steiner triple systems of order 15 that do not occur in a perfect binary one-error-correcting code
Östergård, Patric; Pottonen, Olli2007 in JOURNAL OF COMBINATORIAL DESIGNS (John Wiley and Sons Inc.)Elementary p-groups with the Rédei property
Östergård, Patric; Szabó, Sándor2007 in INTERNATIONAL JOURNAL OF ALGEBRA AND COMPUTATION (World Scientific Publishing Co. Pte Ltd)Classification of optimal binary self-orthogonal codes up to length 24
Bouyukliev, Iliya; Bouyuklieva, Stefka; Gulliver, T.Aaron; Östergård, Patric Ralf Johan2006 in Journal of Combinatorial Mathematics and Combinatorial Computing (World Scientific Publishing Co. Pte Ltd)New constructions of optimal self-dual binary codes of length 54
Bouyuklieva, S.; Östergård, Patric R.J.2006 in Designs, Codes and Cryptography (World Scientific Publishing Co. Pte Ltd)The Steiner quadruple systems of order 16
Kaski, Petteri; Östergård, Patric R.J.; Pottonen, Olli2006 in JOURNAL OF COMBINATORIAL THEORY SERIES A (Academic Press Inc.)The number of inequivalent (2R+3,7)R optimal covering codes
Kéri, G.; Östergård, Patric R.J.2006 in JOURNAL OF INTEGER SEQUENCES (Academic Press Inc.)New lower bounds for asymmetric covering codes
Seuranen, Esa A.; Östergård, Patric R.J.2006 in Congressus Numerantium (Academic Press Inc.)Unidirectional covering codes
Östergård, Patric R.J.; Seuranen, Esa A.2006 in IEEE Transactions on information theory (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)Classification of self-orthogonal codes over F3 and F4
Bouyukliev, I.; Östergård, Patric2005 in SIAM Journal on Discrete Mathematics (Society for Industrial and Applied Mathematics Publications)Near-extremal formally self-dual even codes of lengths 24 and 32
Gulliver, T.A.; Harada, M.; Nishimura, T.; Östergård, Patric2005 in Designs, Codes and Cryptography (Society for Industrial and Applied Mathematics Publications)One-factorizations of regular graphs of order 12
Kaski, Petteri; Östergård, Patric R.J.2005 in ELECTRONIC JOURNAL OF COMBINATORICS (Electronic Journal of Combinatorics)ISSN: 1097-1440Bounds for covering codes over large alphabets
Kéri, G.; Östergård, Patric2005 in Designs, Codes and Cryptography (Electronic Journal of Combinatorics)A new bound for the zero-error capacity region of the two-user binary adder channel
Mattas, M.; Östergård, Patric2005 in IEEE Transactions on information theory (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)Two new four-error-correcting binary codes
Östergård, Patric2005 in Designs, Codes and Cryptography (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)Classification of directed and hybrid triple systems
Östergård, Patric; Pottonen, Olli2005 in Bayreuther Mathematische Schriften (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)New results on codes with covering radius 1 and minimum distance 2
Östergård, Patric; Quistorff, J.; Wassermann, A.2005 in Designs, Codes and Cryptography (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)An updated table of binary/ternary mixed covering codes
Bertolo, Riccardo; Östergård, Patric R.J; Weakley, William D.2004 in JOURNAL OF COMBINATORIAL DESIGNS (John Wiley and Sons Inc.)Binary optimal linear rate 1/2 codes
Gulliver, T.Aaron; Östergård, Patric R.J.2004 in Discrete Mathematics (Elsevier)Sets in Zn with distinct sums of pairs
Haanpää, Harri; Huima, Antti; Östergård, Patric R.J.2004 in DISCRETE APPLIED MATHEMATICS (Elsevier)There exist nonisomorphic STS(19) with equivalent point codes
Kaski, Petteri; Östergård, Patric R.J.2004 in JOURNAL OF COMBINATORIAL DESIGNS (John Wiley and Sons Inc.)Miscellaneous classification results for 2-desings
Kaski, Petteri; Östergård, Patric R.J.2004 in Discrete Mathematics (Elsevier)The Steiner triple systems of order 19
Kaski, Petteri; Östergård, Patric R.J.2004 in MATHEMATICS OF COMPUTATION (Elsevier)Enumeration of balanced ternary designs
Kaski, Petteri; Östergård, Patric R.J.2004 in Descret Applied Mathematics (Elsevier)There exists no Hermitian self-dual quaternary [26,13,10]_4 code
Östergård, Patric R.J.2004 in IEEE Transactions on information theory (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)On a hypercube coloring problem
Östergård, Patric R.J.2004 in JOURNAL OF COMBINATORIAL THEORY SERIES A (Academic Press Inc.)Resolving the existence of full-rank tilings of binary Hamming spaces
Östergård, Patric R.J.; Vardy, Alexander2004 in SIAM Journal on Discrete Mathematics (Society for Industrial and Applied Mathematics Publications)On the nonexistence of bent Hamiltonian paths in the grid graph P3 x P5 x P5
Östergård, Patric R.J.2004 in Bulletin of the Institute of Combinatorics and its Applications (Society for Industrial and Applied Mathematics Publications)Constructing asymmetric covering codes by tabu search
Östergård, Patric R.J; Seuranen, Esa A.2004 in Journal of Combinatorial Mathematics and Combinatorial (Society for Industrial and Applied Mathematics Publications)More c-Bhaskar Rao designs with small block size
Deng, D.; Greig, M.; Östergård, P.R.J.2003 in Discrete Mathematics (Elsevier)An improved upper bound for the football pool problem for nine matches
Di Paquale, F.; Östergård, P.R.J.2003 in JOURNAL OF COMBINATORIAL THEORY SERIES A (Academic Press Inc.)Optimal linear rate ½ codes over F5 and F7
Gulliver, T.A; Östergård, P.R.J; Senkevitch, N.2003 in Discrete Mathematics (Elsevier)Optimal quaternary linear rate-1/2 codes of length
Gulliver, T.A.; Östergård, P.R.J.; Senkevitch, N.2003 in IEEE Transactions on information theory (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)Classification of whist tournaments with up to 12 players
Haanpää, Harri; Östergård, Patric R.J.2003 in DISCRETE APPLIED MATHEMATICS (Elsevier)On the classification of self-dual codes over F5
Harada, M.; Östergård, P.R.J.2003 in GRAPHS AND COMBINATORICS (Springer Japan)Classification of resolvablr 2-(14,7,12) and 3-(14,7,5) designs
Kaski, P.; Morales, L.B; Östergård, P.R.J; Rosenblueth, D.A; Velarde, C.2003 in Journal of Combinatorial Mathematics and Combinatorial Computing (Springer Japan)On the covering radius of small codes
Kéri, G.; Östergård, P.R.J.2003 in STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA (Akademiai Kiado)Disproof of a conjecture on the existence of balanced optimal covering codes
Östergård, P.R.J.2003 in IEEE Transactions on information theory (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)Binary two-error-correcting codes are better than quaternary
Östergård, P.R.J.2003 in Applicable Algebra in Engineering, Communication and Computing (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)A covering problem for tori
Östergård, Patric R.J; Riihonen, Taneli2003 in ANNALS OF COMBINATORICS (Birkhauser Verlag Basel)A census of small Petri nets
Östergård, P.R.J.2003 in Petri Net Newletter (Birkhauser Verlag Basel)Classification of extremal formally self-dual even codes
Harada, M.; Östergård, P.R.J.2002 in GRAPHS AND COMBINATORICS (Springer Japan)Self-dual and maximal self-orthogonal codes over F_7
Harada, M.; Östergård, P.R.J.2002 in Discrete Mathematics (Elsevier)A fast algorithm for the maximum clique problem
Östergård, Patric R.J.2002 in DISCRETE APPLIED MATHEMATICS (Elsevier)Ternary constant weight codes
Östergård, P.R.J; Svanström, M.2002 in ELECTRONIC JOURNAL OF COMBINATORICS (Electronic Journal of Combinatorics)A 2-(22,8,4) design cannot have a 2-(10,4,4) subdesign
Östergård, Patric2002 in Designs, Codes and Cryptography (Electronic Journal of Combinatorics)Classifying optimal ternary codes of length 5 and covering radius 1
Östergård, P.R.J; Weakley, W.D.2002 in BEITRÄGE ZUR ALGEBRA UND GEOMETRIE (Springer Berlin)A new lower bound for the football pool problem for six matches
Östergård, P.R.J.; Wasserman, A.2002 in JOURNAL OF COMBINATORIAL THEORY SERIES A (Academic Press Inc.)Enumeration of 2-(9,3,\lambda) designs and theri resolutions
Östergård, P.R.J; Kaski, P.2002 in Designs, Codes and Cryptography (Academic Press Inc.)Bounds on codes over an alphabet of five elements
Bogdanova, Galina T.; Östergård, Patric R.J.2001 in Discrete Mathematics (Elsevier)Error-correcting codes over an alphabet of four elements
Bogdanova, Galina T.; Brouwer, Andries E.; Kapralov, Stoian N.; Östergård, Patric R.J.2001 in Designs, Codes and Cryptography (Elsevier)Recursive constructions of complete caps
Davydov, A.A; Östergård, P.R.J.2001 in JOURNAL OF STATISTICAL PLANNING AND INFERENCE (Elsevier)Linear codes with covering radius R=2,3 and codimension tR
Davydov, A.A; Östergård, P.R.J.2001 in IEEE Transactions on information theory (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)Improved bounds for ternary linear codes of dimension 8 using tabu search
Gulliver, T.Aaron; Östergård, Patric R.J.2001 in JOURNAL OF HEURISTICS (Springer Netherlands)There exists no (15,5,4) RBIBD
Kaski, Petteri; Östergård, Patric R.J.2001 in JOURNAL OF COMBINATORIAL DESIGNS (John Wiley and Sons Inc.)On the size of optimal binary codes of length 9 and covering radius 1
Östergård, P.; Blass, U.2001 in IEEE Transactions on information theory (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)A new algorithm for the maximum-weight clique problem
Östergård, Patric R.J.2001 in NORDIC JOURNAL OF COMPUTING (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)There are 270,474,142 nonisomorphic 2-(9,4,6) designs
Östergård, P.R.J.2001 in Journal of Combinatorial Mathematics and Combinatorial Computing (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)Values of Domination Numbers of the Queen's Graph
Östergård, Patric R.J.; Weakley, William D.2001 in ELECTRONIC JOURNAL OF COMBINATORICS (Electronic Journal of Combinatorics)On Saturating Sets in Small Projective Geometries
Davydov, A.; Östergård, P.R.J.2000 in European Journal of Combinatorics (Academic Press Inc.)New Quaternary Linear Codes with Covering Radius 2
Davydov, A.; Östergård, P.R.J.2000 in FINITE FIELDS AND THEIR APPLICATIONS (Academic Press Inc.)New binary linear codes
Gulliver, T.A.; Östergård, P.R.J.2000 in ARS COMBINATORIA (Charles Babbage Research Centre)On sliding block puzzles
Karlemo, F.; Östergård, P.R.J.2000 in Journal of Combinatorial Mathematics and Combinatorial Computing (Charles Babbage Research Centre)Enumeration of 2-(12,3,2) designs
Östergård, P.R.J.2000 in AUSTRALASIAN JOURNAL OF COMBINATORICS (University of Queensland Press)Classification of binary/ternary one-error-correcting codes
Östergård, P.R.J.2000 in Discrete Mathematics (Elsevier)Classification of binary covering codes
Östergård, P.R.J.; Weakley, W.2000 in JOURNAL OF COMBINATORIAL DESIGNS (John Wiley and Sons Inc.)Computer search for small complete caps
Östergård, P.R.J.2000 in JOURNAL OF GEOMETRY (Birkhauser Verlag Basel)New linear codes with covering radius 2 and odd basis
Davydov, A.A.; Östergård, P.R.J.1999 in Designs, Codes and Cryptography (Birkhauser Verlag Basel)Asymptotic behavior of optimal circle packings in a square
Nurmela, K.; Östergård, Patric; aus dem Spring, R.1999 in Canadian Mathematical Bulletin (Birkhauser Verlag Basel)Covering t-sets with (t+2)-sets
Nurmela, K.; Östergård, P.1999 in DISCRETE APPLIED MATHEMATICS (Elsevier)More optimal packings of equal circles in a square
Nurmela, K.; Östergård, Patric1999 in Discrete & Computational Geometry (Elsevier)New coverings of t-sets with (t+1)-sets
Nurmela, K.; Östergård, P.1999 in Journal of Combinbatorial Designs (Elsevier)Optimal binary one-error-correcting codes of length 10 have 72 codewords
Östergård, P.R.J.; Baicheva, T.; Kolev, E.1999 in IEEE Transactions on information theory (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)New constructions for q-ary covering codes
Östergård, P.R.J.1999 in ARS COMBINATORIA (Charles Babbage Research Centre)Constructing covering codes with given automorphisms
Östergård, P.R.J.; Weakley, W.D.1999 in Designs, Codes and Cryptography (Charles Babbage Research Centre)Bounds on mixed binary/ternary codes
Brouwer, A.E.; Hämäläinen, H.O.; Östergård, P.R.J; Sloane, N.J.A1998 in IEEE Transactions on information theory (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)Greedy and heuristic algorithms for codes and colorings
Etzion, T.; Östergård, P.R.J.1998 in IEEE Transactions on information theory (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)ISSN: 1053-578XDense packings of congruent circles in a circle
Graham, R.; Lubachevsky, B.; Nurmela, K.J.; Östergård, P.R.J.1998 in Discrete Mathematics (Elsevier)Improved bounds for quaternary linear codes of dimension 6
Gulliver, T.A.; Östergård, P.R.J.1998 in Applicable Algebra in Engineering, Communications and Computing (Elsevier)On the structure of optimal error-correcting codes
Östergård, P.R.J.1998 in Discrete Mathematics (Elsevier)Ett cirkelpackningsproblem - eller: Hur man får flaskorna att rymmas i korgen
Östergård, P.R.J; Nurmela, K.J.1998 in Normat (Elsevier)New upper bounds for binary covering codes
Östergård, P.R.J.; Kaikkonen, M.K.1998 in Discrete Mathematics (Elsevier)Ternary Covering Codes derived from BCH codes
Cock, J.C.; Östergård, P.R.J.1997 in JOURNAL OF COMBINATORIAL THEORY SERIES A (Academic Press Inc.)Improved bounds for ternary linear codes of dimension 7
Gulliver, T.A.; Östergård, P.R.J.1997 in IEEE Transactions on information theory (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)Packing up to 50 equal circles in a square
Nurmela, K.J.; Östergård, P.R.J.1997 in Discrete & Computational Geometry (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)New constant weight codes from linear permutation groups
Nurmela, K.J.; Kaikkonen, M.K.; Östergård, P.R.J.1997 in IEEE Transactions on information theory (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)Constructing covering codes by tabu search
Östergård, P.R.J.1997 in JOURNAL OF COMBINATORIAL DESIGNS (John Wiley and Sons Inc.)A new table of binary/ternary mixed covering codes
Östergård, P.R.J.1997 in Designs, Codes and Cryptography (John Wiley and Sons Inc.)A coloring problem in Hamming spaces
Östergård, P.R.J.1997 in European Journal of Combinatorics (Academic Press Inc.)A combinatorial proof for the football pool problem for six matches
Östergård, Patric1996 in JOURNAL OF COMBINATORIAL THEORY SERIES A (Academic Press Inc.)New single-error-correcting codes
Östergård, Patric; Kaikkonen, M.K.1996 in IEEE Transactions on information theory (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)The football pool problem
Östergård, Patric1996 in Congressus Numerantium (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)Bounds for binary codes that are multiple coverings of the farthest-off points
Östergård, P.R.J.; Hämäläinen, H.O.; Honkala, I.S.; Litsyn, S.N.1995 in SIAM Journal of Discrete Mathematics (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)Om approximative lösningar till kombinatoriska optimeringsproblem
Östergård, P.1995 in Elementa (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)New multiple covering codes by tabu search
Östergård, P.R.J.1995 in The Australasian Journal of Combinatorics (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)Football pools---A game for mathematicians
Östergård, P.; Hämäläinen, H.; Honkala, I.; Litsyn, S.1995 in The American Mathematical Monthly (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)New Upper Bounds for the Football Pool Problem for 11 and 12 Matches
Östergård, P.1994 in JOURNAL OF COMBINATORIAL THEORY SERIES A (Academic Press Inc.)Upper Bounds for Covering Designs by Simulated Annealing
Nurmela, K.; Östergård, P.1993 in Congressus Numerantium (Academic Press Inc.)Further Results on (k,t)-subnormal Covering Codes
Östergård, P.1992 in IEEE Transactions on information theory (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)Book section, Chapters in research booksClassification of MDS codes over small alphabets
Kokkala, Janne I.; Krotov, Denis S.; Östergård, Patric R.J.2015 ISBN: 978-3-319-17295-8Computational methods in design theory
Gibbons, P.B.; Östergård, Patric Ralf Johan2007 Constructing combinatorial objects via cliques
Östergård, Patric2005 Code design
Honkala, I.S.; Östergård, P.R.J.1997 Optimal packings of equal circles in a square
Nurmela, K.J.; Östergård, Patric1996 On the Construction of Mixed Covering Codes
Östergård, P.1994 Conference proceedingsLCL problems on grids
Brandt, Sebastian; Hirvonen, Juho; Korhonen, Janne H.; Lempiäinen, Tuomo; Östergård, Patric R.J.; Purcell, Christopher; Rybicki, Joel; Suomela, Jukka; Uznański, Przemysław2017 ISBN: 9781450349925New lower bounds on error-correcting ternary, quaternary and quinary codes
Laaksonen, Antti; Östergård, Patric R.J.2017 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Springer Verlag)ISBN: 9783319662770ISSN: 0302-9743Algorithms for hard discrete problems
Östergård, Patric2005 There exist nonisomorphic STS (19) with equivalent point codes
Östergård, Patric2002 A stochastic search for a 2-(22,8,4) design utilizing linear codes
Östergård, Patric R.J.2001 Optimal packings of equal circles in a square
Nurmela, K.; Östergård, P.1999 New results on optimal error-correcting codes
Östergård, P.R.J.1999 A new algorithm for the maximum-weight clique problem
Östergård, P.R.J.1999 A Fast Algorithm for the maximum clique problem
Östergård, P.R.J.1999 Classification of binary covering codes
Östergård, P.R.J.; Weakley, W.D.1999 On binary/ternary error-correcting codes with minimum distance 4
Östergård, P.R.J.1999 A computer search for small complete caps
Davydov, A.A.; Östergård, P.R.J.1998 On perfect dominating sets in n-cubes
Östergård, P.R.J.; Weatley, W.O.1998 On the 2-domatic number of binary Hamming spaces
Östergård, P.R.J.1998 Ternary covering codes derived from BCH codes
Cock, J.; Östergård, P.1997 Improved bounds for ternary linear codes of dimension 7
Gulliver, T.A.; Östergård, P.R.J.1997 New covering designs with nontrivial automorphism groups
Nurmela, K.; Östergård, P.1997 New constant weight codes from linear permutation group
Nurmela, K.J.; Kaikkonen, K.; Östergård, P.R.J.1997 Towards Optimizing Code Generation by Domain-Sensitive Macro Covering t-sets with Abstracts Optimal Discrete Structures and Algorithms
Nurmela, K.; Östergård, P.J.1997 Solving Circle Packing Problems by Stochastic Optimization Methods
Nurmela, K.J.; Östergård, P.1995 Scientific books (monographs)
BookClassification Algorithms for Codes and Designs
Kaski, Petteri; Östergård, Patric R.J.2006 ISBN: 3-540-28990-9Publications intended for professional communities
Article in professional journalOm q-analogier
Östergård, Patric R.J.2014 in ARKHIMEDES (SPRINGER)ISSN: 0004-1920Steinerin kolmikkojärjestelmistä sudokuun
Haanpää, Harri; Östergård, Patric R.J.2006 in ARKHIMEDES (SPRINGER)Bounds and Constructions for ternary constant-composition codes
Svanström, M.; Östergård, P.R.J; Bogdanova, G.T.2002 in IEEE Transactions on information theory (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)Matemaatikon kaljakori ei kilise
Nurmela, Kari; Östergård, Patric1995 in Helsingin Sanomat (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)ISSN: 0355-2047Published development or research reportAlgorithms for Finding Maximum Transitive Subtournaments
Kiviluoto, Lasse; Östergård, Patric R.J; Vaskelainen, Vesa P.2010 The perfect binary one-error-correcting codes of length 15: Part II -- Properties
Östergård, Patric R.J; Pottonen, Olli; Phelps, Kevin T.2009 Sets in Abelian groups with distinct sums of pairs
Haanpää, Harri; Östergård, Patric R.J.2004 Further results on the covering radius of small codes
Kéri, G.; Östergård, P.R.J.2003 On the covering radius of small codes
Kéri, G.; Östergård, P.R.J.2003 Bounds for covering codes over large alphabets
Kéri, G.; Östergård, P.R.J.2003 Cliquer user's guide, version 1.0
Niskanen, Sampo; Östergård, Patric2003 Covering a Square with up to 30 Equal Circles
Nurmela, K.J.; Östergård, P.R.J.2000 Greedy and heuristic algorithms codes and colorings
Etzion, T.; Östergård, P.R.J.1997 Heuristic algorithms for constructing constant weight codes
Nurmela, K.J.; Kaikkonen, M.K.; Östergård, P.R.J.1996 Optimal packings of equal circles in a square
Nurmela, K.J.; Östergård, P.R.J.1996 Constructing Covering Designs by Simulated Annealing
Nurmela, K.; Östergård, P.1993 New Upper Bounds for Binary/Ternary Mixed Covering Codes
Östergård, P.; Hämäläinen, H.1993 Construction Methods for Covering Codes
Östergård, P.1993 Patents and invention disclosures
PatentSDH-signaalien kytkeminen TS'S'TS'S'T-kytkentäverkossa
Kasurinen, T.; Östergård, P.R.J.1997 Väylin laajennettu TST-arkkitehtuuri
Strandberg, O.; Östergård, P.R.J.1997 Audiovisual material, ICT software
ICT programs or applicationscliquer
Niskanen, S.; Östergård, P.R.J.2002
Classification of Cyclic Steiner Quadruple Systems
Total domination of grid graphs
Planar Hypohamiltonian Graphs on 40 Vertices
Constructing error-correcting binary codes using transitive permutation groups
New lower bounds for the Shannon capacity of odd cycles
Existence of q-analogs of Steiner systems
New Lower Bounds for Binary Constant-Dimension Subspace Codes
Algorithms for finding maximum transitive subtournaments
Further results on the classification of MDS codes
Non-existence of a ternary constant weight (16, 5, 15; 2048) diameter perfect code
Independent domination of grids
Permutation codes invariant under isometries
Enumeration of Steiner triple systems with subsystems,
On hypercube packings, blocking sets and a covering problem
Hypercube packings and their holes
On the Classification of MDS codes
Classification of Graeco-Latin cubes
Exhaustive search for snake-in-the-box codes
Bounds on the domination number of Kneser graphs
Large sets of t-designs over finite fields
COUNTING HAMILTONIAN CYCLES IN BIPARTITE GRAPHS
Switching in one-factorisations of complete graphs
The Mendelsohn Triple Systems of Order 13
A Note on Toeplitz' Conjecture
On the Maximum Length of Coil-in-the-Box Codes in Dimension 8
On the minimum size of 4-uniform hypergraphs without property B
Enumerating Cube Tilings
On the Shannon Capacity of Triangular Graphs
The quaternary complex Hadamard matrices of orders 10, 12 and 14
Enumerating Perfect Matchings in n-Cubes
On optimal binary codes with unbalanced coordinates, Applicable Algebra in Engineering
On triple systems and strongly regular graphs
Packing Costas arrays
Steiner triple systems satisfying the 4-vertex condition
Switching codes and designs
Computing the domination number of grid graphs
Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19
The number of Latin squares of order 11
The Cycle Switching Graph of the Steiner Triple Systems of Order 19 is Connected
On optimal binary one-error-correcting codes of lengths 2^{m-4} and 2^{m-3}
Classification of difference matrices over cyclic groups
Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes
Russian doll search for the Steiner triple covering problem
On the size of optimal three-error-correcting binary codes of length 16
Properties of the Steiner triple systems of order 19
Linear codes with covering radius 3
The nonexistence of a (K_6-e)-decomposition of the complete graph K_29
A census of one-factorizations of the complete 3-uniform hypergraph of order 9
Classification of starters
A tournament of order 14 with disjoint Banks and Slater sets
The perfect binary one-error-correcting codes of length 15 Part II-Properties
Classification of binary constant weight codes
Classification of the (0,2)-graphs of valency 8
There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations of K14
Classification of resolvable balanced incomplete block designs -- The unitals on 28 points
A catalogue of the Steiner triple systems of order 19
Sperner capacity of small digraphs
Reconstructing extended perfect binary one-error-correcting codes from their minimum distance graphs
The perfect binary one-error-correcting codes of length 15: Part I -- Classification
Small p-groups with full-rank factorization
There are exactly five biplanes with k = 11
Steiner triple systems of order 19 and 21 with subsystems of order 7
On the minimum size of binary codes with length 2R + 4 and covering radius R
There exists no Steiner system S(4,5,17)
Sets in Abelian groups with distinct sums of pairs
There exists no symmetric configuration with 33 points and line size 6
Further results on the covering radius of small codes
New uniquely decodable codes for the T-user binary adder channel with 3
Algorithms for the combinatorial best barbeque problem
There exist Steiner triple systems of order 15 that do not occur in a perfect binary one-error-correcting code
Elementary p-groups with the Rédei property
Classification of optimal binary self-orthogonal codes up to length 24
New constructions of optimal self-dual binary codes of length 54
The Steiner quadruple systems of order 16
The number of inequivalent (2R+3,7)R optimal covering codes
New lower bounds for asymmetric covering codes
Unidirectional covering codes
Classification of self-orthogonal codes over F3 and F4
Near-extremal formally self-dual even codes of lengths 24 and 32
One-factorizations of regular graphs of order 12
Bounds for covering codes over large alphabets
A new bound for the zero-error capacity region of the two-user binary adder channel
Two new four-error-correcting binary codes
Classification of directed and hybrid triple systems
New results on codes with covering radius 1 and minimum distance 2
An updated table of binary/ternary mixed covering codes
Binary optimal linear rate 1/2 codes
Sets in Zn with distinct sums of pairs
There exist nonisomorphic STS(19) with equivalent point codes
Miscellaneous classification results for 2-desings
The Steiner triple systems of order 19
Enumeration of balanced ternary designs
There exists no Hermitian self-dual quaternary [26,13,10]_4 code
On a hypercube coloring problem
Resolving the existence of full-rank tilings of binary Hamming spaces
On the nonexistence of bent Hamiltonian paths in the grid graph P3 x P5 x P5
Constructing asymmetric covering codes by tabu search
More c-Bhaskar Rao designs with small block size
An improved upper bound for the football pool problem for nine matches
Optimal linear rate ½ codes over F5 and F7
Optimal quaternary linear rate-1/2 codes of length
Classification of whist tournaments with up to 12 players
On the classification of self-dual codes over F5
Classification of resolvablr 2-(14,7,12) and 3-(14,7,5) designs
On the covering radius of small codes
Disproof of a conjecture on the existence of balanced optimal covering codes
Binary two-error-correcting codes are better than quaternary
A covering problem for tori
A census of small Petri nets
Classification of extremal formally self-dual even codes
Self-dual and maximal self-orthogonal codes over F_7
A fast algorithm for the maximum clique problem
Ternary constant weight codes
A 2-(22,8,4) design cannot have a 2-(10,4,4) subdesign
Classifying optimal ternary codes of length 5 and covering radius 1
A new lower bound for the football pool problem for six matches
Enumeration of 2-(9,3,\lambda) designs and theri resolutions
Bounds on codes over an alphabet of five elements
Error-correcting codes over an alphabet of four elements
Recursive constructions of complete caps
Linear codes with covering radius R=2,3 and codimension tR
Improved bounds for ternary linear codes of dimension 8 using tabu search
There exists no (15,5,4) RBIBD
On the size of optimal binary codes of length 9 and covering radius 1
A new algorithm for the maximum-weight clique problem
There are 270,474,142 nonisomorphic 2-(9,4,6) designs
Values of Domination Numbers of the Queen's Graph
On Saturating Sets in Small Projective Geometries
New Quaternary Linear Codes with Covering Radius 2
New binary linear codes
On sliding block puzzles
Enumeration of 2-(12,3,2) designs
Classification of binary/ternary one-error-correcting codes
Classification of binary covering codes
Computer search for small complete caps
New linear codes with covering radius 2 and odd basis
Asymptotic behavior of optimal circle packings in a square
Covering t-sets with (t+2)-sets
More optimal packings of equal circles in a square
New coverings of t-sets with (t+1)-sets
Optimal binary one-error-correcting codes of length 10 have 72 codewords
New constructions for q-ary covering codes
Constructing covering codes with given automorphisms
Bounds on mixed binary/ternary codes
Greedy and heuristic algorithms for codes and colorings
Dense packings of congruent circles in a circle
Improved bounds for quaternary linear codes of dimension 6
On the structure of optimal error-correcting codes
Ett cirkelpackningsproblem - eller: Hur man får flaskorna att rymmas i korgen
New upper bounds for binary covering codes
Ternary Covering Codes derived from BCH codes
Improved bounds for ternary linear codes of dimension 7
Packing up to 50 equal circles in a square
New constant weight codes from linear permutation groups
Constructing covering codes by tabu search
A new table of binary/ternary mixed covering codes
A coloring problem in Hamming spaces
A combinatorial proof for the football pool problem for six matches
New single-error-correcting codes
The football pool problem
Bounds for binary codes that are multiple coverings of the farthest-off points
Om approximative lösningar till kombinatoriska optimeringsproblem
New multiple covering codes by tabu search
Football pools---A game for mathematicians
New Upper Bounds for the Football Pool Problem for 11 and 12 Matches
Upper Bounds for Covering Designs by Simulated Annealing
Further Results on (k,t)-subnormal Covering Codes
Classification of MDS codes over small alphabets
Computational methods in design theory
Constructing combinatorial objects via cliques
Code design
Optimal packings of equal circles in a square
On the Construction of Mixed Covering Codes
Conference proceedingsLCL problems on grids
Brandt, Sebastian; Hirvonen, Juho; Korhonen, Janne H.; Lempiäinen, Tuomo; Östergård, Patric R.J.; Purcell, Christopher; Rybicki, Joel; Suomela, Jukka; Uznański, Przemysław2017 ISBN: 9781450349925New lower bounds on error-correcting ternary, quaternary and quinary codes
Laaksonen, Antti; Östergård, Patric R.J.2017 in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Springer Verlag)ISBN: 9783319662770ISSN: 0302-9743Algorithms for hard discrete problems
Östergård, Patric2005 There exist nonisomorphic STS (19) with equivalent point codes
Östergård, Patric2002 A stochastic search for a 2-(22,8,4) design utilizing linear codes
Östergård, Patric R.J.2001 Optimal packings of equal circles in a square
Nurmela, K.; Östergård, P.1999 New results on optimal error-correcting codes
Östergård, P.R.J.1999 A new algorithm for the maximum-weight clique problem
Östergård, P.R.J.1999 A Fast Algorithm for the maximum clique problem
Östergård, P.R.J.1999 Classification of binary covering codes
Östergård, P.R.J.; Weakley, W.D.1999 On binary/ternary error-correcting codes with minimum distance 4
Östergård, P.R.J.1999 A computer search for small complete caps
Davydov, A.A.; Östergård, P.R.J.1998 On perfect dominating sets in n-cubes
Östergård, P.R.J.; Weatley, W.O.1998 On the 2-domatic number of binary Hamming spaces
Östergård, P.R.J.1998 Ternary covering codes derived from BCH codes
Cock, J.; Östergård, P.1997 Improved bounds for ternary linear codes of dimension 7
Gulliver, T.A.; Östergård, P.R.J.1997 New covering designs with nontrivial automorphism groups
Nurmela, K.; Östergård, P.1997 New constant weight codes from linear permutation group
Nurmela, K.J.; Kaikkonen, K.; Östergård, P.R.J.1997 Towards Optimizing Code Generation by Domain-Sensitive Macro Covering t-sets with Abstracts Optimal Discrete Structures and Algorithms
Nurmela, K.; Östergård, P.J.1997 Solving Circle Packing Problems by Stochastic Optimization Methods
Nurmela, K.J.; Östergård, P.1995 Scientific books (monographs)
BookClassification Algorithms for Codes and Designs
Kaski, Petteri; Östergård, Patric R.J.2006 ISBN: 3-540-28990-9Publications intended for professional communities
Article in professional journalOm q-analogier
Östergård, Patric R.J.2014 in ARKHIMEDES (SPRINGER)ISSN: 0004-1920Steinerin kolmikkojärjestelmistä sudokuun
Haanpää, Harri; Östergård, Patric R.J.2006 in ARKHIMEDES (SPRINGER)Bounds and Constructions for ternary constant-composition codes
Svanström, M.; Östergård, P.R.J; Bogdanova, G.T.2002 in IEEE Transactions on information theory (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)Matemaatikon kaljakori ei kilise
Nurmela, Kari; Östergård, Patric1995 in Helsingin Sanomat (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)ISSN: 0355-2047Published development or research reportAlgorithms for Finding Maximum Transitive Subtournaments
Kiviluoto, Lasse; Östergård, Patric R.J; Vaskelainen, Vesa P.2010 The perfect binary one-error-correcting codes of length 15: Part II -- Properties
Östergård, Patric R.J; Pottonen, Olli; Phelps, Kevin T.2009 Sets in Abelian groups with distinct sums of pairs
Haanpää, Harri; Östergård, Patric R.J.2004 Further results on the covering radius of small codes
Kéri, G.; Östergård, P.R.J.2003 On the covering radius of small codes
Kéri, G.; Östergård, P.R.J.2003 Bounds for covering codes over large alphabets
Kéri, G.; Östergård, P.R.J.2003 Cliquer user's guide, version 1.0
Niskanen, Sampo; Östergård, Patric2003 Covering a Square with up to 30 Equal Circles
Nurmela, K.J.; Östergård, P.R.J.2000 Greedy and heuristic algorithms codes and colorings
Etzion, T.; Östergård, P.R.J.1997 Heuristic algorithms for constructing constant weight codes
Nurmela, K.J.; Kaikkonen, M.K.; Östergård, P.R.J.1996 Optimal packings of equal circles in a square
Nurmela, K.J.; Östergård, P.R.J.1996 Constructing Covering Designs by Simulated Annealing
Nurmela, K.; Östergård, P.1993 New Upper Bounds for Binary/Ternary Mixed Covering Codes
Östergård, P.; Hämäläinen, H.1993 Construction Methods for Covering Codes
Östergård, P.1993 Patents and invention disclosures
PatentSDH-signaalien kytkeminen TS'S'TS'S'T-kytkentäverkossa
Kasurinen, T.; Östergård, P.R.J.1997 Väylin laajennettu TST-arkkitehtuuri
Strandberg, O.; Östergård, P.R.J.1997 Audiovisual material, ICT software
ICT programs or applicationscliquer
Niskanen, S.; Östergård, P.R.J.2002
LCL problems on grids
New lower bounds on error-correcting ternary, quaternary and quinary codes
Algorithms for hard discrete problems
There exist nonisomorphic STS (19) with equivalent point codes
A stochastic search for a 2-(22,8,4) design utilizing linear codes
Optimal packings of equal circles in a square
New results on optimal error-correcting codes
A new algorithm for the maximum-weight clique problem
A Fast Algorithm for the maximum clique problem
Classification of binary covering codes
On binary/ternary error-correcting codes with minimum distance 4
A computer search for small complete caps
On perfect dominating sets in n-cubes
On the 2-domatic number of binary Hamming spaces
Ternary covering codes derived from BCH codes
Improved bounds for ternary linear codes of dimension 7
New covering designs with nontrivial automorphism groups
New constant weight codes from linear permutation group
Towards Optimizing Code Generation by Domain-Sensitive Macro Covering t-sets with Abstracts Optimal Discrete Structures and Algorithms
Solving Circle Packing Problems by Stochastic Optimization Methods
Classification Algorithms for Codes and Designs
Publications intended for professional communities
Article in professional journalOm q-analogier
Östergård, Patric R.J.2014 in ARKHIMEDES (SPRINGER)ISSN: 0004-1920Steinerin kolmikkojärjestelmistä sudokuun
Haanpää, Harri; Östergård, Patric R.J.2006 in ARKHIMEDES (SPRINGER)Bounds and Constructions for ternary constant-composition codes
Svanström, M.; Östergård, P.R.J; Bogdanova, G.T.2002 in IEEE Transactions on information theory (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)Matemaatikon kaljakori ei kilise
Nurmela, Kari; Östergård, Patric1995 in Helsingin Sanomat (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC)ISSN: 0355-2047Published development or research reportAlgorithms for Finding Maximum Transitive Subtournaments
Kiviluoto, Lasse; Östergård, Patric R.J; Vaskelainen, Vesa P.2010 The perfect binary one-error-correcting codes of length 15: Part II -- Properties
Östergård, Patric R.J; Pottonen, Olli; Phelps, Kevin T.2009 Sets in Abelian groups with distinct sums of pairs
Haanpää, Harri; Östergård, Patric R.J.2004 Further results on the covering radius of small codes
Kéri, G.; Östergård, P.R.J.2003 On the covering radius of small codes
Kéri, G.; Östergård, P.R.J.2003 Bounds for covering codes over large alphabets
Kéri, G.; Östergård, P.R.J.2003 Cliquer user's guide, version 1.0
Niskanen, Sampo; Östergård, Patric2003 Covering a Square with up to 30 Equal Circles
Nurmela, K.J.; Östergård, P.R.J.2000 Greedy and heuristic algorithms codes and colorings
Etzion, T.; Östergård, P.R.J.1997 Heuristic algorithms for constructing constant weight codes
Nurmela, K.J.; Kaikkonen, M.K.; Östergård, P.R.J.1996 Optimal packings of equal circles in a square
Nurmela, K.J.; Östergård, P.R.J.1996 Constructing Covering Designs by Simulated Annealing
Nurmela, K.; Östergård, P.1993 New Upper Bounds for Binary/Ternary Mixed Covering Codes
Östergård, P.; Hämäläinen, H.1993 Construction Methods for Covering Codes
Östergård, P.1993 Patents and invention disclosures
PatentSDH-signaalien kytkeminen TS'S'TS'S'T-kytkentäverkossa
Kasurinen, T.; Östergård, P.R.J.1997 Väylin laajennettu TST-arkkitehtuuri
Strandberg, O.; Östergård, P.R.J.1997 Audiovisual material, ICT software
ICT programs or applicationscliquer
Niskanen, S.; Östergård, P.R.J.2002
Om q-analogier
Steinerin kolmikkojärjestelmistä sudokuun
Bounds and Constructions for ternary constant-composition codes
Matemaatikon kaljakori ei kilise
Algorithms for Finding Maximum Transitive Subtournaments
The perfect binary one-error-correcting codes of length 15: Part II -- Properties
Sets in Abelian groups with distinct sums of pairs
Further results on the covering radius of small codes
On the covering radius of small codes
Bounds for covering codes over large alphabets
Cliquer user's guide, version 1.0
Covering a Square with up to 30 Equal Circles
Greedy and heuristic algorithms codes and colorings
Heuristic algorithms for constructing constant weight codes
Optimal packings of equal circles in a square
Constructing Covering Designs by Simulated Annealing
New Upper Bounds for Binary/Ternary Mixed Covering Codes
Construction Methods for Covering Codes
Patents and invention disclosures
PatentSDH-signaalien kytkeminen TS'S'TS'S'T-kytkentäverkossa
Kasurinen, T.; Östergård, P.R.J.1997 Väylin laajennettu TST-arkkitehtuuri
Strandberg, O.; Östergård, P.R.J.1997 Audiovisual material, ICT software
ICT programs or applicationscliquer
Niskanen, S.; Östergård, P.R.J.2002
SDH-signaalien kytkeminen TS'S'TS'S'T-kytkentäverkossa
Väylin laajennettu TST-arkkitehtuuri
cliquer
Read about executive education
Other experts
Eugenio Anessi Pessina
Curriculum Vitae SDA Fellow Degree in Management, Bocconi University, 1987 Ph.D. in Managerial Science and Applied Economics, The Wharton School, University of Pennsylvania, Philadelphia, 1997 Academic position and/or Professional activities Professor of Management, The Catholic University, R...
Richard Bardgett
Overview My research is broadly concerned with understanding the role of interactions between plant and soil communities in regulating the structure and function of terrestrial ecosystems, and their response to global change. A particular goal of my research is to develop a mechanistic and concep...
Romina Polley
Romina Polley is a partner based in the Cologne office practicing competition law for twenty years. Ms. Polley’s practice focuses on German and European cartel proceedings (including dawn raid assistance and applying for leniency), merger control, advice on monopolies, cooperation agreements, and...
Looking for an expert?
Contact us and we'll find the best option for you.