Patric R. J. Östergård

From MaRDI portal
Person:180477

Available identifiers

zbMath Open ostergard.patric-r-jMaRDI QIDQ180477

List of research outcomes

PublicationDate of PublicationType
Algorithms and complexity for counting configurations in Steiner triple systems2024-02-05Paper
Sparse Steiner triple systems of order 212024-02-01Paper
Quaternary complex Hadamard matrices of order 182024-02-01Paper
Bussey systems and Steiner's tactical problem2024-01-31Paper
Steiner triple systems of order 21 with subsystems2024-01-31Paper
On the structure of small strength‐2 covering arrays2024-01-29Paper
Improving Uniquely Decodable Codes in Binary Adder Channels2023-12-18Paper
Enumerating Steiner triple systems2023-11-09Paper
Constructing Random Steiner Triple Systems: An Experimental Study2022-08-25Paper
Equivalence of Butson-type Hadamard matrices2022-08-18Paper
Switching 3-edge-colorings of cubic graphs2022-06-14Paper
https://portal.mardi4nfdi.de/entity/Q50130252021-11-26Paper
https://portal.mardi4nfdi.de/entity/Q51330672020-11-12Paper
Kirkman triple systems with subsystems2020-07-08Paper
Constructions of maximum few-distance sets in Euclidean spaces2020-01-27Paper
Orderly generation of Butson Hadamard matrices2019-10-07Paper
New lower bounds on \(q\)-ary error-correcting codes2019-09-25Paper
The sextuply shortened binary Golay code is optimal2019-02-20Paper
New results on tripod packings2019-01-29Paper
Mappings of Butson-type Hadamard matrices2018-07-26Paper
https://portal.mardi4nfdi.de/entity/Q45663782018-06-14Paper
New Lower Bounds for Binary Constant-Dimension Subspace Codes2018-05-28Paper
The chromatic number of the square of the $8$-cube2018-05-17Paper
Switching of covering codes2018-04-19Paper
New lower bounds on error-correcting ternary, quaternary and quinary codes2018-03-16Paper
There is no McLaughlin geometry2018-01-12Paper
Enumeration of Seidel matrices2017-12-21Paper
Constructing error-correcting binary codes using transitive permutation groups2017-10-17Paper
LCL Problems on Grids2017-10-11Paper
The Perfect Binary One-Error-Correcting Codes of Length <formula formulatype="inline"><tex Notation="TeX">$15$</tex></formula>: Part I—Classification2017-08-08Paper
Reconstructing Extended Perfect Binary One-Error-Correcting Codes From Their Minimum Distance Graphs2017-08-08Paper
Classification of Binary Constant Weight Codes2017-07-27Paper
The Perfect Binary One-Error-Correcting Codes of Length 15: Part II—Properties2017-07-27Paper
New lower bounds for the Shannon capacity of odd cycles2017-07-21Paper
On Optimal Binary One-Error-Correcting Codes of Lengths $2^{m}-4$ and $2^{m}-3$2017-07-12Paper
On the Size of Optimal Three-Error-Correcting Binary Codes of Length 162017-07-12Paper
Classification of Cyclic Steiner Quadruple Systems2017-05-26Paper
On the Classification of MDS Codes2017-04-28Paper
EXISTENCE OF -ANALOGS OF STEINER SYSTEMS2017-04-04Paper
Planar Hypohamiltonian Graphs on 40 Vertices2017-02-01Paper
Non-existence of a ternary constant weight \((16,5,15;2048)\) diameter perfect code2016-10-12Paper
Further results on the classification of MDS codes2016-10-12Paper
Algorithms for finding maximum transitive subtournaments2016-02-23Paper
Classification of Graeco-Latin Cubes2016-02-17Paper
Classification of MDS Codes over Small Alphabets2016-01-07Paper
A coloring of the square of the 8-cube with 13 colors2015-09-23Paper
Enumeration of Steiner triple systems with subsystems2015-08-13Paper
Exhaustive search for snake-in-the-box codes2015-07-20Paper
https://portal.mardi4nfdi.de/entity/Q52519862015-05-21Paper
Permutation codes invariant under isometries2015-05-21Paper
Independent domination of grids2015-04-29Paper
On hypercube packings, blocking sets and a covering problem2014-12-09Paper
On the maximum length of coil-in-the-box codes in dimension 82014-12-03Paper
Switching in one-factorisations of complete graphs2014-09-04Paper
A note on Toeplitz' conjecture2014-07-01Paper
The Mendelsohn Triple Systems of Order 132014-04-04Paper
Large sets of \(t\)-designs over finite fields2014-03-14Paper
On the minimum size of 4-uniform hypergraphs without property \(B\)2014-02-07Paper
Enumerating cube tilings2014-01-24Paper
Counting Hamiltonian cycles in bipartite graphs2014-01-22Paper
Enumerating perfect matchings in \(n\)-cubes2013-11-22Paper
On optimal binary codes with unbalanced coordinates2013-09-30Paper
https://portal.mardi4nfdi.de/entity/Q28378302013-07-05Paper
The quaternary complex Hadamard matrices of orders 10, 12, and 142013-01-03Paper
Packing Costas Arrays2012-07-02Paper
Steiner triple systems satisfying the 4-vertex condition2012-03-01Paper
https://portal.mardi4nfdi.de/entity/Q31142552012-02-04Paper
The cycle switching graph of the Steiner triple systems of order 19 is connected2012-01-24Paper
Switching codes and designs2012-01-11Paper
Russian doll search for the Steiner triple covering problem2011-11-04Paper
Computing the domination number of grid graphs2011-07-29Paper
https://portal.mardi4nfdi.de/entity/Q30038842011-05-31Paper
Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 192011-05-10Paper
The number of Latin squares of order 112011-04-19Paper
https://portal.mardi4nfdi.de/entity/Q53935542011-04-18Paper
Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes2011-04-08Paper
Classification of difference matrices over cyclic groups2011-01-18Paper
https://portal.mardi4nfdi.de/entity/Q35825212010-09-02Paper
Properties of the Steiner triple systems of order 192010-08-12Paper
The nonexistence of a (K6-e)-decomposition of the complete graphK292010-08-03Paper
A tournament of order 14 with disjoint Banks and Slater sets2010-05-05Paper
Sperner capacity of small digraphs2010-03-10Paper
Linear codes with covering radius 32010-03-02Paper
There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK142009-04-08Paper
Classification of the (0, 2)-graphs of valency 82009-04-08Paper
Classification of resolvable balanced incomplete block designs — the unitals on 28 points2009-03-31Paper
On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\)2009-03-31Paper
A New Bound for the Zero-Error Capacity Region of the Two-User Binary Adder Channel2008-12-21Paper
There Exists No Hermitian Self-Dual Quaternary&lt;tex&gt;$[26,13,10_4$&lt;/tex&gt;Code]2008-12-21Paper
Unidirectional covering codes2008-12-21Paper
New Uniquely Decodable Codes for the $T$-User Binary Adder Channel With $3 \le T \le 5$2008-12-21Paper
SMALL p-GROUPS WITH FULL-RANK FACTORIZATION2008-12-11Paper
There exists no Steiner system \(S(4,5,17)\)2008-12-08Paper
Steiner triple systems of order 19 and 21 with subsystems of order 72008-05-29Paper
There are exactly five biplanes with k = 112008-03-20Paper
https://portal.mardi4nfdi.de/entity/Q54423902008-02-22Paper
There exist Steiner triple systems of order 15 that do not occur in a perfect binary one‐error‐correcting code2008-01-07Paper
https://portal.mardi4nfdi.de/entity/Q52956142007-07-30Paper
ELEMENTARY p-GROUPS WITH THE RÉDEI PROPERTY2007-06-20Paper
There are exactly five biplanes with2007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q34295672007-04-02Paper
Sets in Abelian groups with distinct sums of pairs.2007-02-26Paper
Further results on the covering radius of small codes2007-02-02Paper
https://portal.mardi4nfdi.de/entity/Q34162442007-01-19Paper
The Steiner quadruple systems of order 162006-12-07Paper
New constructions of optimal self-dual binary codes of length 542006-11-22Paper
https://portal.mardi4nfdi.de/entity/Q53954612006-10-30Paper
https://portal.mardi4nfdi.de/entity/Q54883912006-09-14Paper
Classification of Self-Orthogonal Codes over \boldmath$\F_3$ and \boldmath$\F_4$2006-06-01Paper
Near-extremal formally self-dual even codes of lengths 24 and 322006-05-29Paper
Classification algorithms for codes and designs2006-04-03Paper
Two new four-error-correcting binary codes2005-11-07Paper
Bounds for covering codes over large alphabets2005-11-07Paper
New results on codes with covering radius 1 and minimum distance \(2\)2005-06-15Paper
Optimal quaternary linear rate-1/2 codes of length ≤ 182005-06-01Paper
Disproof of a conjecture on the existence of balanced optimal covering codes2005-05-31Paper
One-factorizations of regular graphs of order 122005-04-25Paper
https://portal.mardi4nfdi.de/entity/Q46603272005-03-21Paper
Resolving the Existence of Full-Rank Tilings of Binary Hamming Spaces2005-02-28Paper
There exist non‐isomorphic STS(19) with equivalent point codes2005-02-23Paper
On a hypercube coloring problem2005-01-11Paper
https://portal.mardi4nfdi.de/entity/Q48219462004-10-22Paper
The Steiner triple systems of order 192004-08-13Paper
An updated table of binary/ternary mixed covering codes2004-08-06Paper
Miscellaneous classification results for 2-designs2004-08-06Paper
Binary optimal linear rate 1/2 codes2004-08-06Paper
A covering problem for tori2004-05-27Paper
Sets in \(\mathbb{Z}_n\) with distinct sums of pairs.2004-03-29Paper
Enumeration of balanced ternary designs.2004-03-29Paper
https://portal.mardi4nfdi.de/entity/Q44575442004-03-25Paper
On the covering radius of small codes2003-12-14Paper
https://portal.mardi4nfdi.de/entity/Q43932472003-12-10Paper
Classification of whist tournaments with up to 12 players2003-09-09Paper
Binary two-error-correcting codes are better than quaternary2003-09-01Paper
On the classification of self-dual codes over \(\mathbb F_5\)2003-08-18Paper
An improved upper bound for the football pool problem for nine matches2003-05-27Paper
Optimal linear rate \(\frac {1}{2}\) codes over \(\mathbb F_5\) and \(\mathbb F_7\)2003-05-25Paper
Ternary constant weight codes2003-05-13Paper
A 2-(22, 8, 4) design cannot have a 2-(10, 4, 4) subdesign2003-04-03Paper
Classifying subspaces of Hamming spaces2003-04-03Paper
A new lower bound for the football pool problem for six matches2003-03-26Paper
Classification of extremal formally self-dual even codes of length 222003-03-25Paper
More \(c\)-Bhaskar Rao designs with small block size2003-03-16Paper
Classifying optimal ternary codes of length 5 and covering radius 12003-02-10Paper
Bounds on codes over an alphabet of five elements2003-02-04Paper
Self-dual and maximal self-orthogonal codes over \({\mathbb F}_{7}\)2002-12-02Paper
https://portal.mardi4nfdi.de/entity/Q45475472002-10-21Paper
Enumeration of 2-(9, 3, \({\lambda}\)) designs and their resolutions2002-09-17Paper
https://portal.mardi4nfdi.de/entity/Q45522172002-08-29Paper
A fast algorithm for the maximum clique problem2002-08-29Paper
Linear codes with covering radius R=2, 3 and codimension tR2002-08-04Paper
On the size of optimal binary codes of length 9 and covering radius 12002-08-04Paper
Bounds and constructions for ternary constant-composition codes2002-08-04Paper
https://portal.mardi4nfdi.de/entity/Q45108092002-06-25Paper
New quaternary linear codes with covering radius 22002-06-23Paper
Recursive constructions of complete caps2002-06-16Paper
https://portal.mardi4nfdi.de/entity/Q45026542002-06-13Paper
There exists no (15,5,4) RBIBD2002-04-17Paper
https://portal.mardi4nfdi.de/entity/Q27443862002-04-16Paper
There exists no (15,5,4) RBIBD†*2002-02-27Paper
https://portal.mardi4nfdi.de/entity/Q27609872001-12-17Paper
https://portal.mardi4nfdi.de/entity/Q45278862001-11-19Paper
Error-correcting codes over an alphabet of four elements2001-11-04Paper
On saturating sets in small projective geometries2001-10-28Paper
Computer search for small complete caps2001-09-27Paper
https://portal.mardi4nfdi.de/entity/Q27413592001-09-23Paper
Values of domination numbers of the queen's graph2001-09-16Paper
Improved bounds for ternary linear codes of dimension 8 using tabu search2001-08-06Paper
https://portal.mardi4nfdi.de/entity/Q45156332001-03-30Paper
https://portal.mardi4nfdi.de/entity/Q45266412001-03-28Paper
Classification of binary/ternary one-error-correcting codes2000-12-03Paper
On the structure of optimal error-correcting codes2000-05-10Paper
Covering \(t\)-sets with \((t+2)\)-sets2000-04-26Paper
More optimal packings of equal circles in a square2000-02-16Paper
Constructing covering codes with given automorphisms1999-12-17Paper
Optimal binary one-error-correcting codes of length 10 have 72 codewords1999-11-21Paper
Asymptotic Behavior of Optimal Circle Packings in a Square1999-11-16Paper
https://portal.mardi4nfdi.de/entity/Q42427431999-07-18Paper
New linear codes with covering radius 2 and odd basis1999-06-01Paper
https://portal.mardi4nfdi.de/entity/Q42212351999-01-03Paper
Greedy and heuristic algorithms for codes and colorings1998-12-28Paper
https://portal.mardi4nfdi.de/entity/Q42221451998-12-06Paper
Improved bounds for quaternary linear codes of dimension 6.1998-11-09Paper
Bounds on mixed binary/ternary codes1998-06-08Paper
Dense packings of congruent circles in a circle1998-04-01Paper
New upper bounds for binary covering codes1998-01-26Paper
New constant weight codes from linear permutation groups1998-01-21Paper
Ternary covering codes derived from BCH codes1998-01-05Paper
https://portal.mardi4nfdi.de/entity/Q43651381997-10-30Paper
A new table of binary/ternary mixed covering codes1997-10-09Paper
Packing up to 50 equal circles in a square1997-07-28Paper
Improved bounds for ternary linear codes of dimension 71997-07-23Paper
A coloring problem in Hamming spaces1997-07-20Paper
New single-error-correcting codes1997-06-30Paper
A combinatorial proof for the football pool problem for six matches1996-11-24Paper
https://portal.mardi4nfdi.de/entity/Q48581531996-06-03Paper
Football Pools--A Game for Mathematicians1996-05-09Paper
Bounds for Binary Codes that are Multiple Coverings of the Farthest-Off Points1996-01-24Paper
New upper bounds for the football pool problem for 11 and 12 matches1995-07-09Paper
https://portal.mardi4nfdi.de/entity/Q43043961994-11-27Paper
https://portal.mardi4nfdi.de/entity/Q43075391994-10-03Paper
https://portal.mardi4nfdi.de/entity/Q42840251994-02-27Paper
Further results on (k, t)-subnormal covering codes1992-06-28Paper
A new binary code of length 10 and covering radius 11991-01-01Paper
Upper bounds for q-ary covering codes1991-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Patric R. J. Östergård