PD-sets for the codes related to some classical varieties (Q2569931)

A permutation decoding set (PD set) is a subset of the automorphism group of the code such that every possible error vectors of weight less than or equal to the number of errors the code can correct can be sent by an element of this subset out of the information positions. These sets are useful in decoding received vectors. The authors generalize this definition to an arbitrary permutation set. They show how the automorphisms fixing a subset of the points in a projective space induce automorphisms of the code formed from this space. They produce PD-sets for Benz planes of small order and for ruled rational normal surfaces of order 3 in \(\text{PG}(4,3)\) and \(\text{PG}(4,4).\)