2023
Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161).
Dagstuhl Reports, 2023
Improving Uniquely Decodable Codes in Binary Adder Channels.
CoRR, 2023
2022
Switching 3-edge-colorings of cubic graphs.
Discret. Math., 2022
2020
Orderly generation of Butson Hadamard matrices.
Math. Comput., 2020
Kirkman triple systems with subsystems.
Discret. Math., 2020
Constructions of Maximum Few-Distance Sets in Euclidean Spaces.
Electron. J. Comb., 2020
2019
New Results on Tripod Packings.
Discret. Comput. Geom., 2019
The sextuply shortened binary Golay code is optimal.
Des. Codes Cryptogr., 2019
New lower bounds on q-ary error-correcting codes.
Cryptogr. Commun., 2019
2018
The chromatic number of the square of the 8-cube.
Math. Comput., 2018
There is no McLaughlin geometry.
J. Comb. Theory A, 2018
New Lower Bounds for Binary Constant-Dimension Subspace Codes.
Exp. Math., 2018
Enumeration of Seidel matrices.
Eur. J. Comb., 2018
Switching of covering codes.
Discret. Math., 2018
Mappings of Butson-type Hadamard matrices.
Discret. Math., 2018
2017
Planar Hypohamiltonian Graphs on 40 Vertices.
J. Graph Theory, 2017
New lower bounds for the Shannon capacity of odd cycles.
Des. Codes Cryptogr., 2017
Constructing error-correcting binary codes using transitive permutation groups.
Discret. Appl. Math., 2017
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017
New Lower Bounds on Error-Correcting Ternary, Quaternary and Quinary Codes.
Proceedings of the Coding Theory and Applications - 5th International Castle Meeting, 2017
2016
Algorithms for finding maximum transitive subtournaments.
J. Comb. Optim., 2016
Non-existence of a ternary constant weight (16, 5, 15;2048) diameter perfect code.
Adv. Math. Commun., 2016
Further results on the classification of MDS codes.
Adv. Math. Commun., 2016
2015
On the Classification of MDS Codes.
IEEE Trans. Inf. Theory, 2015
Enumeration of Steiner triple systems with subsystems.
Math. Comput., 2015
On hypercube packings, blocking sets and a covering problem.
Inf. Process. Lett., 2015
Exhaustive Search for Snake-in-the-Box Codes.
Graphs Comb., 2015
Independent domination of grids.
Discret. Math., 2015
Permutation codes invariant under isometries.
Des. Codes Cryptogr., 2015
A coloring of the square of the 8-cube with 13 colors.
CoRR, 2015
Bounds on the domination number of Kneser graphs.
Ars Math. Contemp., 2015
2014
Counting Hamiltonian cycles in bipartite graphs.
Math. Comput., 2014
Large sets of t-designs over finite fields.
J. Comb. Theory A, 2014
A Note on Toeplitz' Conjecture.
Discret. Comput. Geom., 2014
On the maximum length of coil-in-the-box codes in dimension 8.
Discret. Appl. Math., 2014
On the minimum size of 4-uniform hypergraphs without property B.
Discret. Appl. Math., 2014
Non-existence of a ternary constant weight $(16, 5, 15; 2048)$ diameter perfect code.
CoRR, 2014
Switching in One-Factorisations of Complete Graphs.
Electron. J. Comb., 2014
Classification of MDS Codes over Small Alphabets.
Proceedings of the Coding Theory and Applications, 4th International Castle Meeting, 2014
2013
Enumerating Perfect Matchings in n-Cubes.
Order, 2013
The quaternary complex Hadamard matrices of orders 10, 12, and 14.
Discret. Math., 2013
Enumerating Cube Tilings.
Discret. Comput. Geom., 2013
On the Shannon Capacity of Triangular Graphs.
Electron. J. Comb., 2013
On optimal binary codes with unbalanced coordinates.
Appl. Algebra Eng. Commun. Comput., 2013
2012
On triple systems and strongly regular graphs.
J. Comb. Theory A, 2012
Switching codes and designs.
Discret. Math., 2012
Steiner triple systems satisfying the 4-vertex condition.
Des. Codes Cryptogr., 2012
2011
On the Size of Optimal Three-Error-Correcting Binary Codes of Length 16.
IEEE Trans. Inf. Theory, 2011
On Optimal Binary One-Error-Correcting Codes of Lengths 2<sup>m</sup>-4 and 2<sup>m</sup>-3.
IEEE Trans. Inf. Theory, 2011
Russian doll search for the Steiner triple covering problem.
Optim. Lett., 2011
The number of Latin squares of order 11.
Math. Comput., 2011
The Cycle Switching Graph of the Steiner Triple Systems of Order 19 is Connected.
Graphs Comb., 2011
Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19.
Discret. Math., 2011
Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes.
Des. Codes Cryptogr., 2011
On Optimal Binary One-Error-Correcting Codes of Lengths $2^m-4$ and $2^m-3$
CoRR, 2011
Computing the Domination Number of Grid Graphs.
Electron. J. Comb., 2011
2010
The perfect binary one-error-correcting codes of length 15: part II-properties.
IEEE Trans. Inf. Theory, 2010
Classification of binary constant weight codes.
IEEE Trans. Inf. Theory, 2010
Linear codes with covering radius 3.
Des. Codes Cryptogr., 2010
A tournament of order 14 with disjoint Banks and Slater sets.
Discret. Appl. Math., 2010
Properties of the Steiner Triple Systems of Order 19.
Electron. J. Comb., 2010
A census of one-factorizations of the complete 3-uniform hypergraph of order 9.
Australas. J Comb., 2010
2009
The perfect binary one-error-correcting codes of length 15: part I-classification.
IEEE Trans. Inf. Theory, 2009
Reconstructing extended perfect binary one-error-correcting codes from their minimum distance graphs.
IEEE Trans. Inf. Theory, 2009
Classification of the (0, 2)-graphs of valency 8.
Discret. Math., 2009
Sperner capacity of small digraphs.
Adv. Math. Commun., 2009
2008
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., 2008
There exists no Steiner system S(4, 5, 17).
J. Comb. Theory A, 2008
Small P-Groups with Full-Rank Factorization.
Int. J. Algebra Comput., 2008
Steiner triple systems of order 19 and 21 with subsystems of order 7.
Discret. Math., 2008
On the minimum size of binary codes with length 2 <i>R</i> + 4 and covering radius <i>R</i>.
Des. Codes Cryptogr., 2008
2007
New Uniquely Decodable Codes for the T-User Binary Adder Channel With 3<=T<=5.
IEEE Trans. Inf. Theory, 2007
Elementary P-Groups with the RÉdei Property.
Int. J. Algebra Comput., 2007
Further results on the covering radius of small codes.
Discret. Math., 2007
There exists no symmetric configuration with 33 points and line size 6.
Australas. J Comb., 2007
2006
Unidirectional covering codes.
IEEE Trans. Inf. Theory, 2006
The Steiner quadruple systems of order 16.
J. Comb. Theory A, 2006
There are exactly five biplanes with k=11.
Electron. Notes Discret. Math., 2006
New constructions of optimal self-dual binary codes of length 54.
Des. Codes Cryptogr., 2006
2005
A New Bound for the Zero-Error Capacity Region of the Two-User Binary Adder Channel.
IEEE Trans. Inf. Theory, 2005
Classification of Self-Orthogonal Codes over F<sub>3</sub> and F<sub>4</sub>.
SIAM J. Discret. Math., 2005
New Results on Codes with Covering Radius 1 and Minimum Distance 2.
Des. Codes Cryptogr., 2005
Two New Four-Error-Correcting Binary Codes.
Des. Codes Cryptogr., 2005
Bounds for Covering Codes over Large Alphabets.
Des. Codes Cryptogr., 2005
Near-Extremal Formally Self-Dual Even Codes of Lengths 24 and 32.
Des. Codes Cryptogr., 2005
One-Factorizations of Regular Graphs of Order 12.
Electron. J. Comb., 2005
Constructing combinatorial objects via cliques.
Proceedings of the Surveys in Combinatorics, 2005
2004
There exists no Hermitian self-dual quaternary [26, 13, 10]<sub>4</sub> code.
IEEE Trans. Inf. Theory, 2004
Resolving the Existence of Full-Rank Tilings of Binary Hamming Spaces.
SIAM J. Discret. Math., 2004
The Steiner triple systems of order 19.
Math. Comput., 2004
On a hypercube coloring problem.
J. Comb. Theory A, 2004
Miscellaneous classification results for 2-designs.
Discret. Math., 2004
Binary optimal linear rate 1/2 codes.
Discret. Math., 2004
Enumeration of balanced ternary designs.
Discret. Appl. Math., 2004
Sets in Z <sub>n</sub>with distinct sums of pairs.
Discret. Appl. Math., 2004
2003
Disproof of a conjecture on the existence of balanced optimal covering codes.
IEEE Trans. Inf. Theory, 2003
Optimal quaternary linear rate-1/2 codes of length <18.
IEEE Trans. Inf. Theory, 2003
An improved upper bound for the football pool problem for nine matches.
J. Comb. Theory A, 2003
On the Classification of Self-Dual Codes over F<sub>5</sub>.
Graphs Comb., 2003
Optimal linear rate 1/2 codes over F<sub>5</sub> and F<sub>2</sub>.
Discret. Math., 2003
More <i>c</i>-Bhaskar Rao designs with small block size.
Discret. Math., 2003
Classification of whist tournaments with up to 12 players.
Discret. Appl. Math., 2003
Binary Two-Error-Correcting Codes are Better than Quaternary.
Appl. Algebra Eng. Commun. Comput., 2003
2002
Bounds and constructions for ternary constant-composition codes.
IEEE Trans. Inf. Theory, 2002
A New Lower Bound for the Football Pool Problem for Six Matches.
J. Comb. Theory A, 2002
Classification of Extremal Formally Self-Dual Even Codes of Length 22.
Graphs Comb., 2002
Self-dual and maximal self-orthogonal codes over F<sub>7</sub>.
Discret. Math., 2002
Enumeration of 2-(9, 3, lambda) Designs and Their Resolutions.
Des. Codes Cryptogr., 2002
Classifying Subspaces of Hamming Spaces.
Des. Codes Cryptogr., 2002
A 2-(22, 8, 4) Design Cannot Have a 2-(10, 4, 4) Subdesign.
Des. Codes Cryptogr., 2002
A fast algorithm for the maximum clique problem.
Discret. Appl. Math., 2002
Ternary Constant Weight Codes.
Electron. J. Comb., 2002
2001
On the size of optimal binary codes of length 9 and covering radius 1.
IEEE Trans. Inf. Theory, 2001
Linear codes with covering radius R = 2, 3 and codimension tR.
IEEE Trans. Inf. Theory, 2001
A New Algorithm for the Maximum-Weight Clique Problem.
Nord. J. Comput., 2001
Improved Bounds for Ternary Linear Codes of Dimension 8 Using Tabu Search.
J. Heuristics, 2001
Bounds on codes over an alphabet of five elements.
Discret. Math., 2001
Error-Correcting Codes over an Alphabet of Four Elements.
Des. Codes Cryptogr., 2001
Values of Domination Numbers of the Queen's Graph.
Electron. J. Comb., 2001
2000
On Saturating Sets in Small Projective Geometries.
Eur. J. Comb., 2000
Classification of binary/ternary one-error-correcting codes.
Discret. Math., 2000
Enumeration of 2-(12, 3, 2) designs.
Australas. J Comb., 2000
1999
Optimal Binary One-Error-Correcting Codes of Length 10 Have 72 Codewords.
IEEE Trans. Inf. Theory, 1999
More Optimal Packings of Equal Circles in a Square.
Discret. Comput. Geom., 1999
Constructing Covering Codes with Given Automorphisms.
Des. Codes Cryptogr., 1999
New Linear Codes with Covering Radius 2 and Odd Basis.
Des. Codes Cryptogr., 1999
Covering t-sets with (t+2)-sets.
Discret. Appl. Math., 1999
New Constructions for q-ary Covering Codes.
Ars Comb., 1999
On Binary/Ternary Error-Correcting Codes with Minimum Distance 4.
Proceedings of the Applied Algebra, 1999
1998
Greedy and Heuristic Algorithms for Codes and Colorings.
IEEE Trans. Inf. Theory, 1998
Bounds on Mixed Binary/Ternary Codes.
IEEE Trans. Inf. Theory, 1998
New upper bounds for binary covering codes.
Discret. Math., 1998
On the structure of optimal error-correcting codes.
Discret. Math., 1998
Dense packings of congruent circles in a circle.
Discret. Math., 1998
Improved Bounds for Quaternary Linear Codes of Dimension 6.
Appl. Algebra Eng. Commun. Comput., 1998
1997
New constant weight codes from linear permutation groups.
IEEE Trans. Inf. Theory, 1997
Improved bounds for ternary linear codes of dimension 7.
IEEE Trans. Inf. Theory, 1997
Ternary Covering Codes Derived from BCH Codes.
J. Comb. Theory A, 1997
A Coloring Problem in Hamming Spaces.
Eur. J. Comb., 1997
Packing up to 50 Equal Circles in a Square.
Discret. Comput. Geom., 1997
A New Table of Binary/Ternary Mixed Covering Codes.
Des. Codes Cryptogr., 1997
1996
New single-error-correcting codes.
IEEE Trans. Inf. Theory, 1996
A Combinatorial Proof for the Football Pool Problem for Six Matches.
J. Comb. Theory A, 1996
1995
Bounds for Binary Codes That Are Multiple Coverings of the Farthest-Off Points.
SIAM J. Discret. Math., 1995
New multiple covering codes by tabu search.
Australas. J Comb., 1995
1994
New Upper Bounds for the Football Pool Problem for 11 and 12 Matches.
J. Comb. Theory A, 1994
1992
Further results on (k, t)-subnormal covering codes.
IEEE Trans. Inf. Theory, 1992
1991
Correction to 'Upper Bounds for q-ary Covering Codes'.
IEEE Trans. Inf. Theory, 1991
Upper bounds for q-ary covering codes.
IEEE Trans. Inf. Theory, 1991
A new binary code of length 10 and covering radius 1.
IEEE Trans. Inf. Theory, 1991
