The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Patric R. J. Östergård: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  75. One-Factorizations of Regular Graphs of Order 12. [Citation Graph (, )][DBLP]


  76. The Perfect Binary One-Error-Correcting Codes of Length 15: Part I--Classification [Citation Graph (, )][DBLP]


  77. The Perfect Binary One-Error-Correcting Codes of Length 15: Part II--Properties [Citation Graph (, )][DBLP]


  78. Reconstructing Extended Perfect Binary One-Error-Correcting Codes from Their Minimum Distance Graphs [Citation Graph (, )][DBLP]


  79. Two Optimal One-Error-Correcting Codes of Length 13 That Are Not Doubly Shortened Perfect Codes [Citation Graph (, )][DBLP]


  80. A tournament of order 14 with disjoint Banks and Slater sets. [Citation Graph (, )][DBLP]


  81. On the minimum size of binary codes with length 2 R + 4 and covering radius R. [Citation Graph (, )][DBLP]


  82. Linear codes with covering radius 3. [Citation Graph (, )][DBLP]


  83. Steiner triple systems of order 19 and 21 with subsystems of order 7. [Citation Graph (, )][DBLP]


  84. Classification of the (0, 2)-graphs of valency 8. [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.014secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002