also co-invented the Berlekamp–Rabin algorithm, Berlekamp–Zassenhaus algorithm, and the Berlekamp–Van Lint–Seidel graph. Berlekamp had also been active...

In graph theory, the Berlekamp–Van Lint–Seidel graph is a locally linear strongly regular graph with parameters ( 243 , 22 , 1 , 2 ) {\displaystyle (243...

Seidel adjacency matrix Seidel switching J. H. van Lint at the Mathematics Genealogy Project B. van Asch, A. Blokhuis, H. Hollmann, W. Kantor, H. van...

These two graphs are the nine-vertex Paley graph (the graph of the 3-3 duoprism) with parameters (9,4,1,2) and the Berlekamp–van Lint–Seidel graph with parameters...

regular graphs also have a number of vertices that is a power of three, including the Brouwer–Haemers graph (81 vertices), Berlekamp–van Lint–Seidel graph (243...

24). The Cameron graph is an srg(231, 30, 9, 3). The Berlekamp–van Lint–Seidel graph is an srg(243, 22, 1, 2). The McLaughlin graph is an srg(275, 112...

regular graphs include the Brouwer–Haemers graph (81,20,1,6), the Berlekamp–van Lint–Seidel graph (243,22,1,2), the Cossidente–Penttila graph (378,52...

(243,22,1,2). This graph is the Berlekamp–Van Lint–Seidel graph. van Lint, J. H.; Brouwer, A. E. (1984), "Strongly regular graphs and partial geometries"...

represented as a graph with the same number of vertices and edges. Like the Berlekamp–van Lint–Seidel graph and the unknown solution to Conway's 99-graph problem...

fault-tolerant quantum computing known as magic state distillation. Berlekamp–van Lint–Seidel graph Binary Golay code Prakash, Shiroman (September 2020). "Magic...