The remoteness of the permutation code of the group U_{۶n}
عنوان مقاله: The remoteness of the permutation code of the group U_{۶n}
شناسه ملی مقاله: JR_ASYAZDT-3-2_005
منتشر شده در در سال 1395
شناسه ملی مقاله: JR_ASYAZDT-3-2_005
منتشر شده در در سال 1395
مشخصات نویسندگان مقاله:
Masoomeh Yazdani-Moghaddam - Department of Pure Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan, Iran
Reza Kahkeshani - Department of Pure Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan, Iran
خلاصه مقاله:
Masoomeh Yazdani-Moghaddam - Department of Pure Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan, Iran
Reza Kahkeshani - Department of Pure Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan, Iran
Recently, a new parameter of a code, referred to as the remoteness, has been introduced.This parameter can be viewed as a dual to the covering radius. It is exactly determined for the cyclic and dihedral groups. In this paper, we consider the group U_{۶n} as a subgroup of S_{۲n+۳} and obtain its remoteness. We show that the remoteness of the permutation code U_{۶n} is ۲n+۲. Moreover, it is proved that the covering radius of U_{۶n} is also ۲n+۲.
کلمات کلیدی: permutation code, permutation array, remoteness, group U_{۶n}
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/1579934/