Permutation codes over Sylow 2-subgroups $$$Syl_2(S_{2^n})$$$ of symmetric groups $$$S_{2^n}$$$

V.A. Olshevska (National University of Kyiv-Mohyla Academy)


The permutation code (or the code) is well known object of research starting from 1970s. The code and its properties is used in different algorithmic domains such as error-correction, computer search, etc. It can be defined as follows: the set of permutations with the minimum distance between every pair of them. The considered distance can be different. In general, there are studied codes with Hamming, Ulam, Levensteins, etc. distances.
In the paper we considered permutations codes over 2-Sylow subgroups of symmetric groups with Hamming distance over them. For this approach representation of permutations by  rooted labeled binary trees is used. This representation was introduced in the previous author's paper. We also study the property of the Hamming distance defined on permutations from Sylow 2-subgroup $$$Syl_2(S_{2^n})$$$ of symmetric group $$$S_{2^n}$$$ and describe an algorithm for finding the Hamming distance over elements from Sylow 2-subgroup of the symmetric group with complexity $$$O(2^n)$$$.     
The metric properties of the codes that are defined on permutations from Sylow 2-subgroup $$$Syl_2(S_{2^n})$$$ of symmetric group $$$S_{2^n}$$$ are studied. The capacity and number of codes for the maximum and the minimum non-trivial distance over codes are characterized.


permutation codes; Sylow 2-subgroup; symmetric group; Hamming distance

Full Text:



Bailey R.F. "Error-correcting codes from permutation groups", Discrete Math., 2009; 309(13): pp. 4253-4265. doi:10.1016/j.disc.2008.12.027

Blake I.F., Cohen G., Deza M. "Coding with permutations.", Inf. Control, Acad. Press, 1979; 43: pp. 1-19. doi:10.1016/S0019-9958(79)90076-7

Cameron P.J. "Permutation codes", European J. Comb., 2010; 31(2): pp. 482-490. doi:10.1016/j.ejc.2009.03.044

Chee Y.M., Purkayastha P. "Efficient decoding of permutation codes obtained from distance preserving maps", 2012 IEEE Int. Symp. on Inf. Theor. Proc., 2012; pp. 636-640. doi:10.1109/ISIT.2012.6284273

Dénes J. "On some connections between permutations and coding", Discrete Math., 1985; 56: pp. 141-146. doi:10.1016/0012-365X(85)90022-6

Farnoud F., Skachek V., Milenkovic O. "Error-correction in flash memories via codes in the Ulam metric", IEEE Trans. Inf. Theory, 2013; 59(5): pp. 3003-3020. doi:10.1109/TIT.2013.2239700

Grigorchuk R.I., Nekrashevich V.V., Sushchanskii V.I. "Automata, dynamical systems, and groups", Dynamical systems, automata, and infinite groups, Transl. from the Russian. MAIK Nauka/Interperiodica Publishing, 2000; pp. 128-203.

Huczynska S. "Powerline communication and the 36 officers problem", Phil. Trans. R. Soc. A, 2006; 364: 3199-3214. doi:10.1098/rsta.2006.1885

Irurozki E., Calvo B., Lozano J.A. "Sampling and learning the Mallows and Weighted Mallows models under the Hamming distance", Tech. Rep. Univ. of the Basque Country, 2014;

Olshevska V.A. "Algorithms for computations with Sylow 2-subgroups of symmetric groups", Silesian J. Pure Appl. Math., 2020; 10: pp. 103-120.

Olshevska V.A. "Algorithm for finding the number of unfixed points for permutations of Sylow 2-subgroups $$$Syl_2(S_{2^n})$$$ of symmetric groups $$$S_{2^n}$$$", Accepted in Mohyla Math. J.

Diestel R. Graph theory. 5th ed. Grad. Texts Math., Springer, 2017.




  • There are currently no refbacks.

Copyright (c) 2021 V.A. Olshevska

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Registered in

ISSN (Online): 2664-5009
ISSN (Print): 2664-4991