Remoteness of permutation codes

Details Remoteness of permutation codes Remoteness of permutation codes

2011-10-10

arxiv.org/abs/1110.2028v2

Mathematics

Combinatorics

Scientific paper

In this paper, we introduce a new parameter of a code, referred to as the remoteness, which can be viewed as a dual to the covering radius. Indeed, the remoteness is the minimum radius needed for a single ball to cover all codewords. After giving some general results about the remoteness, we then focus on the remoteness of permutation codes. We first derive upper and lower bounds on the minimum cardinality of a code with a given remoteness. We then study the remoteness of permutation groups. We show that the remoteness of transitive groups can only take two values, and we determine the remoteness of transitive groups of odd order. We finally show that the problem of determining the remoteness of a given transitive group is equivalent to determining the stability number of a related graph.

Affiliated with

Also associated with

No associations

Rating

Remoteness of permutation codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Remoteness of permutation codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Remoteness of permutation codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-147172