| Publication | Date of Publication | Type |
|---|
| Spherical codes with prescribed signed permutation automorphisms inside shells of low-dimensional integer lattices | 2025-01-23 | Paper |
| Constructing random Steiner triple systems: an experimental study | 2024-10-02 | Paper |
| Algorithms and complexity for counting configurations in Steiner triple systems | 2024-02-05 | Paper |
| Quaternary complex Hadamard matrices of order 18 | 2024-02-01 | Paper |
| Sparse Steiner triple systems of order 21 | 2024-02-01 | Paper |
| Bussey systems and Steiner's tactical problem | 2024-01-31 | Paper |
| Steiner triple systems of order 21 with subsystems | 2024-01-31 | Paper |
| On the structure of small strength‐2 covering arrays | 2024-01-29 | Paper |
| Improving Uniquely Decodable Codes in Binary Adder Channels | 2023-12-18 | Paper |
| Enumerating Steiner triple systems | 2023-11-09 | Paper |
| Constructing Random Steiner Triple Systems: An Experimental Study | 2022-08-25 | Paper |
| Equivalence of Butson-type Hadamard matrices | 2022-08-18 | Paper |
| Switching 3-edge-colorings of cubic graphs | 2022-06-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5013025 | 2021-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5133067 | 2020-11-12 | Paper |
| Kirkman triple systems with subsystems | 2020-07-08 | Paper |
| Constructions of maximum few-distance sets in Euclidean spaces | 2020-01-27 | Paper |
| Orderly generation of Butson Hadamard matrices | 2019-10-07 | Paper |
| New lower bounds on \(q\)-ary error-correcting codes | 2019-09-25 | Paper |
| The sextuply shortened binary Golay code is optimal | 2019-02-20 | Paper |
| New results on tripod packings | 2019-01-29 | Paper |
| Mappings of Butson-type Hadamard matrices | 2018-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4566378 | 2018-06-14 | Paper |
| New Lower Bounds for Binary Constant-Dimension Subspace Codes | 2018-05-28 | Paper |
| The chromatic number of the square of the $8$-cube | 2018-05-17 | Paper |
| Switching of covering codes | 2018-04-19 | Paper |
| New lower bounds on error-correcting ternary, quaternary and quinary codes | 2018-03-16 | Paper |
| There is no McLaughlin geometry | 2018-01-12 | Paper |
| Enumeration of Seidel matrices | 2017-12-21 | Paper |
| Constructing error-correcting binary codes using transitive permutation groups | 2017-10-17 | Paper |
| LCL Problems on Grids | 2017-10-11 | Paper |
| The Perfect Binary One-Error-Correcting Codes of Length <formula formulatype="inline"><tex Notation="TeX">$15$</tex></formula>: Part I—Classification | 2017-08-08 | Paper |
| Reconstructing Extended Perfect Binary One-Error-Correcting Codes From Their Minimum Distance Graphs | 2017-08-08 | Paper |
| The Perfect Binary One-Error-Correcting Codes of Length 15: Part II—Properties | 2017-07-27 | Paper |
| Classification of Binary Constant Weight Codes | 2017-07-27 | Paper |
| New lower bounds for the Shannon capacity of odd cycles | 2017-07-21 | Paper |
| On the Size of Optimal Three-Error-Correcting Binary Codes of Length 16 | 2017-07-12 | Paper |
| On Optimal Binary One-Error-Correcting Codes of Lengths $2^{m}-4$ and $2^{m}-3$ | 2017-07-12 | Paper |
| Classification of Cyclic Steiner Quadruple Systems | 2017-05-26 | Paper |
| On the Classification of MDS Codes | 2017-04-28 | Paper |
| EXISTENCE OF -ANALOGS OF STEINER SYSTEMS | 2017-04-04 | Paper |
| Planar Hypohamiltonian Graphs on 40 Vertices | 2017-02-01 | Paper |
| Non-existence of a ternary constant weight \((16,5,15;2048)\) diameter perfect code | 2016-10-12 | Paper |
| Further results on the classification of MDS codes | 2016-10-12 | Paper |
| Algorithms for finding maximum transitive subtournaments | 2016-02-23 | Paper |
| Classification of Graeco-Latin Cubes | 2016-02-17 | Paper |
| Classification of MDS Codes over Small Alphabets | 2016-01-07 | Paper |
| A coloring of the square of the 8-cube with 13 colors | 2015-09-23 | Paper |
| Enumeration of Steiner triple systems with subsystems | 2015-08-13 | Paper |
| Exhaustive search for snake-in-the-box codes | 2015-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5251986 | 2015-05-21 | Paper |
| Permutation codes invariant under isometries | 2015-05-21 | Paper |
| Independent domination of grids | 2015-04-29 | Paper |
| On hypercube packings, blocking sets and a covering problem | 2014-12-09 | Paper |
| On the maximum length of coil-in-the-box codes in dimension 8 | 2014-12-03 | Paper |
| Switching in one-factorisations of complete graphs | 2014-09-04 | Paper |
| A note on Toeplitz' conjecture | 2014-07-01 | Paper |
| The Mendelsohn Triple Systems of Order 13 | 2014-04-04 | Paper |
| Large sets of \(t\)-designs over finite fields | 2014-03-14 | Paper |
| On the minimum size of 4-uniform hypergraphs without property \(B\) | 2014-02-07 | Paper |
| Enumerating cube tilings | 2014-01-24 | Paper |
| Counting Hamiltonian cycles in bipartite graphs | 2014-01-22 | Paper |
| Enumerating perfect matchings in \(n\)-cubes | 2013-11-22 | Paper |
| On optimal binary codes with unbalanced coordinates | 2013-09-30 | Paper |
| Algorithms for the combinatorial best barbeque problem | 2013-07-05 | Paper |
| The quaternary complex Hadamard matrices of orders 10, 12, and 14 | 2013-01-03 | Paper |
| On triple systems and strongly regular graphs | 2012-08-01 | Paper |
| Packing Costas arrays | 2012-07-02 | Paper |
| Steiner triple systems satisfying the 4-vertex condition | 2012-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3114255 | 2012-02-04 | Paper |
| The cycle switching graph of the Steiner triple systems of order 19 is connected | 2012-01-24 | Paper |
| Switching codes and designs | 2012-01-11 | Paper |
| Russian doll search for the Steiner triple covering problem | 2011-11-04 | Paper |
| Computing the domination number of grid graphs | 2011-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3003884 | 2011-05-31 | Paper |
| Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19 | 2011-05-10 | Paper |
| The number of Latin squares of order 11 | 2011-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5393554 | 2011-04-18 | Paper |
| Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes | 2011-04-08 | Paper |
| Classification of difference matrices over cyclic groups | 2011-01-18 | Paper |
| A catalogue of the Steiner triple systems of order 19 | 2010-09-02 | Paper |
| Properties of the Steiner triple systems of order 19 | 2010-08-12 | Paper |
| The nonexistence of a \((K_6-e)\)-decomposition of the complete graph \(K_{29}\) | 2010-08-03 | Paper |
| A tournament of order 14 with disjoint Banks and Slater sets | 2010-05-05 | Paper |
| Sperner capacity of small digraphs | 2010-03-10 | Paper |
| Linear codes with covering radius 3 | 2010-03-02 | Paper |
| Classification of the (0, 2)-graphs of valency 8 | 2009-04-08 | Paper |
| There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK14 | 2009-04-08 | Paper |
| On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\) | 2009-03-31 | Paper |
| Classification of resolvable balanced incomplete block designs — the unitals on 28 points | 2009-03-31 | Paper |
| Unidirectional covering codes | 2008-12-21 | Paper |
| A New Bound for the Zero-Error Capacity Region of the Two-User Binary Adder Channel | 2008-12-21 | Paper |
| New Uniquely Decodable Codes for the $T$-User Binary Adder Channel With $3 \le T \le 5$ | 2008-12-21 | Paper |
| There Exists No Hermitian Self-Dual Quaternary<tex>$[26,13,10]_4$</tex>Code | 2008-12-21 | Paper |
| SMALL p-GROUPS WITH FULL-RANK FACTORIZATION | 2008-12-11 | Paper |
| There exists no Steiner system \(S(4,5,17)\) | 2008-12-08 | Paper |
| Steiner triple systems of order 19 and 21 with subsystems of order 7 | 2008-05-29 | Paper |
| There are exactly five biplanes with k = 11 | 2008-03-20 | Paper |
| There exists no symmetric configuration with 33 points and line size 6 | 2008-02-22 | Paper |
| There exist Steiner triple systems of order 15 that do not occur in a perfect binary one‐error‐correcting code | 2008-01-07 | Paper |
| Classification of optimal binary self-orthognal codes | 2007-07-30 | Paper |
| ELEMENTARY p-GROUPS WITH THE RÉDEI PROPERTY | 2007-06-20 | Paper |
| There are exactly five biplanes with | 2007-05-29 | Paper |
| New lower bounds for asymmetric covering codes | 2007-04-02 | Paper |
| Sets in Abelian groups with distinct sums of pairs. | 2007-02-26 | Paper |
| Further results on the covering radius of small codes | 2007-02-02 | Paper |
| Constructing combinatorial objects via cliques | 2007-01-19 | Paper |
| The Steiner quadruple systems of order 16 | 2006-12-07 | Paper |
| New constructions of optimal self-dual binary codes of length 54 | 2006-11-22 | Paper |
| The number of inequivalent \((2R+3,7)R\) optimal covering codes | 2006-10-30 | Paper |
| Classification of directed and hybrid triple systems | 2006-09-14 | Paper |
| Classification of Self-Orthogonal Codes over \boldmath$\F_3$ and \boldmath$\F_4$ | 2006-06-01 | Paper |
| Near-extremal formally self-dual even codes of lengths 24 and 32 | 2006-05-29 | Paper |
| Classification algorithms for codes and designs | 2006-04-03 | Paper |
| Two new four-error-correcting binary codes | 2005-11-07 | Paper |
| Bounds for covering codes over large alphabets | 2005-11-07 | Paper |
| New results on codes with covering radius 1 and minimum distance \(2\) | 2005-06-15 | Paper |
| Optimal quaternary linear rate-1/2 codes of length ≤ 18 | 2005-06-01 | Paper |
| Disproof of a conjecture on the existence of balanced optimal covering codes | 2005-05-31 | Paper |
| One-factorizations of regular graphs of order 12 | 2005-04-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4660327 | 2005-03-21 | Paper |
| Resolving the Existence of Full-Rank Tilings of Binary Hamming Spaces | 2005-02-28 | Paper |
| There exist non‐isomorphic STS(19) with equivalent point codes | 2005-02-23 | Paper |
| On a hypercube coloring problem | 2005-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4821946 | 2004-10-22 | Paper |
| The Steiner triple systems of order 19 | 2004-08-13 | Paper |
| Binary optimal linear rate 1/2 codes | 2004-08-06 | Paper |
| An updated table of binary/ternary mixed covering codes | 2004-08-06 | Paper |
| Miscellaneous classification results for 2-designs | 2004-08-06 | Paper |
| A covering problem for tori | 2004-05-27 | Paper |
| Enumeration of balanced ternary designs. | 2004-03-29 | Paper |
| Sets in \(\mathbb{Z}_n\) with distinct sums of pairs. | 2004-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4457544 | 2004-03-25 | Paper |
| On the covering radius of small codes | 2003-12-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4393247 | 2003-12-10 | Paper |
| Classification of whist tournaments with up to 12 players | 2003-09-09 | Paper |
| Binary two-error-correcting codes are better than quaternary | 2003-09-01 | Paper |
| On the classification of self-dual codes over \(\mathbb F_5\) | 2003-08-18 | Paper |
| An improved upper bound for the football pool problem for nine matches | 2003-05-27 | Paper |
| Optimal linear rate \(\frac {1}{2}\) codes over \(\mathbb F_5\) and \(\mathbb F_7\) | 2003-05-25 | Paper |
| Ternary constant weight codes | 2003-05-13 | Paper |
| A 2-(22, 8, 4) design cannot have a 2-(10, 4, 4) subdesign | 2003-04-03 | Paper |
| Classifying subspaces of Hamming spaces | 2003-04-03 | Paper |
| A new lower bound for the football pool problem for six matches | 2003-03-26 | Paper |
| Classification of extremal formally self-dual even codes of length 22 | 2003-03-25 | Paper |
| More \(c\)-Bhaskar Rao designs with small block size | 2003-03-16 | Paper |
| Classifying optimal ternary codes of length 5 and covering radius 1 | 2003-02-10 | Paper |
| Bounds on codes over an alphabet of five elements | 2003-02-04 | Paper |
| Self-dual and maximal self-orthogonal codes over \({\mathbb F}_{7}\) | 2002-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4547547 | 2002-10-21 | Paper |
| Enumeration of 2-(9, 3, \({\lambda}\)) designs and their resolutions | 2002-09-17 | Paper |
| A fast algorithm for the maximum clique problem | 2002-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4552217 | 2002-08-29 | Paper |
| Linear codes with covering radius R=2, 3 and codimension tR | 2002-08-04 | Paper |
| Bounds and constructions for ternary constant-composition codes | 2002-08-04 | Paper |
| On the size of optimal binary codes of length 9 and covering radius 1 | 2002-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4510809 | 2002-06-25 | Paper |
| New quaternary linear codes with covering radius 2 | 2002-06-23 | Paper |
| Recursive constructions of complete caps | 2002-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4502654 | 2002-06-13 | Paper |
| There exists no (15, 5, 4) RBIBD | 2002-04-17 | Paper |
| There are \(270, 474, 142\) nonisomorphic \(2\)-\((9, 4, 6)\) designs | 2002-04-16 | Paper |
| There exists no (15,5,4) RBIBD | 2002-02-27 | Paper |
| New constructions for \(q\)-ary covering codes | 2001-12-17 | Paper |
| Classification of binary covering codes | 2001-11-19 | Paper |
| Error-correcting codes over an alphabet of four elements | 2001-11-04 | Paper |
| On saturating sets in small projective geometries | 2001-10-28 | Paper |
| Computer search for small complete caps | 2001-09-27 | Paper |
| A new algorithm for the maximum-weight clique problem | 2001-09-23 | Paper |
| Values of domination numbers of the queen's graph | 2001-09-16 | Paper |
| Improved bounds for ternary linear codes of dimension 8 using tabu search | 2001-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4515633 | 2001-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526641 | 2001-03-28 | Paper |
| Classification of binary/ternary one-error-correcting codes | 2000-12-03 | Paper |
| On the structure of optimal error-correcting codes | 2000-05-10 | Paper |
| Covering \(t\)-sets with \((t+2)\)-sets | 2000-04-26 | Paper |
| More optimal packings of equal circles in a square | 2000-02-16 | Paper |
| Constructing covering codes with given automorphisms | 1999-12-17 | Paper |
| Optimal binary one-error-correcting codes of length 10 have 72 codewords | 1999-11-21 | Paper |
| Asymptotic Behavior of Optimal Circle Packings in a Square | 1999-11-16 | Paper |
| New coverings oft-sets with (t + 1)-sets | 1999-07-18 | Paper |
| New linear codes with covering radius 2 and odd basis | 1999-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4221235 | 1999-01-03 | Paper |
| Greedy and heuristic algorithms for codes and colorings | 1998-12-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4222145 | 1998-12-06 | Paper |
| Improved bounds for quaternary linear codes of dimension 6. | 1998-11-09 | Paper |
| Bounds on mixed binary/ternary codes | 1998-06-08 | Paper |
| Dense packings of congruent circles in a circle | 1998-04-01 | Paper |
| New upper bounds for binary covering codes | 1998-01-26 | Paper |
| New constant weight codes from linear permutation groups | 1998-01-21 | Paper |
| Ternary covering codes derived from BCH codes | 1998-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4365138 | 1997-10-30 | Paper |
| A new table of binary/ternary mixed covering codes | 1997-10-09 | Paper |
| Packing up to 50 equal circles in a square | 1997-07-28 | Paper |
| Improved bounds for ternary linear codes of dimension 7 | 1997-07-23 | Paper |
| A coloring problem in Hamming spaces | 1997-07-20 | Paper |
| New single-error-correcting codes | 1997-06-30 | Paper |
| A combinatorial proof for the football pool problem for six matches | 1996-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858153 | 1996-06-03 | Paper |
| Football Pools--A Game for Mathematicians | 1996-05-09 | Paper |
| Bounds for Binary Codes that are Multiple Coverings of the Farthest-Off Points | 1996-01-24 | Paper |
| New upper bounds for the football pool problem for 11 and 12 matches | 1995-07-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4304396 | 1994-11-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4307539 | 1994-10-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4284025 | 1994-02-27 | Paper |
| Further results on (k, t)-subnormal covering codes | 1992-06-28 | Paper |
| Upper bounds for q-ary covering codes | 1991-01-01 | Paper |
| A new binary code of length 10 and covering radius 1 | 1991-01-01 | Paper |
