Abstract
The classification of unitals with parameters 2(28, 4, 1) according to the 2rank of their incidence matrices was initiated by McGuire, Tonchev and Ward, who proved that the 2rank of any unital on 28 points is greater than or equal to 19, and up to isomorphism, there is a unique unital with 2rank equal to 19. Jaffe and Tonchev investigated the next two 2ranks, 20 and 21, and showed that there are no unitals on 28 points with 2rank equal to 20, and there are exactly 4 isomorphism classes of unitals of rank 21. The subject of this paper is the classification of unitals having 2rank 22, 23 and 24.
Similar content being viewed by others
1 Introduction
We assume some basic familiarity with combinatorial designs and algebraic coding theory (cf. e.g. [2, 4, 24]).
Let V be a set of v points and \(\mathcal{B}\) be a collection of ksubsets of V called blocks. The pair \(\mathcal{D}=(V,\mathcal{B})\) is a t\((v,k,\lambda )\) design if every tsubset of V is contained in exactly \(\lambda\) blocks. The number of blocks of a t\((v,k,\lambda )\) design \(\mathcal{D}=(V,\mathcal{B})\) is equal to \(b=\mathcal{B}\)=\(\lambda \left( {\begin{array}{c}v\\ t\end{array}}\right) / \left( {\begin{array}{c}k\\ t\end{array}}\right)\), and every point of V appears in \(r = \lambda \left( {\begin{array}{c}v  1\\ t  1\end{array}}\right) / \left( {\begin{array}{c}k  1\\ t  1\end{array}}\right)\) blocks. The number r is called the replication number of \(\mathcal{D}\). An isomorphism between two designs \({\mathcal{D}}'\), \({\mathcal{D}}''\) is a bijection \(\phi\) between their point sets that maps every block of \({\mathcal{D}}'\) to a block of \({\mathcal{D}}''\). An automorphism of a design \({\mathcal{D}}\) is any isomorphism of \({\mathcal{D}}\) to itself. The set of all automorphisms of a design \(\mathcal{D}\) is a permutation group called the automorphism group of \(\mathcal{D}\).
The incidence matrix \(A=( a_{i,j})\) of a design \(\mathcal{D}\) is a \(b\times v\) (0, 1)matrix with rows indexed by the blocks and columns indexed by the points, where \(a_{i,j}=1\) if the ith block contains the jth point, and \(a_{i,j}=0\) otherwise.
If p is a prime number, the prank of a design is the rank of its incidence matrix A over the finite field \(\mathbb {F}_p\). A trivial upper bound on the prank of a design with \(k\equiv 0 \pmod p\) is \(v1\). A design has low rank if its prank is strictly smaller than \(v1\). The prank of a 2\((v,k,\lambda )\) design with \(v>k>0\) can be smaller than \(v1\) only if p divides \(r\lambda\) [10, 24, Thm. 1.86]. The code of a design over \(\mathbb {F}_p\) is the linear code spanned by the rows of its incidence matrix. If C is the code of a 2\((v,k,\lambda )\) design then the dual code \(C^\perp\) admits a majority logic decoding algorithm that can correct up to \([(r+\lambda 1)/(2\lambda )]\) errors (Rudolph [22], Ng [20]). This application motivates the interest in designs having low prank.
All codes in this paper are binary. Two codes \(L'\), \(L''\) that have the same length and dimension are equivalent if there is a permutation \(\phi\) of the n code coordinates that maps every codeword of \(L'\) to a codeword of \(L''\). An automorphism of a code L is any isomorphism of L to itself. Clearly, the codes of isomorphic designs are equivalent.
A unital in a projective plane \(\Pi\) of order \(q^2\) is a set U of \(q^3 +1\) points that intersects every line in either one or \(q+1\) points. The classical example is the Hermitian unital H(q), being the set of absolute points of a unitary polarity in \(PG(2,q^2)\). The line intersections with U of size \(q+1\) are the blocks of a 2\((q^3 +1, q+1,1)\) design. More generally, any design with parameters 2\((q^3 +1,q+1,1)\) is called a unital design, or unital for short, regardless of whether it arises from a projective plane of order \(q^2\) or not. An infinite class of unital designs with \(q=3^{2m+1}\) was found by Lüneburg [16] as designs invariant under the Ree groups of type \((G_2)\). Lüneburg proved that none of his unital designs can be embedded into a projective plane of order \(3^{4m+2}\) which is invariant under the corresponding Ree group.
A unital design with \(q=1\) is a trivial 2(2, 2, 1) design consisting of a single block of size 2. A unital design with \(q=2\) is unique up to isomorphism, being the 2(9, 3, 1) design of the points and lines of the affine plane of order 3, which also arises from a unitary polarity in the projective plane of order 4.
The unital designs for \(q=3\), namely the 2(28, 4, 1) designs, have not been classified completely. The unitals in the four projective planes of order 9 were classified by Penttila and Royle [21]: up to isomorphism, there are two unitals in PG(2, 9), four unitals in the Hall plane and its dual plane, and eight unitals in the Hughes plane. The 2(28, 4, 1) designs with nontrivial automorphisms were classified by Krčadinac [14]: there are 4466 such designs. In [3] Betten, Betten, and Tonchev used codes to classify all unitals containing a special spread and found that there are 909 such designs, 187 of which have a trivial automorphism group. In [12], Kaski and Östergård classified all resolvable 2(28, 4, 1) designs: there are seven such designs. A blocking set in a design is a subset of the point set that intersects every block in at least one point, but does not contain any block. In [1], AlAzemi, A. Betten and D. Betten classified all unital 2(28, 4, 1) designs with blocking sets and showed that there are 68,806 such designs, 68,484 of which have a trivial automorphism group. In [19] Mezőfi and Nagy introduced a new technique called paramodification to construct new designs from known ones and found 173 new 2(28, 4, 1) designs.
For the rest of the paper, we will focus on the case \(q=3\) and we will use the term unital synonymously for a 2(28, 4, 1) design. Since \(r=9, \lambda =1\) and \(r\lambda =8 = 2^3\), the prank of a 2(28, 4, 1) design can be smaller than 27 only if \(p=2\), and we will write rank instead of 2rank.
Another way to classify 2(28, 4, 1) designs is according to their rank. In 1981, Brouwer [7] computed the ranks and the binary codes of the classical Hermitian unital that has rank 21, the unital found by Lüneburg which Brouwer called the Ree unital and has 2rank 19, and 136 other unitals found by computer, with ranks ranging from 21 to 27.
In [18] McGuire, Tonchev, and Ward proved that the rank of a unital on 28 points is greater than or equal to 19, with equality achieved by the Ree unital only.
Although the unique 2(28, 4, 1) design of rank 19 is not embeddable in any of the projective planes of order 9, this design has a nice geometric interpretation, namely, it is isomorphic to a design associated with a maximal arc of degree 4 in the projective plane of order 8. Recall that a maximal arc of degree d in a projective plane \(\Pi\) of order \(q=sd\) is a set \({\mathcal {A}}\) of \((s(d1)+1)d\) points, such that every line is either disjoint from \({\mathcal {A}}\) or intersects \({\mathcal {A}}\) in exactly d points. If \(d>1\), the nonempty intersections of lines of \(\Pi\) with \({{\mathcal {A}}}\) are the blocks of a 2\(((s(d1)+1)d,d,1)\) design. The set of lines of \({\mathcal {P}}\) which have no points in common with \({\mathcal {A}}\) determine a maximal arc of degree s in the dual plane \(\Pi ^\perp\), called the dual arc \({{\mathcal {A}}}^\perp\). A hyperoval is a maximal arc of degree 2. In particular, if \({\mathcal {A}}\) is a hyperoval in the projective plane of order 8, then the dual arc \({\mathcal {A}}^\perp\) is a maximal arc of degree 4 that determines a 2(28, 4, 1) design having 2rank 19. This design is a member of an infinite class of 2\((2^{2t1} 2^{t1}, 2^{t1},1)\) designs associated with dual arcs of hyperovals in the Desarguesian plane of order \(2^t\), \(PG(2,2^t)\). It was proved by Mackenzie [17] that the 2rank of any such design is greater than or equal to \(3^t  2^t\), and Carpenter [8] proved that the 2rank is equal to \(3^t 2^t\) if the related hyperoval is regular. It is conjectured that the 2rank of every maximal arc of degree \(2^{t1}\) in \(PG(2,2^t)\) is equal to \(3^t  2^t\) [26].
In [11] Jaffe and Tonchev proved that there are no unitals of rank 20, and classified the unitals of rank 21. There are exactly four nonisomorphic unitals of rank 21. One of these unitals is the Hermitian unital H(3) with a full automorphism group of order 12,096, while the remaining three unitals have automorphism groups of order 192, 24, and 6, respectively. The four binary codes of dimension 21 of the four unitals of rank 21 are pairwise inequivalent.
In this paper, we report the classification of unitals of ranks 22, 23, and 24. There are 12 isomorphism classes of unitals of 2rank 22, 78 isomorphism classes of unitals of 2rank 23, four of which have a trivial automorphism group, and 298 isomorphism classes of unitals of 2rank 24, 38 of which have a trivial automorphism group.
2 Classification method
Our classification method extends the work of Jaffe and Tonchev [11], but we used different software tools. An abstract description of the classification is given in Algorithm 1, where C denotes the binary \([28,{{\,\mathrm{rk}\,}}]\) code of a 2(28, 4, 1) design of rank \({{\,\mathrm{rk}\,}}\), and d is the minimum weight of the dual code \(C^\perp\).
Algorithm 1
Input: A fixed rank \({{\,\mathrm{rk}\,}}\ge 19\).
Output: All nonisomorphic 2(28, 4, 1) designs of rank \(\le {{\,\mathrm{rk}\,}}\).

1.
Classify the binary linear \([28, 28{{\,\mathrm{rk}\,}}, d\ge 10]\) codes \(C^\perp\) that meet all known restrictions.

2.
For each code \(C^\perp\) from 1) do:

a.
Compute the set of all codewords of C of weight 4.

b.
Enumerate all unitals having incidence matrices with rows being codewords of C of weight 4.

c.
Classify the unitals obtained from C up to isomorphism.

a.

3.
Classify the unitals obtained from all codes obtained in 1).
Remark
We applied Algorithm 1 successively for \({{\,\mathrm{rk}\,}}=22, 23, 24\) and compared the outcome of each rank with the previous results on smaller ranks. The check if the determined numbers of unitals of rank \(< {{\,\mathrm{rk}\,}}\) are confirmed by known results is a necessary condition for the computer programs to be correct.
2.1 Code restrictions
A binary code is even if all codewords have even weight, and doublyeven if all codewords are of weight divisible by 4. An [n, k, d] code C is a linear code of length n, dimension k, and minimum weight d. The dual code \(C^\perp\) of an [n, k, d] code is the linear code of length n and dimension \(nk\) consisting of all vectors that are orthogonal to every codeword of C. A code C is selforthogonal if \(C\subseteq C^\perp\). A linear binary code is selfcomplementary if it contains the allone vector. It was pointed out by Brouwer [7] that every codeword of weight 12 in the dual code of the binary code of any unital U on 28 points is the sum of the incidence vectors of three pairwise disjoint blocks of U.
The binary codes of 2(28, 4, 1) designs have been studied in [7, 11, 18]. Here, we summarize the properties of such codes that we used in the computation.
Lemma 1
([11], Lemma 2.2)

1.
The binary code C of a unital of 2rank \({{\,\mathrm{rk}\,}}\) is an even selfcomplementary \([28, {{\,\mathrm{rk}\,}}]\) code.

2.
Its dual code \(C^\perp\) is an even selfcomplementary \([28, 28{{\,\mathrm{rk}\,}},d\ge 10]\) code.

3.
The codewords of weight divisible by 4 form a doublyeven selfcomplementary [28, t, 12] code for some \(t\le 28{{\,\mathrm{rk}\,}}\).
In order to determine the possible values of t the following result can be used.
Lemma 2
([11, Lemma 2.4]) Let C be an even binary linear [n, k] code and D be the subset of codewords of weight divisible by 4 of C. If t denotes the maximum dimension of a doublyeven subcode in \(C^\perp\), then
Statement 3 of Lemmas 1 and 2 imply the following.
Corollary 1
If C is the binary code of a 2(28, 4, 1) design then D is a doublyeven subcode of \(C^\perp\) of dimension smaller than or equal to t. This implies that \(2^t\) is one of the numbers in (1).
3 The computation
3.1 Unitals of rank 22
The code C of a 2(28, 4, 1) design of rank 22 is a linear binary code of dimension 22 and its dual code \(C^\perp\) has dimension 6. It follows from Corollary 1 that the dimension of the selfcomplementary doublyeven subcode of \(C^\perp\) is greater than or equal to 4.
We classified the selfcomplementary doubly even [28, 4, 12] codes with the algorithm described in [6], using the software tools solvediophant by the second author [28, 29] and codecan by Feulner [9]. There are four equivalence classes of such codes.
These four codes can be extended to 128 selfcomplementary even \([28, 5, d\ge 10]\) codes. This was done with an algorithm similar to the one described in [5, 15] but with a less sophisticated approach to suppress the generation of isomorphic copies. Again, solvediophant and codecan were used. The 128 selfcomplementary even \([28, 5, d\ge 10]\) codes were extended to \(15\,007\) selfcomplementary even \([28, 6, d\ge 10]\) codes.
For each of these codes, the set of all codewords of weight 4 was constructed and tested if it contains unitals. Clearly, the incidence matrix of any unital consists of 63 codewords of weight 4 that form a constant weight code with minimum distance 6. Using the exact cover solver dlx by Knuth [13], it turns out that there are \(661\,504\) unitals that arise from 124 codes, and these unitals fall into 17 isomorphism classes. For the latter computation, the GAP design package by Soicher [23] was used.
The 17 isomorphism classes consist of one unital of rank 19, four unitals of rank 21, and 12 unitals of rank 22, confirming the results of [11, 18]. The 12 unitals of rank 22 all have nontrivial automorphisms and therefore appear already in [14].
The 12 unitals of rank 22 span ten inequivalent codes of dimension 22: nine codes contain a single isomorphism class of unitals of 2rank 22, and one code contains three isomorphism classes of unitals of 2rank 22. The distribution of unitals among the ten codes according to their rank and automorphism group order is given in Table 1, where the second column contains the order of the automorphism group and 2rank of the unitals contained in the code. The entry \((48,22)^2\) in the last row of Table 1 indicates that the code contains two isomorphism classes of unitals of rank 22 having full automorphism group of order 48.
As a check of correctness, we computed the codes of all 17 unitals and searched for all unitals contained in these codes. The GAP design package reduced the list of unitals to the same set of 17 unitals.
3.2 Unitals of rank 23
The code C of a 2(28, 4, 1) design of rank 23 is a linear binary code of dimension 23 and its dual code \(C^\perp\) has dimension 5.
It follows from Corollary 1 that the selfcomplementary doublyeven subcode of \(C^\perp\) has dimension 3.
Using the same approach as in the rank 22 case, we found that there are exactly two inequivalent selfcomplementary doublyeven [28, 3, 12] codes. The extension steps to determine all selfcomplementary even \([28, 5, d\ge 10]\) codes give 34 selfcomplementary even \([28, 4, d\ge 10]\) codes and 880 selfcomplementary even \([28, 5, d\ge 10]\) codes.
In contrast with the rank 22 case, a straightforward application of dlx for the search of unitals in the sets of codewords of weight 4 was not feasible for the codes of dimension 23, because the resulting exact cover problems were too time consuming. Instead, we first classified all derived 1(27, 3, 1) designs with respect to point 28 under the stabilizer of the automorphism group of the code. In other words, all feasible, nonisomorphic combinations of 9 blocks through point 28 were enumerated, and each of these 9blockconfigurations was extended to unitals using dlx.
Among the 880 [28, 23] codes, 126 codes contain together \(16\,911\) unitals which fall into 95 isomorphism classes. The set of 95 nonisomorphic unitals consists of one unital of rank 19, four unitals of rank 21, 12 unitals of rank 22, and 78 unitals of rank 23. Again, the results of [11, 18] and of the rank 22 case are confirmed. Among the 78 unitals of rank 23, there are exactly four unitals with trivial automorphism group.
The 78 unitals of rank 23 span 30 inequivalent [28, 23] codes, see Table 2, where an entry (a, b) denotes a unital of rank b with a full automorphism group of order a, and \((a,b)^s\) denotes s nonisomorphic unitals of rank b with a full automorphism group of order a.
3.3 Unitals of rank 24
The code C of a 2(28, 4, 1) design of rank 24 is a linear binary code of dimension 24 and its dual code \(C^\perp\) has dimension 4.
It follows from Corollary 1 that the selfcomplementary doublyeven subcode of \(C^\perp\) has dimension 2. It is easy to see that, up to equivalence, there is only one such code, and this code can be extended to nine selfcomplementary even \([28, 3, d\ge 10]\) codes and 82 selfcomplementary even \([28, 4, d\ge 10]\) codes.
The straightforward enumeration of unitals in the sets of codewords of weight 4 as in the rank 22 case was not possible here, and even the approach of the rank 23 case was too time consuming. In order to reduce the enumeration time even further, for each code we determined a transversal of all block orbits containing point 28 under the stabilizer of 28 of the automorphism group of the code, i.e. all possibilities were determined to fix one block. For each of these blocks, all 1(27, 3, 1) designs that contain that block were enumerated, and all possibilities to fix nine blocks were classified. Finally, each of these sets of nine blocks is extended to unitals.
Among the 82 codes, 39 codes contain \(7\,663\,704\) unitals (with the appropriate 9blockconfigurations) which fall into 393 isomorphism classes.
Again, the results of [11, 18] and the rank 22 and rank 23 cases were confirmed, leaving 298 unitals of rank 24. It turns out that 38 unitals of rank 24 have a trivial automorphism group. The 298 unitals of rank 24 span 31 inequivalent codes, see Table 3.
In all cases, computations involving groups were done with GAP [25]. The complete list of unitals up to rank 24 can be downloaded from [27].
4 Summary
The set of all pairwise nonisomorphic 2(28, 4, 1) designs of 2rank up to 24 consists of

the unital of rank 19 associated with a maximal arc of degree 4 in PG(2, 8);

four unitals of rank 21 (all nonrigid);

12 unitals of rank 22 (all nonrigid);

78 unitals of rank 23 (four rigid, 74 nonrigid);

298 unitals of rank 24 (38 rigid, 260 nonrigid).
The distribution of the unitals according to their rank and order of the automorphism group is given Table 4. The numbers of unitals with nontrivial automorphism groups coincide with the results of Krčadinac [14], and that gives further confidence in the correctness of the computations.
The enumeration of unitals of rank 25 and 26, as well as a full classification seems to be still out of reach with the approach described in this paper.
References
AlAzemi, A., Betten, A., Betten, D.: Unital designs with blocking sets. Discrete Appl. Math. 163, 102–112 (2014). https://doi.org/10.1016/j.dam.2013.02.023(Optimal Discrete Structures and Algorithms ODSA 2010)
Beth, T., Jungnickel, D., Lenz, H.: Design Theory, vol. 1, 2nd edn. Cambridge University Press, Cambridge (1999)
Betten, A., Betten, D., Tonchev, V.D.: Unitals and codes. Discrete Math. 267(1–3), 23–33 (2003). https://doi.org/10.1016/S0012365X(02)006003
Betten, A., Braun, M., Fripertinger, H., Kerber, A., Kohnert, A., Wassermann, A.: ErrorCorrecting Linear Codes: Classification by Isometry and Applications (Algorithms and Computation in Mathematics), 1st edn. Springer, Berlin (2006)
Bouyukliev, I., Bouyuklieva, S., Kurz, S.: Computer classification of linear codes. IEEE Trans. Inf. Theory 1, 1 (2021). https://doi.org/10.1109/TIT.2021.3114280
Braun, M., Kohnert, A., Wassermann, A.: Optimal linear codes from matrix groups. IEEE Trans. Inf. Theory 51(12), 4247–4251 (2005). https://doi.org/10.1109/TIT.2005.859291
Brouwer, A.E.: Some unitals on 28 points and their embeddings in projective planes of order 9. In: Aigner, M., Jungnickel, D. (eds.) Geometries and Groups, pp. 183–188. Springer, Berlin (1981)
Carpenter, L.L.: Oval designs in desarguesian projective planes. In: Tonchev, V. (ed.) Codes, Designs and Geometry, pp. 47–55. Springer US, Boston (1996). https://doi.org/10.1007/9781461314233_4
Feulner, T.: The automorphism groups of linear codes and canonical representatives of their semilinear isometry classes. Adv. Math. Commun. 3(4), 363–383 (2009)
Hamada, N.: On the \(p\)rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error correcting codes. Hiroshima Math. J. 3(1), 153–226 (1973)
Jaffe, D.B., Tonchev, V.D.: Computing linear codes and unitals. Des. Codes Cryptogr. 14(1), 39–52 (1998). https://doi.org/10.1023/A:1008204420606
Kaski, P., Östergård, P.: Classification of resolvable balanced incomplete block designs—the unitals on 28 points. Math. Slovaca 59(2), 121–136 (2009). https://doi.org/10.2478/s1217500901138
Knuth, D.E.: The Art of Computer Programming, vol. 4: Combinatorial Algorithms, Fascicle 5. AddisonWesley, Boston (2020)
Krčadinac, V.: Steiner \(2\)designs \({S}(2,4,28)\) with nontrivial automorphisms. Glas. Mat. 37(57), 259–268 (2002)
Kurz, S.: LinCode—Computer Classification of Linear Codes (2019)
Lüneburg, H.: Some remarks concerning the Reed groups of type \((G_2)\). J. Algebra 3, 256–259 (1966)
Mackenzie, K.: Codes of Designs. Ph.D. thesis, University of Birmingham (1989)
McGuire, G., Tonchev, V.D., Ward, H.N.: Characterizing the Hermitian and Ree unitals on 28 points. Des. Codes Cryptogr. 13(1), 57–61 (1998). https://doi.org/10.1023/A:1008246022572
Mezőfi, D., Nagy, G.P.: New Steiner 2designs from old ones by paramodifications. Discrete.Appl. Math. 288, 114–122 (2021). https://doi.org/10.1016/j.dam.2020.08.026
Ng, S.W.: On Rudolph’s majoritylogic decoding algorithm (corresp.). IEEE Trans. Inf. Theory 16(5), 651–652 (1970). https://doi.org/10.1109/TIT.1970.1054513
Penttila, T., Royle, G.F.: Sets of type \((m, n)\) in the affine and projective planes of order nine. Des. Codes Cryptogr. 6, 229–245 (1995)
Rudolph, L.D.: A class of majority logic decodable codes (corresp.). IEEE Trans. Inf. Theory 13(2), 305–307 (1967). https://doi.org/10.1109/TIT.1967.1053994
Soicher, L.H.: The DESIGN package for GAP, Version 1.7 (2019). https://www.gapsystem.org/Packages/design.html
Tonchev, V.D.: Codes. In: Colbourn, C.J., Dinitz, J.H. (eds.) Handbook of Combinatorial Designs, Chap. VI.1, 2nd edn., pp. 677–702. Hoboken, CRC (2007). https://doi.org/10.1016/S15707954(07)05005X
The GAP Group: GAP—Groups, Algorithms, and Programming, Version 4.11.1 (2021). https://www.gapsystem.org
Tonchev, V.D.: On resolvable Steiner 2designs and maximal arcs in projective planes. Des. Codes Cryptogr. 84(1–2), 165–172 (2017). https://doi.org/10.1007/s1062301602432
Tonchev, V.D., Wassermann, A.: On the classification of unitals on 28 points of low rank (2022). https://doi.org/10.15495/do_ubt_2065(accompanying data set)
Wassermann, A.: Attacking the market split problem with lattice point enumeration. J. Comb. Optim. 6, 5–16 (2002)
Wassermann, A.: Search for combinatorial objects using lattice algorithms—revisited. In: Flocchini, P., Moura, L. (eds.) Combinatorial Algorithms, pp. 20–33. Springer International Publishing, Cham (2021)
Funding
Open Access funding enabled and organized by Projekt DEAL.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Tonchev, V., Wassermann, A. On the classification of unitals on 28 points of low rank. AAECC 33, 903–913 (2022). https://doi.org/10.1007/s0020002200541y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s0020002200541y