Self-embeddings of Hamming Steiner triple systems of small order and APN permutations
نویسندگان
چکیده
The classification, up to isomorphism, of all self-embedding monomial power permutations of Hamming Steiner triple systems of order n = 2m − 1 for small m, m ≤ 22, is given. As far as we know, for m ∈ {5, 7, 11, 13, 17, 19}, all given self-embeddings in closed surfaces are new. Moreover, they are cyclic for all m and nonorientable at least for all m ≤ 19. For any non prime m, the nonexistence of such self-embeddings in a closed surface is proven. The rotation line spectrum for self-embeddings of Hamming Steiner triple systems in pseudosurfaces with pinch points as an invariant to distinguish APN permutations or, in general, to classify permutations, is also proposed. This classification for APN monomial power permutations coincides with the CCZ-equivalence, at least up to m ≤ 17.
منابع مشابه
Steiner triple ( quadruple ) systems of small ranks embedded into perfect ( extended perfect ) binary codes 1
It is shown that a class of Steiner triple systems of order 2−1, obtained by some special switchings from the Hamming Steiner triple system, is embedded into some perfect code, constructed by known switchings of ijk-components from the binary Hamming code. The number of Steiner triple systems of order n and rank less or equal n− log(n + 1) + 2, embedded into perfect binary codes of length n, is...
متن کاملSelf-embeddings of doubled affine Steiner triple systems
Given a properly face two-coloured triangulation of the graph Kn in a surface, a Steiner triple system can be constructed from each of the colour classes. The two Steiner triple systems obtained in this manner are said to form a biembedding. If the systems are isomorphic to each other it is a self-embedding. In the following, for each k ≥ 2, we construct a self-embedding of the doubled affine S...
متن کاملOn the Bi-embeddability of Certain Steiner Triple Systems of Order 15
There are 80 non-isomorphic Steiner triple systems of order 15. A standard listing of these is given in [8]. We prove that systems #1 and #2 have no biembedding together in an orientable surface. This is the first known example of a pair of Steiner triple systems of order n, satisfying the admissibility condition n ≡ 3 or 7 (mod 12), which admits no orientable bi-embedding. We also show that th...
متن کاملSurface embeddings of Steiner triple systems
A Steiner triple system of order n (STS(n)) is said to be embeddable in an orientable surface if there is an orientable embedding of the complete graph Kn whose faces can be properly 2-coloured (say, black and white) in such a way that all black faces are triangles and these are precisely the blocks of the STS(n). If, in addition, all white faces are triangular, then the collection of all white...
متن کاملOn 2-ranks of Steiner triple systems
Our main result is an existence and uniqueness theorem for Steiner triple systems which associates to every such system a binary code | called the \carrier" | which depends only on the order of the system and its 2-rank. When the Steiner triple system is of 2-rank less than the number of points of the system, the carrier organizes all the information necessary to construct directly all systems ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Des. Codes Cryptography
دوره 75 شماره
صفحات -
تاریخ انتشار 2015