The following pages link to Patric R. J. Östergård (Q180477):
Displaying 50 items.
- Packing anchored rectangles (Q276437) (← links)
- Non-existence of a ternary constant weight \((16,5,15;2048)\) diameter perfect code (Q326314) (← links)
- Further results on the classification of MDS codes (Q326328) (← links)
- On optimal binary codes with unbalanced coordinates (Q371241) (← links)
- Enumerating perfect matchings in \(n\)-cubes (Q382880) (← links)
- Enumerating cube tilings (Q393746) (← links)
- Switching in one-factorisations of complete graphs (Q405262) (← links)
- On the maximum length of coil-in-the-box codes in dimension 8 (Q477349) (← links)
- On hypercube packings, blocking sets and a covering problem (Q477608) (← links)
- Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19 (Q534044) (← links)
- (Q553992) (redirect page) (← links)
- Computing the domination number of grid graphs (Q553994) (← links)
- Classification of difference matrices over cyclic groups (Q619786) (← links)
- Russian doll search for the Steiner triple covering problem (Q644513) (← links)
- Switching codes and designs (Q658111) (← links)
- The cycle switching graph of the Steiner triple systems of order 19 is connected (Q659722) (← links)
- Optimal constant weight covering codes and nonuniform group divisible 3-designs with block size four (Q663476) (← links)
- Steiner triple systems satisfying the 4-vertex condition (Q664381) (← links)
- Generalising Fisher's inequality to coverings and packings (Q681600) (← links)
- Enumeration of 2-(9, 3, \({\lambda}\)) designs and their resolutions (Q697635) (← links)
- Packing arrays and packing designs (Q697642) (← links)
- On a hypercube coloring problem (Q703683) (← links)
- Tilings of the plane with unit area triangles of bounded diameter (Q722368) (← links)
- Mappings of Butson-type Hadamard matrices (Q724843) (← links)
- Weighted codes in Lee metrics (Q735023) (← links)
- Classification of optimal \((v, 4, 1)\) binary cyclically permutable constant-weight codes and cyclic \(2\)-\((v, 4, 1)\) designs with \(v \leq 76\). (Q764400) (← links)
- Kirkman triple systems with subsystems (Q776280) (← links)
- Classification algorithms for codes and designs (Q819932) (← links)
- New constructions of optimal self-dual binary codes of length 54 (Q851771) (← links)
- The Steiner quadruple systems of order 16 (Q855876) (← links)
- Further results on the covering radius of small codes (Q861794) (← links)
- Extremal cardinalities for identifying and locating-dominating codes in graphs (Q864121) (← links)
- An almost complete description of perfect codes in direct products of cycles (Q864867) (← links)
- Sets in Abelian groups with distinct sums of pairs. (Q868904) (← links)
- Steiner triple systems of order 19 and 21 with subsystems of order 7 (Q924955) (← links)
- Study of proper circulant weighing matrices with weight 9 (Q924967) (← links)
- Power Hadamard matrices (Q924977) (← links)
- There exists no Steiner system \(S(4,5,17)\) (Q958759) (← links)
- A tournament of order 14 with disjoint Banks and Slater sets (Q968179) (← links)
- Properties of the Steiner triple systems of order 19 (Q986700) (← links)
- Lower bounds on the minimum average distance of binary codes (Q998361) (← links)
- Optimality and uniqueness of the \((4,10,1/6)\) spherical code (Q1003633) (← links)
- Lower bounds on covering codes via partition matrices (Q1003655) (← links)
- On the minimum size of binary codes with length \(2R+4\) and covering radius \(R\) (Q1009034) (← links)
- Classification of the (0, 2)-graphs of valency 8 (Q1011491) (← links)
- On the size of identifying codes in binary hypercubes (Q1024996) (← links)
- Minimum perimeter rectangles that enclose congruent non-overlapping circles (Q1025447) (← links)
- A remark on Haas' method (Q1025956) (← links)
- On the classification of perfect codes: extended side class structures (Q1045141) (← links)
- Improved bounds for quaternary linear codes of dimension 6. (Q1264312) (← links)
