Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPatric R. J. Östergård
Publications
- 2019
[j137]Patric R. J. Östergård:
The sextuply shortened binary Golay code is optimal. Des. Codes Cryptogr. 87(2-3): 341-347 (2019)- 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) - 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) - 2012
- [j104]Patric R. J. Östergård:
Switching codes and designs. Discret. Math. 312(3): 621-632 (2012) - 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) - 2010
- [j89]Patric R. J. Östergård:
Classification of binary constant weight codes. IEEE Trans. Inf. Theory 56(8): 3779-3785 (2010) - 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) - 2005
- [j69]Patric R. J. Östergård:
Two New Four-Error-Correcting Binary Codes. Des. Codes Cryptogr. 36(3): 327-329 (2005) - [c2]Patric R. J. Östergård:
Constructing combinatorial objects via cliques. BCC 2005: 57-82 - 2004
- [j60]Patric R. J. Östergård:
On a hypercube coloring problem. J. Comb. Theory, Ser. A 108(2): 199-204 (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) - [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) - 2002
- [j47]Patric R. J. Östergård:
A fast algorithm for the maximum clique problem. Discret. Appl. Math. 120(1-3): 197-207 (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) - 2001
- [j35]Patric R. J. Östergård:
A New Algorithm for the Maximum-Weight Clique Problem. Nord. J. Comput. 8(4): 424-436 (2001) - 2000
- [j32]Patric R. J. Östergård:
Enumeration of 2-(12, 3, 2) designs. Australas. J Comb. 22: 227-232 (2000) - [j30]Patric R. J. Östergård:
Classification of binary/ternary one-error-correcting codes. Discret. Math. 223(1-3): 253-262 (2000) - 1999
- [j28]Patric R. J. Östergård:
New Constructions for q-ary Covering Codes. Ars Comb. 52 (1999) - [j23]Patric R. J. Östergård:
A New Algorithm for the Maximum-Weight Clique Problem. Electron. Notes Discret. Math. 3: 153-156 (1999) - [c1]Patric R. J. Östergård:
On Binary/Ternary Error-Correcting Codes with Minimum Distance 4. AAECC 1999: 472-481 - 1998
- [j19]Patric R. J. Östergård:
On the structure of optimal error-correcting codes. Discret. Math. 179(1-3): 285-287 (1998) - 1997
- [j13]Patric R. J. Östergård:
A Coloring Problem in Hamming Spaces. Eur. J. Comb. 18(3): 303-309 (1997) - 1996
- [j9]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
- [j7]Patric R. J. Östergård:
New multiple covering codes by tabu search. Australas. J Comb. 12: 145-156 (1995) - 1994
- [j5]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
- [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)
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-04-25 02: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:
