default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPatric R. J. Östergård
Person information
- affiliation: Aalto University, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[i17]József Balogh, The Nguyen, Patric R. J. Östergård, Ethan Patrick White, Michael C. Wigal:
Improving Uniquely Decodable Codes in Binary Adder Channels. CoRR abs/2312.11723 (2023)- [i16]Lucia Moura, Anamari Nakic, Patric R. J. Östergård, Alfred Wassermann, Charlene Weiß:
Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161). Dagstuhl Reports 13(4): 40-57 (2023) - 2022
- [j142]Jan Goedgebeur
, Patric R. J. Östergård:
Switching 3-edge-colorings of cubic graphs. Discret. Math. 345(9): 112963 (2022) - 2021
- [i15]Jan Goedgebeur, Patric R. J. Östergård:
Switching 3-edge-colorings of cubic graphs. CoRR abs/2105.01363 (2021) - 2020
- [j141]Ferenc Szöllösi, Patric R. J. Östergård:
Constructions of Maximum Few-Distance Sets in Euclidean Spaces. Electron. J. Comb. 27(1): 1 (2020) - [j140]Janne I. Kokkala, Patric R. J. Östergård:
Kirkman triple systems with subsystems. Discret. Math. 343(9): 111960 (2020) - [j139]Patric R. J. Östergård, Pekka H. J. Lampio, Ferenc Szöllösi:
Orderly generation of Butson Hadamard matrices. Math. Comput. 89(321): 313-331 (2020)
2010 – 2019
- 2019
- [j138]Antti Laaksonen, Patric R. J. Östergård:
New lower bounds on q-ary error-correcting codes. Cryptogr. Commun. 11(5): 881-889 (2019) - [j137]Patric R. J. Östergård:
The sextuply shortened binary Golay code is optimal. Des. Codes Cryptogr. 87(2-3): 341-347 (2019) - [j136]Patric R. J. Östergård, Antti Pöllänen:
New Results on Tripod Packings. Discret. Comput. Geom. 61(2): 271-284 (2019) - 2018
- [j135]Patric R. J. Östergård, William D. Weakley:
Switching of covering codes. Discret. Math. 341(6): 1778-1788 (2018) - [j134]Patric R. J. Östergård, William T. Paavola:
Mappings of Butson-type Hadamard matrices. Discret. Math. 341(9): 2387-2397 (2018) - [j133]Ferenc Szöllösi, Patric R. J. Östergård:
Enumeration of Seidel matrices. Eur. J. Comb. 69: 169-184 (2018) - [j132]Michael Braun, Patric R. J. Östergård, Alfred Wassermann:
New Lower Bounds for Binary Constant-Dimension Subspace Codes. Exp. Math. 27(2): 179-183 (2018) - [j131]Patric R. J. Östergård, Leonard H. Soicher:
There is no McLaughlin geometry. J. Comb. Theory A 155: 27-41 (2018) - [j130]Janne I. Kokkala, Patric R. J. Östergård:
The chromatic number of the square of the 8-cube. Math. Comput. 87(313): 2551-2561 (2018) - 2017
- [j129]Antti Laaksonen, Patric R. J. Östergård:
Constructing error-correcting binary codes using transitive permutation groups. Discret. Appl. Math. 233: 65-70 (2017) - [j128]K. Ashik Mathew, Patric R. J. Östergård:
New lower bounds for the Shannon capacity of odd cycles. Des. Codes Cryptogr. 84(1-2): 13-22 (2017) - [j127]Mohammadreza Jooyandeh, Brendan D. McKay, Patric R. J. Östergård, Ville H. Pettersson, Carol T. Zamfirescu:
Planar Hypohamiltonian Graphs on 40 Vertices. J. Graph Theory 84(2): 121-133 (2017) - [c5]Antti Laaksonen, Patric R. J. Östergård:
New Lower Bounds on Error-Correcting Ternary, Quaternary and Quinary Codes. ICMCTA 2017: 228-237 - [c4]Sebastian Brandt, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R. J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela, Przemyslaw Uznanski:
LCL Problems on Grids. PODC 2017: 101-110 - [i14]Sebastian Brandt, Juho Hirvonen, Janne H. Korhonen, Tuomo Lempiäinen, Patric R. J. Östergård, Christopher Purcell, Joel Rybicki, Jukka Suomela, Przemyslaw Uznanski:
LCL problems on grids. CoRR abs/1702.05456 (2017) - 2016
- [j126]Denis S. Krotov, Patric R. J. Östergård, Olli Pottonen:
Non-existence of a ternary constant weight (16, 5, 15;2048) diameter perfect code. Adv. Math. Commun. 10(2): 393-399 (2016) - [j125]Janne I. Kokkala, Patric R. J. Östergård:
Further results on the classification of MDS codes. Adv. Math. Commun. 10(3): 489-498 (2016) - [j124]Lasse Kiviluoto, Patric R. J. Östergård, Vesa P. Vaskelainen:
Algorithms for finding maximum transitive subtournaments. J. Comb. Optim. 31(2): 802-814 (2016) - [i13]Antti Laaksonen, Patric R. J. Östergård:
Constructing error-correcting binary codes using transitive permutation groups. CoRR abs/1604.06022 (2016) - [i12]Janne I. Kokkala, Patric R. J. Östergård:
The chromatic number of the square of the 8-cube. CoRR abs/1607.01605 (2016) - 2015
- [j123]Patric R. J. Östergård, Zehui Shao, Xiaodong Xu:
Bounds on the domination number of Kneser graphs. Ars Math. Contemp. 9(2): 187-195 (2015) - [j122]Ingo Janiszczak, Wolfgang Lempken, Patric R. J. Östergård, Reiner Staszewski:
Permutation codes invariant under isometries. Des. Codes Cryptogr. 75(3): 497-507 (2015) - [j121]Simon Crevals, Patric R. J. Östergård:
Independent domination of grids. Discret. Math. 338(8): 1379-1384 (2015) - [j120]Patric R. J. Östergård, Ville H. Pettersson:
Exhaustive Search for Snake-in-the-Box Codes. Graphs Comb. 31(4): 1019-1028 (2015) - [j119]K. Ashik Mathew, Patric R. J. Östergård:
On hypercube packings, blocking sets and a covering problem. Inf. Process. Lett. 115(2): 141-145 (2015) - [j118]Petteri Kaski, Patric R. J. Östergård, Alexandru Popa:
Enumeration of Steiner triple systems with subsystems. Math. Comput. 84(296): 3051-3067 (2015) - [j117]Janne I. Kokkala, Denis S. Krotov, Patric R. J. Östergård:
On the Classification of MDS Codes. IEEE Trans. Inf. Theory 61(12): 6485-6492 (2015) - [i11]K. Ashik Mathew, Patric R. J. Östergård:
New Lower Bounds for the Shannon Capacity of Odd Cycles. CoRR abs/1504.01472 (2015) - [i10]Janne I. Kokkala, Patric R. J. Östergård:
Further Results on the Classification of MDS Codes. CoRR abs/1504.06982 (2015) - [i9]Janne I. Kokkala, Patric R. J. Östergård:
A coloring of the square of the 8-cube with 13 colors. CoRR abs/1509.06913 (2015) - 2014
- [j116]Petteri Kaski, André de Souza Medeiros, Patric R. J. Östergård, Ian M. Wanless:
Switching in One-Factorisations of Complete Graphs. Electron. J. Comb. 21(2): 2 (2014) - [j115]Patric R. J. Östergård:
On the minimum size of 4-uniform hypergraphs without property B. Discret. Appl. Math. 163: 199-204 (2014) - [j114]Patric R. J. Östergård, Ville H. Pettersson:
On the maximum length of coil-in-the-box codes in dimension 8. Discret. Appl. Math. 179: 193-200 (2014) - [j113]Ville Pettersson, Helge A. Tverberg, Patric R. J. Östergård:
A Note on Toeplitz' Conjecture. Discret. Comput. Geom. 51(3): 722-728 (2014) - [j112]Michael Braun, Axel Kohnert, Patric R. J. Östergård, Alfred Wassermann:
Large sets of t-designs over finite fields. J. Comb. Theory A 124: 195-202 (2014) - [j111]Harri Haanpää, Patric R. J. Östergård:
Counting Hamiltonian cycles in bipartite graphs. Math. Comput. 83(286): 979-995 (2014) - [c3]Janne I. Kokkala, Denis S. Krotov, Patric R. J. Östergård:
Classification of MDS Codes over Small Alphabets. ICMCTA 2014: 227-235 - [i8]Denis S. Krotov, Patric R. J. Östergård, Olli Pottonen:
Non-existence of a ternary constant weight $(16, 5, 15; 2048)$ diameter perfect code. CoRR abs/1408.6927 (2014) - [i7]Janne I. Kokkala, Denis S. Krotov, Patric R. J. Östergård:
On the Classification of MDS Codes. CoRR abs/1411.5822 (2014) - 2013
- [j110]Patric R. J. Östergård:
On optimal binary codes with unbalanced coordinates. Appl. Algebra Eng. Commun. Comput. 24(3-4): 197-200 (2013) - [j109]Ashik Mathew Kizhakkepallathu, Patric R. J. Östergård, Alexandru Popa:
On the Shannon Capacity of Triangular Graphs. Electron. J. Comb. 20(2): 27 (2013) - [j108]K. Ashik Mathew, Patric R. J. Östergård, Alexandru Popa:
Enumerating Cube Tilings. Discret. Comput. Geom. 50(4): 1112-1122 (2013) - [j107]Pekka H. J. Lampio, Ferenc Szöllösi, Patric R. J. Östergård:
The quaternary complex Hadamard matrices of orders 10, 12, and 14. Discret. Math. 313(2): 189-206 (2013) - [j106]Patric R. J. Östergård, Ville Pettersson:
Enumerating Perfect Matchings in n-Cubes. Order 30(3): 821-835 (2013) - [i6]Mohammadreza Jooyandeh, Brendan D. McKay, Patric R. J. Östergård, Ville Pettersson, Carol T. Zamfirescu:
Planar Hypohamiltonian Graphs on 40 Vertices. CoRR abs/1302.2698 (2013) - 2012
- [j105]Petteri Kaski, Mahdad Khatirinejad, Patric R. J. Östergård:
Steiner triple systems satisfying the 4-vertex condition. Des. Codes Cryptogr. 62(3): 323-330 (2012) - [j104]Patric R. J. Östergård:
Switching codes and designs. Discret. Math. 312(3): 621-632 (2012) - [j103]Majid Behbahani, Clement W. H. Lam, Patric R. J. Östergård:
On triple systems and strongly regular graphs. J. Comb. Theory A 119(7): 1414-1426 (2012) - 2011
- [j102]Samu Alanko, Simon Crevals, Anton Isopoussu, Patric R. J. Östergård, Ville Pettersson:
Computing the Domination Number of Grid Graphs. Electron. J. Comb. 18(1) (2011) - [j101]Patric R. J. Östergård, Olli Pottonen:
Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes. Des. Codes Cryptogr. 59(1-3): 281-285 (2011) - [j100]Charles J. Colbourn, Petteri Kaski, Patric R. J. Östergård, David A. Pike, Olli Pottonen:
Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19. Discret. Math. 311(10-11): 827-834 (2011) - [j99]Petteri Kaski, Veli Mäkinen, Patric R. J. Östergård:
The Cycle Switching Graph of the Steiner Triple Systems of Order 19 is Connected. Graphs Comb. 27(4): 539-546 (2011) - [j98]Alexander Hulpke, Petteri Kaski, Patric R. J. Östergård:
The number of Latin squares of order 11. Math. Comput. 80(274): 1197-1219 (2011) - [j97]Patric R. J. Östergård, Vesa P. Vaskelainen:
Russian doll search for the Steiner triple covering problem. Optim. Lett. 5(4): 631-638 (2011) - [j96]Denis S. Krotov, Patric R. J. Östergård, Olli Pottonen:
On Optimal Binary One-Error-Correcting Codes of Lengths 2m-4 and 2m-3. IEEE Trans. Inf. Theory 57(10): 6771-6779 (2011) - [j95]Patric R. J. Östergård:
On the Size of Optimal Three-Error-Correcting Binary Codes of Length 16. IEEE Trans. Inf. Theory 57(10): 6824-6826 (2011) - [i5]Denis S. Krotov, Patric R. J. Östergård, Olli Pottonen:
On Optimal Binary One-Error-Correcting Codes of Lengths $2^m-4$ and $2^m-3$. CoRR abs/1104.4013 (2011) - 2010
- [j94]Mahdad Khatirinejad, Patric R. J. Östergård:
A census of one-factorizations of the complete 3-uniform hypergraph of order 9. Australas. J Comb. 47: 239-246 (2010) - [j93]Charles J. Colbourn, Anthony D. Forbes, Mike J. Grannell, Terry S. Griggs, Petteri Kaski, Patric R. J. Östergård, David A. Pike, Olli Pottonen:
Properties of the Steiner Triple Systems of Order 19. Electron. J. Comb. 17(1) (2010) - [j92]Patric R. J. Östergård, Vesa P. Vaskelainen:
A tournament of order 14 with disjoint Banks and Slater sets. Discret. Appl. Math. 158(5): 588-591 (2010) - [j91]Alexander A. Davydov, Patric R. J. Östergård:
Linear codes with covering radius 3. Des. Codes Cryptogr. 54(3): 253-271 (2010) - [j90]Patric R. J. Östergård, Olli Pottonen, Kevin T. Phelps:
The perfect binary one-error-correcting codes of length 15: part II-properties. IEEE Trans. Inf. Theory 56(6): 2571-2582 (2010) - [j89]Patric R. J. Östergård:
Classification of binary constant weight codes. IEEE Trans. Inf. Theory 56(8): 3779-3785 (2010)
2000 – 2009
- 2009
- [j88]Lasse Kiviluoto, Patric R. J. Östergård, Vesa P. Vaskelainen:
Sperner capacity of small digraphs. Adv. Math. Commun. 3(2): 125-133 (2009) - [j87]Andries E. Brouwer, Patric R. J. Östergård:
Classification of the (0, 2)-graphs of valency 8. Discret. Math. 309(3): 532-547 (2009) - [j86]Ivan Yu. Mogilnykh, Patric R. J. Östergård, Olli Pottonen, Faina I. Solov'eva:
Reconstructing extended perfect binary one-error-correcting codes from their minimum distance graphs. IEEE Trans. Inf. Theory 55(6): 2622-2625 (2009) - [j85]Patric R. J. Östergård, Olli Pottonen:
The perfect binary one-error-correcting codes of length 15: part I-classification. IEEE Trans. Inf. Theory 55(10): 4657-4660 (2009) - [i4]Patric R. J. Östergård, Olli Pottonen, Kevin T. Phelps:
The Perfect Binary One-Error-Correcting Codes of Length 15: Part II--Properties. CoRR abs/0903.2749 (2009) - [i3]Patric R. J. Östergård, Olli Pottonen:
Two Optimal One-Error-Correcting Codes of Length 13 That Are Not Doubly Shortened Perfect Codes. CoRR abs/0909.2526 (2009) - 2008
- [j84]Gerzson Kéri, Patric R. J. Östergård:
On the minimum size of binary codes with length 2 R + 4 and covering radius R. Des. Codes Cryptogr. 48(2): 165-169 (2008) - [j83]Petteri Kaski, Patric R. J. Östergård, Svetlana Topalova, Rosen Zlatarski:
Steiner triple systems of order 19 and 21 with subsystems of order 7. Discret. Math. 308(13): 2732-2741 (2008) - [j82]Harri Haanpää, Patric R. J. Östergård, Sándor Szabó:
Small P-Groups with Full-Rank Factorization. Int. J. Algebra Comput. 18(6): 1019-1034 (2008) - [j81]Patric R. J. Östergård, Olli Pottonen:
There exists no Steiner system S(4, 5, 17). J. Comb. Theory A 115(8): 1570-1573 (2008) - [j80]Patric R. J. Östergård:
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. Oper. Res. Lett. 36(2): 277-278 (2008) - [i2]Patric R. J. Östergård, Olli Pottonen:
The Perfect Binary One-Error-Correcting Codes of Length 15: Part I--Classification. CoRR abs/0806.2513 (2008) - [i1]Ivan Yu. Mogilnykh, Patric R. J. Östergård, Olli Pottonen, Faina I. Solov'eva:
Reconstructing Extended Perfect Binary One-Error-Correcting Codes from Their Minimum Distance Graphs. CoRR abs/0810.5633 (2008) - 2007
- [j79]Petteri Kaski, Patric R. J. Östergård:
There exists no symmetric configuration with 33 points and line size 6. Australas. J Comb. 38: 273-278 (2007) - [j78]Gerzson Kéri, Patric R. J. Östergård:
Further results on the covering radius of small codes. Discret. Math. 307(1): 69-77 (2007) - [j77]Patric R. J. Östergård, Sándor Szabó:
Elementary P-Groups with the RÉdei Property. Int. J. Algebra Comput. 17(1): 171-178 (2007) - [j76]Lasse Kiviluoto, Patric R. J. Östergård:
New Uniquely Decodable Codes for the T-User Binary Adder Channel With 3<=T<=5. IEEE Trans. Inf. Theory 53(3): 1219-1220 (2007) - 2006
- [j75]Stefka Bouyuklieva, Patric R. J. Östergård:
New constructions of optimal self-dual binary codes of length 54. Des. Codes Cryptogr. 41(1): 101-109 (2006) - [j74]Patric R. J. Östergård, Petteri Kaski:
There are exactly five biplanes with k=11. Electron. Notes Discret. Math. 27: 75 (2006) - [j73]Petteri Kaski, Patric R. J. Östergård, Olli Pottonen:
The Steiner quadruple systems of order 16. J. Comb. Theory A 113(8): 1764-1770 (2006) - [j72]Patric R. J. Östergård, Esa Antero Seuranen:
Unidirectional covering codes. IEEE Trans. Inf. Theory 52(1): 336-340 (2006) - 2005
- [j71]Petteri Kaski, Patric R. J. Östergård:
One-Factorizations of Regular Graphs of Order 12. Electron. J. Comb. 12 (2005) - [j70]Patric R. J. Östergård, Jörn Quistorff, Alfred Wassermann:
New Results on Codes with Covering Radius 1 and Minimum Distance 2. Des. Codes Cryptogr. 35(2): 241-250 (2005) - [j69]Patric R. J. Östergård:
Two New Four-Error-Correcting Binary Codes. Des. Codes Cryptogr. 36(3): 327-329 (2005) - [j68]Gerzson Kéri, Patric R. J. Östergård:
Bounds for Covering Codes over Large Alphabets. Des. Codes Cryptogr. 37(1): 45-60 (2005) - [j67]T. Aaron Gulliver, Masaaki Harada, Takuji Nishimura, Patric R. J. Östergård:
Near-Extremal Formally Self-Dual Even Codes of Lengths 24 and 32. Des. Codes Cryptogr. 37(3): 465-471 (2005) - [j66]Iliya Bouyukliev, Patric R. J. Östergård:
Classification of Self-Orthogonal Codes over F3 and F4. SIAM J. Discret. Math. 19(2): 363-370 (2005) - [j65]M. Mattas, Patric R. J. Östergård:
A New Bound for the Zero-Error Capacity Region of the Two-User Binary Adder Channel. IEEE Trans. Inf. Theory 51(9): 3289-3291 (2005) - [c2]Patric R. J. Östergård:
Constructing combinatorial objects via cliques. BCC 2005: 57-82 - 2004
- [j64]Harri Haanpää, Antti Huima, Patric R. J. Östergård:
Sets in Z nwith distinct sums of pairs. Discret. Appl. Math. 138(1-2): 99-106 (2004) - [j63]Petteri Kaski, Patric R. J. Östergård:
Enumeration of balanced ternary designs. Discret. Appl. Math. 138(1-2): 133-141 (2004) - [j62]Petteri Kaski, Patric R. J. Östergård:
Miscellaneous classification results for 2-designs. Discret. Math. 280(1-3): 65-75 (2004) - [j61]T. Aaron Gulliver, Patric R. J. Östergård:
Binary optimal linear rate 1/2 codes. Discret. Math. 283(1-3): 255-261 (2004) - [j60]Patric R. J. Östergård:
On a hypercube coloring problem. J. Comb. Theory A 108(2): 199-204 (2004) - [j59]Petteri Kaski, Patric R. J. Östergård:
The Steiner triple systems of order 19. Math. Comput. 73(248): 2075-2092 (2004) - [j58]Patric R. J. Östergård, Alexander Vardy:
Resolving the Existence of Full-Rank Tilings of Binary Hamming Spaces. SIAM J. Discret. Math. 18(2): 382-387 (2004) - [j57]Patric R. J. Östergård:
There exists no Hermitian self-dual quaternary [26, 13, 10]4 code. IEEE Trans. Inf. Theory 50(12): 3316-3317 (2004) - 2003
- [j56]Patric R. J. Östergård:
Binary Two-Error-Correcting Codes are Better than Quaternary. Appl. Algebra Eng. Commun. Comput. 14(2): 89-96 (2003) - [j55]Harri Haanpää, Patric R. J. Östergård:
Classification of whist tournaments with up to 12 players. Discret. Appl. Math. 129(2-3): 399-407 (2003) - [j54]Dameng Deng, Malcolm Greig, Patric R. J. Östergård:
More c-Bhaskar Rao designs with small block size. Discret. Math. 261(1-3): 189-208 (2003) - [j53]T. Aaron Gulliver, Patric R. J. Östergård, Nikolai Senkevitch:
Optimal linear rate 1/2 codes over F5 and F2. Discret. Math. 265(1-3): 59-70 (2003) - [j52]Masaaki Harada, Patric R. J. Östergård:
On the Classification of Self-Dual Codes over F5. Graphs Comb. 19(2): 203-214 (2003) - [j51]Franco Di Pasquale, Patric R. J. Östergård:
An improved upper bound for the football pool problem for nine matches. J. Comb. Theory A 102(1): 204-206 (2003) - [j50]Patric R. J. Östergård:
Disproof of a conjecture on the existence of balanced optimal covering codes. IEEE Trans. Inf. Theory 49(2): 487-488 (2003) - [j49]T. Aaron Gulliver, Patric R. J. Östergård, Nikolai Senkevitch:
Optimal quaternary linear rate-1/2 codes of length <18. IEEE Trans. Inf. Theory 49(6): 1540-1543 (2003) - 2002
- [j48]Patric R. J. Östergård, Mattias Svanström:
Ternary Constant Weight Codes. Electron. J. Comb. 9(1) (2002) - [j47]Patric R. J. Östergård:
A fast algorithm for the maximum clique problem. Discret. Appl. Math. 120(1-3): 197-207 (2002) - [j46]Patric R. J. Östergård, Petteri Kaski:
Enumeration of 2-(9, 3, lambda) Designs and Their Resolutions. Des. Codes Cryptogr. 27(1-2): 131-137 (2002) - [j45]Patric R. J. Östergård:
A 2-(22, 8, 4) Design Cannot Have a 2-(10, 4, 4) Subdesign. Des. Codes Cryptogr. 27(3): 257-260 (2002) - [j44]Patric R. J. Östergård:
Classifying Subspaces of Hamming Spaces. Des. Codes Cryptogr. 27(3): 297-305 (2002) - [j43]Masaaki Harada, Patric R. J. Östergård:
Self-dual and maximal self-orthogonal codes over F7. Discret. Math. 256(1-2): 471-477 (2002) - [j42]Masaaki Harada, Patric R. J. Östergård:
Classification of Extremal Formally Self-Dual Even Codes of Length 22. Graphs Comb. 18(3): 507-516 (2002) - [j41]Patric R. J. Östergård, Alfred Wassermann:
A New Lower Bound for the Football Pool Problem for Six Matches. J. Comb. Theory A 99(1): 175-179 (2002) - [j40]Mattias Svanström, Patric R. J. Östergård, Galina T. Bogdanova:
Bounds and constructions for ternary constant-composition codes. IEEE Trans. Inf. Theory 48(1): 101-111 (2002) - 2001
- [j39]Patric R. J. Östergård, William D. Weakley:
Values of Domination Numbers of the Queen's Graph. Electron. J. Comb. 8(1) (2001) - [j38]Galina T. Bogdanova, Andries E. Brouwer, Stoyan N. Kapralov, Patric R. J. Östergård:
Error-Correcting Codes over an Alphabet of Four Elements. Des. Codes Cryptogr. 23(3): 333-342 (2001) - [j37]Galina T. Bogdanova, Patric R. J. Östergård:
Bounds on codes over an alphabet of five elements. Discret. Math. 240(1-3): 13-19 (2001) - [j36]T. Aaron Gulliver, Patric R. J. Östergård:
Improved Bounds for Ternary Linear Codes of Dimension 8 Using Tabu Search. J. Heuristics 7(1): 37-46 (2001) - [j35]Patric R. J. Östergård:
A New Algorithm for the Maximum-Weight Clique Problem. Nord. J. Comput. 8(4): 424-436 (2001) - [j34]Alexander A. Davydov, Patric R. J. Östergård:
Linear codes with covering radius R = 2, 3 and codimension tR. IEEE Trans. Inf. Theory 47(1): 416-421 (2001) - [j33]Patric R. J. Östergård, Uri Blass:
On the size of optimal binary codes of length 9 and covering radius 1. IEEE Trans. Inf. Theory 47(6): 2556-2557 (2001) - 2000
- [j32]Patric R. J. Östergård:
Enumeration of 2-(12, 3, 2) designs. Australas. J Comb. 22: 227-232 (2000) - [j31]T. Aaron Gulliver, Patric R. J. Östergård:
New Binary Linear Codes. Ars Comb. 56 (2000) - [j30]Patric R. J. Östergård:
Classification of binary/ternary one-error-correcting codes. Discret. Math. 223(1-3): 253-262 (2000) - [j29]Alexander A. Davydov, Patric R. J. Östergård:
On Saturating Sets in Small Projective Geometries. Eur. J. Comb. 21(5): 563-570 (2000)
1990 – 1999
- 1999
- [j28]Patric R. J. Östergård:
New Constructions for q-ary Covering Codes. Ars Comb. 52 (1999) - [j27]Kari J. Nurmela, Patric R. J. Östergård:
Covering t-sets with (t+2)-sets. Discret. Appl. Math. 95(1-3): 425-437 (1999) - [j26]Alexander A. Davydov, Patric R. J. Östergård:
New Linear Codes with Covering Radius 2 and Odd Basis. Des. Codes Cryptogr. 16(1): 29-39 (1999) - [j25]Patric R. J. Östergård, William D. Weakley:
Constructing Covering Codes with Given Automorphisms. Des. Codes Cryptogr. 16(1): 65-73 (1999) - [j24]Kari J. Nurmela, Patric R. J. Östergård:
More Optimal Packings of Equal Circles in a Square. Discret. Comput. Geom. 22(3): 439-457 (1999) - [j23]Patric R. J. Östergård:
A New Algorithm for the Maximum-Weight Clique Problem. Electron. Notes Discret. Math. 3: 153-156 (1999) - [j22]Patric R. J. Östergård, Tsonka Stefanova Baicheva, Emil Kolev:
Optimal Binary One-Error-Correcting Codes of Length 10 Have 72 Codewords. IEEE Trans. Inf. Theory 45(4): 1229-1231 (1999) - [c1]Patric R. J. Östergård:
On Binary/Ternary Error-Correcting Codes with Minimum Distance 4. AAECC 1999: 472-481 - 1998
- [j21]T. Aaron Gulliver, Patric R. J. Östergård:
Improved Bounds for Quaternary Linear Codes of Dimension 6. Appl. Algebra Eng. Commun. Comput. 9(2): 153-159 (1998) - [j20]Patric R. J. Östergård, Markku K. Kaikkonen:
New upper bounds for binary covering codes. Discret. Math. 178(1-3): 165-179 (1998) - [j19]Patric R. J. Östergård:
On the structure of optimal error-correcting codes. Discret. Math. 179(1-3): 285-287 (1998) - [j18]Ronald L. Graham, Boris D. Lubachevsky, Kari J. Nurmela, Patric R. J. Östergård:
Dense packings of congruent circles in a circle. Discret. Math. 181(1-3): 139-154 (1998) - [j17]Andries E. Brouwer, Heikki O. Hämäläinen, Patric R. J. Östergård, Neil J. A. Sloane:
Bounds on Mixed Binary/Ternary Codes. IEEE Trans. Inf. Theory 44(1): 140-161 (1998) - [j16]Tuvi Etzion, Patric R. J. Östergård:
Greedy and Heuristic Algorithms for Codes and Colorings. IEEE Trans. Inf. Theory 44(1): 382-388 (1998) - 1997
- [j15]Patric R. J. Östergård, Heikki O. Hämäläinen:
A New Table of Binary/Ternary Mixed Covering Codes. Des. Codes Cryptogr. 11(2): 151-178 (1997) - [j14]Kari J. Nurmela, Patric R. J. Östergård:
Packing up to 50 Equal Circles in a Square. Discret. Comput. Geom. 18(1): 111-120 (1997) - [j13]Patric R. J. Östergård:
A Coloring Problem in Hamming Spaces. Eur. J. Comb. 18(3): 303-309 (1997) - [j12]John C. Cock, Patric R. J. Östergård:
Ternary Covering Codes Derived from BCH Codes. J. Comb. Theory A 80(2): 283-289 (1997) - [j11]T. Aaron Gulliver, Patric R. J. Östergård:
Improved bounds for ternary linear codes of dimension 7. IEEE Trans. Inf. Theory 43(4): 1377-1381 (1997) - [j10]Kari J. Nurmela, Markku K. Kaikkonen, Patric R. J. Östergård:
New constant weight codes from linear permutation groups. IEEE Trans. Inf. Theory 43(5): 1623-1630 (1997) - 1996
- [j9]Patric R. J. Östergård:
A Combinatorial Proof for the Football Pool Problem for Six Matches. J. Comb. Theory A 76(1): 160-163 (1996) - [j8]Patric R. J. Östergård, Markku K. Kaikkonen:
New single-error-correcting codes. IEEE Trans. Inf. Theory 42(4): 1261-1262 (1996) - 1995
- [j7]Patric R. J. Östergård:
New multiple covering codes by tabu search. Australas. J Comb. 12: 145-156 (1995) - [j6]Heikki O. Hämäläinen, Iiro S. Honkala, Simon Litsyn, Patric R. J. Östergård:
Bounds for Binary Codes That Are Multiple Coverings of the Farthest-Off Points. SIAM J. Discret. Math. 8(2): 196-207 (1995) - 1994
- [j5]Patric R. J. Östergård:
New Upper Bounds for the Football Pool Problem for 11 and 12 Matches. J. Comb. Theory A 67(2): 161-168 (1994) - 1992
- [j4]Patric R. J. Östergård:
Further results on (k, t)-subnormal covering codes. IEEE Trans. Inf. Theory 38(1): 206-210 (1992) - 1991
- [j3]Patric R. J. Östergård:
A new binary code of length 10 and covering radius 1. IEEE Trans. Inf. Theory 37(1): 179-180 (1991) - [j2]Patric R. J. Östergård:
Upper bounds for q-ary covering codes. IEEE Trans. Inf. Theory 37(3): 660-664 (1991) - [j1]Patric R. J. Östergård:
Correction to 'Upper Bounds for q-ary Covering Codes'. IEEE Trans. Inf. Theory 37(6): 1738- (1991)
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-08-05 21:20 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:
