شماره ركورد كنفرانس :
4329
عنوان مقاله :
Permutation codes and their parameters
پديدآورندگان :
Kahkeshani R. kahkeshanireza@kashanu.ac.ir Department of Pure Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan, I. R. Iran , Yazdani-Moghaddam M. m.yazdani.m@grad.kashanu.ac.ir Faculty of Mathematical Sciences, University of Kashan, Kashan, I. R. Iran
كليدواژه :
permutation code , remoteness , covering radius.
عنوان كنفرانس :
نهمين كنفرانس ملي نظريه گروههاي ايراني
چكيده فارسي :
A permutation code of length n and distance d is a subset of Sn that the Hamming distance
between each distinct elements of it, is d. Th ere are some parameters of a code, such as diameter,
radius and covering radius. Recently, a new parameter of a code, referred to as the remoteness,
has been introduced, that can be viewed as a dual to the covering radius. In this note we determine
some results on the remoteness and covering radius for permutation codes.
