159 results on '"Östergård, Patric R.J."'
Search Results
2. There is no McLaughlin geometry
3. Enumeration of Seidel matrices
4. Constructing error-correcting binary codes using transitive permutation groups
5. Prescribing Automorphism Groups
6. Validity of Computational Results
7. Classification of Related Structures
8. Classification of Designs
9. Classification of Codes
10. Auxiliary Algorithms
11. Representations and Isomorphism
12. Isomorph-Free Exhaustive Generation
13. Graphs, Designs, and Codes
14. Computational Complexity
15. Introduction
16. Nonexistence of Projective Planes of Order 10
17. On the maximum length of coil-in-the-box codes in dimension 8
18. Large sets of t-designs over finite fields
19. On the minimum size of 4-uniform hypergraphs without property [formula omitted]
20. On triple systems and strongly regular graphs
21. Switching codes and designs
22. Classification of difference matrices over cyclic groups
23. Nearly Kirkman triple systems of order 18 and Hanani triple systems of order 19
24. Classification of the (0, 2)-graphs of valency 8
25. Steiner triple systems of order 19 and 21 with subsystems of order 7
26. Further results on the covering radius of small codes
27. Classification of Extremal Formally Self-Dual Even Codes of Length 22
28. Improved Bounds for Ternary Linear Codes of Dimension 8 Using Tabu Search
29. The Steiner quadruple systems of order 16
30. Kirkman triple systems with subsystems
31. Constructions of Maximum Few-Distance Sets in Euclidean Spaces
32. Improved Bounds for Quaternary Linear Codes of Dimension 6
33. On a hypercube coloring problem
34. Miscellaneous classification results for 2-designs
35. Optimal linear rate [formula omitted] codes over [formula omitted] and [formula omitted]
36. More c-Bhaskar Rao designs with small block size
37. A fast algorithm for the maximum clique problem
38. Bounds on codes over an alphabet of five elements
39. On Saturating Sets in Small Projective Geometries
40. Classification of binary/ternary one-error-correcting codes
41. Mappings of Butson-type Hadamard matrices
42. Switching of covering codes
43. A New Algorithm for the Maximum-Weight Clique Problem
44. Covering t-sets with ( t+2)-sets
45. There exists no Steiner system S(4,5,17)
46. LCL Problems on Grids
47. Independent domination of grids
48. On hypercube packings, blocking sets and a covering problem
49. Classification of Codes
50. Validity of Computational Results
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.