| 2009 |
|---|
| 85 | EE | 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) |
| 2008 |
|---|
| 84 | EE | 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) |
| 83 | EE | 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 Cryptography 48(2): 165-169 (2008) |
| 82 | EE | Petteri Kaski,
Patric R. J. Östergård,
Svetlana Topalova,
Rosen Zlatarski:
Steiner triple systems of order 19 and 21 with subsystems of order 7.
Discrete Mathematics 308(13): 2732-2741 (2008) |
| 81 | EE | Harri Haanpää,
Patric R. J. Östergård,
Sándor Szabó:
Small P-Groups with Full-Rank Factorization.
IJAC 18(6): 1019-1034 (2008) |
| 80 | EE | Patric R. J. Östergård,
Olli Pottonen:
There exists no Steiner system S(4, 5, 17).
J. Comb. Theory, Ser. A 115(8): 1570-1573 (2008) |
| 79 | EE | 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) |
| 2007 |
|---|
| 78 | EE | Gerzson Kéri,
Patric R. J. Östergård:
Further results on the covering radius of small codes.
Discrete Mathematics 307(1): 69-77 (2007) |
| 77 | EE | Lasse Kiviluoto,
Patric R. J. Östergård:
New Uniquely Decodable Codes for the T-User Binary Adder Channel With 3<=T<=5.
IEEE Transactions on Information Theory 53(3): 1219-1220 (2007) |
| 76 | EE | Patric R. J. Östergård,
Sándor Szabó:
Elementary P-Groups with the RÉdei Property.
IJAC 17(1): 171-178 (2007) |
| 2006 |
|---|
| 75 | EE | Stefka Bouyuklieva,
Patric R. J. Östergård:
New constructions of optimal self-dual binary codes of length 54.
Des. Codes Cryptography 41(1): 101-109 (2006) |
| 74 | EE | Patric R. J. Östergård,
Petteri Kaski:
There are exactly five biplanes with k=11.
Electronic Notes in Discrete Mathematics 27: 75 (2006) |
| 73 | EE | Patric R. J. Östergård,
Esa Antero Seuranen:
Unidirectional covering codes.
IEEE Transactions on Information Theory 52(1): 336-340 (2006) |
| 72 | EE | Petteri Kaski,
Patric R. J. Östergård,
Olli Pottonen:
The Steiner quadruple systems of order 16.
J. Comb. Theory, Ser. A 113(8): 1764-1770 (2006) |
| 2005 |
|---|
| 71 | | Patric R. J. Östergård:
Constructing combinatorial objects via cliques.
Surveys in Combinatorics 2005: 57-82 |
| 70 | EE | Patric R. J. Östergård,
Jörn Quistorff,
Alfred Wassermann:
New Results on Codes with Covering Radius 1 and Minimum Distance 2.
Des. Codes Cryptography 35(2): 241-250 (2005) |
| 69 | EE | Patric R. J. Östergård:
Two New Four-Error-Correcting Binary Codes.
Des. Codes Cryptography 36(3): 327-329 (2005) |
| 68 | EE | Gerzson Kéri,
Patric R. J. Östergård:
Bounds for Covering Codes over Large Alphabets.
Des. Codes Cryptography 37(1): 45-60 (2005) |
| 67 | EE | 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 Cryptography 37(3): 465-471 (2005) |
| 66 | EE | Petteri Kaski,
Patric R. J. Östergård:
One-Factorizations of Regular Graphs of Order 12.
Electr. J. Comb. 12: (2005) |
| 65 | EE | M. Mattas,
Patric R. J. Östergård:
A New Bound for the Zero-Error Capacity Region of the Two-User Binary Adder Channel.
IEEE Transactions on Information Theory 51(9): 3289-3291 (2005) |
| 64 | EE | Iliya Bouyukliev,
Patric R. J. Östergård:
Classification of Self-Orthogonal Codes over F3 and F4.
SIAM J. Discrete Math. 19(2): 363-370 (2005) |
| 2004 |
|---|
| 63 | EE | Petteri Kaski,
Patric R. J. Östergård:
Enumeration of balanced ternary designs.
Discrete Applied Mathematics 138(1-2): 133-141 (2004) |
| 62 | EE | Harri Haanpää,
Antti Huima,
Patric R. J. Östergård:
Sets in Z nwith distinct sums of pairs.
Discrete Applied Mathematics 138(1-2): 99-106 (2004) |
| 61 | EE | Petteri Kaski,
Patric R. J. Östergård:
Miscellaneous classification results for 2-designs.
Discrete Mathematics 280(1-3): 65-75 (2004) |
| 60 | EE | T. Aaron Gulliver,
Patric R. J. Östergård:
Binary optimal linear rate 1/2 codes.
Discrete Mathematics 283(1-3): 255-261 (2004) |
| 59 | EE | Patric R. J. Östergård:
There exists no Hermitian self-dual quaternary [26, 13, 10]/sub 4/ code.
IEEE Transactions on Information Theory 50(12): 3316-3317 (2004) |
| 58 | EE | Patric R. J. Östergård:
On a hypercube coloring problem.
J. Comb. Theory, Ser. A 108(2): 199-204 (2004) |
| 57 | | Petteri Kaski,
Patric R. J. Östergård:
The Steiner triple systems of order 19.
Math. Comput. 73(248): 2075-2092 (2004) |
| 56 | EE | Patric R. J. Östergård,
Alexander Vardy:
Resolving the Existence of Full-Rank Tilings of Binary Hamming Spaces.
SIAM J. Discrete Math. 18(2): 382-387 (2004) |
| 2003 |
|---|
| 55 | EE | Patric R. J. Östergård:
Binary Two-Error-Correcting Codes are Better than Quaternary.
Appl. Algebra Eng. Commun. Comput. 14(2): 89-96 (2003) |
| 54 | EE | Harri Haanpää,
Patric R. J. Östergård:
Classification of whist tournaments with up to 12 players.
Discrete Applied Mathematics 129(2-3): 399-407 (2003) |
| 53 | EE | Dameng Deng,
Malcolm Greig,
Patric R. J. Östergård:
More c-Bhaskar Rao designs with small block size.
Discrete Mathematics 261(1-3): 189-208 (2003) |
| 52 | EE | T. Aaron Gulliver,
Patric R. J. Östergård,
Nikolai Senkevitch:
Optimal linear rate 1/2 codes over F5 and F2.
Discrete Mathematics 265(1-3): 59-70 (2003) |
| 51 | EE | Masaaki Harada,
Patric R. J. Östergård:
On the Classification of Self-Dual Codes over F5.
Graphs and Combinatorics 19(2): 203-214 (2003) |
| 50 | | Patric R. J. Östergård:
Disproof of a conjecture on the existence of balanced optimal covering codes.
IEEE Transactions on Information Theory 49(2): 487-488 (2003) |
| 49 | | T. Aaron Gulliver,
Patric R. J. Östergård,
Nikolai Senkevitch:
Optimal quaternary linear rate-1/2 codes of length <18.
IEEE Transactions on Information Theory 49(6): 1540-1543 (2003) |
| 48 | EE | Franco Di Pasquale,
Patric R. J. Östergård:
An improved upper bound for the football pool problem for nine matches.
J. Comb. Theory, Ser. A 102(1): 204-206 (2003) |
| 2002 |
|---|
| 47 | | Patric R. J. Östergård,
Petteri Kaski:
Enumeration of 2-(9, 3, lambda) Designs and Their Resolutions.
Des. Codes Cryptography 27(1-2): 131-137 (2002) |
| 46 | | Patric R. J. Östergård:
A 2-(22, 8, 4) Design Cannot Have a 2-(10, 4, 4) Subdesign.
Des. Codes Cryptography 27(3): 257-260 (2002) |
| 45 | | Patric R. J. Östergård:
Classifying Subspaces of Hamming Spaces.
Des. Codes Cryptography 27(3): 297-305 (2002) |
| 44 | | Patric R. J. Östergård:
A fast algorithm for the maximum clique problem.
Discrete Applied Mathematics 120(1-3): 197-207 (2002) |
| 43 | EE | Masaaki Harada,
Patric R. J. Östergård:
Self-dual and maximal self-orthogonal codes over F7.
Discrete Mathematics 256(1-2): 471-477 (2002) |
| 42 | EE | Patric R. J. Östergård,
Mattias Svanström:
Ternary Constant Weight Codes.
Electr. J. Comb. 9(1): (2002) |
| 41 | EE | Masaaki Harada,
Patric R. J. Östergård:
Classification of Extremal Formally Self-Dual Even Codes of Length 22.
Graphs and Combinatorics 18(3): 507-516 (2002) |
| 40 | | Mattias Svanström,
Patric R. J. Östergård,
Galina T. Bogdanova:
Bounds and constructions for ternary constant-composition codes.
IEEE Transactions on Information Theory 48(1): 101-111 (2002) |
| 39 | EE | Patric R. J. Östergård,
Alfred Wassermann:
A New Lower Bound for the Football Pool Problem for Six Matches.
J. Comb. Theory, Ser. A 99(1): 175-179 (2002) |
| 2001 |
|---|
| 38 | | Galina T. Bogdanova,
Andries E. Brouwer,
Stoian N. Kapralov,
Patric R. J. Östergård:
Error-Correcting Codes over an Alphabet of Four Elements.
Des. Codes Cryptography 23(3): 333-342 (2001) |
| 37 | EE | Galina T. Bogdanova,
Patric R. J. Östergård:
Bounds on codes over an alphabet of five elements.
Discrete Mathematics 240(1-3): 13-19 (2001) |
| 36 | EE | Patric R. J. Östergård,
William D. Weakley:
Values of Domination Numbers of the Queen's Graph.
Electr. J. Comb. 8(1): (2001) |
| 35 | | Alexander A. Davydov,
Patric R. J. Östergård:
Linear codes with covering radius R = 2, 3 and codimension tR.
IEEE Transactions on Information Theory 47(1): 416-421 (2001) |
| 34 | | Patric R. J. Östergård,
Uri Blass:
On the size of optimal binary codes of length 9 and covering radius 1.
IEEE Transactions on Information Theory 47(6): 2556-2557 (2001) |
| 33 | | 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) |
| 32 | EE | Patric R. J. Östergård:
A New Algorithm for the Maximum-Weight Clique Problem.
Nord. J. Comput. 8(4): 424-436 (2001) |
| 2000 |
|---|
| 31 | | T. Aaron Gulliver,
Patric R. J. Östergård:
New Binary Linear Codes.
Ars Comb. 56: (2000) |
| 30 | EE | Patric R. J. Östergård:
Classification of binary/ternary one-error-correcting codes.
Discrete Mathematics 223(1-3): 253-262 (2000) |
| 29 | EE | Alexander A. Davydov,
Patric R. J. Östergård:
On Saturating Sets in Small Projective Geometries.
Eur. J. Comb. 21(5): 563-570 (2000) |
| 1999 |
|---|
| 28 | | Patric R. J. Östergård:
On Binary/Ternary Error-Correcting Codes with Minimum Distance 4.
AAECC 1999: 472-481 |
| 27 | | Patric R. J. Östergård:
New Constructions for q-ary Covering Codes.
Ars Comb. 52: (1999) |
| 26 | | Alexander A. Davydov,
Patric R. J. Östergård:
New Linear Codes with Covering Radius 2 and Odd Basis.
Des. Codes Cryptography 16(1): 29-39 (1999) |
| 25 | | Patric R. J. Östergård,
William D. Weakley:
Constructing Covering Codes with Given Automorphisms.
Des. Codes Cryptography 16(1): 65-73 (1999) |
| 24 | EE | Kari J. Nurmela,
Patric R. J. Östergård:
More Optimal Packings of Equal Circles in a Square.
Discrete & Computational Geometry 22(3): 439-457 (1999) |
| 23 | EE | Kari J. Nurmela,
Patric R. J. Östergård:
Covering t-sets with (t+2)-sets.
Discrete Applied Mathematics 95(1-3): 425-437 (1999) |
| 22 | EE | Patric R. J. Östergård:
A New Algorithm for the Maximum-Weight Clique Problem.
Electronic Notes in Discrete Mathematics 3: 153-156 (1999) |
| 21 | | Patric R. J. Östergård,
Tsonka Stefanova Baicheva,
Emil Kolev:
Optimal Binary One-Error-Correcting Codes of Length 10 Have 72 Codewords.
IEEE Transactions on Information Theory 45(4): 1229-1231 (1999) |
| 1998 |
|---|
| 20 | EE | 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) |
| 19 | EE | Patric R. J. Östergård,
Markku K. Kaikkonen:
New upper bounds for binary covering codes.
Discrete Mathematics 178(1-3): 165-179 (1998) |
| 18 | EE | Patric R. J. Östergård:
On the structure of optimal error-correcting codes.
Discrete Mathematics 179(1-3): 285-287 (1998) |
| 17 | EE | Ronald L. Graham,
Boris D. Lubachevsky,
Kari J. Nurmela,
Patric R. J. Östergård:
Dense packings of congruent circles in a circle.
Discrete Mathematics 181(1-3): 139-154 (1998) |
| 16 | | 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 Transactions on Information Theory 44(1): 140-161 (1998) |
| 15 | | Tuvi Etzion,
Patric R. J. Östergård:
Greedy and Heuristic Algorithms for Codes and Colorings.
IEEE Transactions on Information Theory 44(1): 382-388 (1998) |
| 1997 |
|---|
| 14 | | Patric R. J. Östergård,
Heikki O. Hämäläinen:
A New Table of Binary/Ternary Mixed Covering Codes.
Des. Codes Cryptography 11(2): 151-178 (1997) |
| 13 | EE | Kari J. Nurmela,
Patric R. J. Östergård:
Packing up to 50 Equal Circles in a Square.
Discrete & Computational Geometry 18(1): 111-120 (1997) |
| 12 | EE | Patric R. J. Östergård:
A Coloring Problem in Hamming Spaces.
Eur. J. Comb. 18(3): 303-309 (1997) |
| 11 | | T. Aaron Gulliver,
Patric R. J. Östergård:
Improved bounds for ternary linear codes of dimension 7.
IEEE Transactions on Information Theory 43(4): 1377-1381 (1997) |
| 10 | | Kari J. Nurmela,
Markku K. Kaikkonen,
Patric R. J. Östergård:
New constant weight codes from linear permutation groups.
IEEE Transactions on Information Theory 43(5): 1623-1630 (1997) |
| 9 | EE | John C. Cock,
Patric R. J. Östergård:
Ternary Covering Codes Derived from BCH Codes.
J. Comb. Theory, Ser. A 80(2): 283-289 (1997) |
| 1996 |
|---|
| 8 | | Patric R. J. Östergård,
Markku K. Kaikkonen:
New single-error-correcting codes.
IEEE Transactions on Information Theory 42(4): 1261-1262 (1996) |
| 7 | EE | Patric R. J. Östergård:
A Combinatorial Proof for the Football Pool Problem for Six Matches.
J. Comb. Theory, Ser. A 76(1): 160-163 (1996) |
| 1995 |
|---|
| 6 | EE | 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. Discrete Math. 8(2): 196-207 (1995) |
| 1994 |
|---|
| 5 | | Patric R. J. Östergård:
New Upper Bounds for the Football Pool Problem for 11 and 12 Matches.
J. Comb. Theory, Ser. A 67(2): 161-168 (1994) |
| 1992 |
|---|
| 4 | | Patric R. J. Östergård:
Further results on (k, t)-subnormal covering codes.
IEEE Transactions on Information Theory 38(1): 206- (1992) |
| 1991 |
|---|
| 3 | | Patric R. J. Östergård:
A new binary code of length 10 and covering radius 1.
IEEE Transactions on Information Theory 37(1): 179- (1991) |
| 2 | | Patric R. J. Östergård:
Upper bounds for q-ary covering codes.
IEEE Transactions on Information Theory 37(3): 660- (1991) |
| 1 | | Patric R. J. Östergård:
Correction to 'Upper Bounds for q-ary Covering Codes'.
IEEE Transactions on Information Theory 37(6): 1738- (1991) |
