Abstract
It is known that Z ps -linear codes, which are the Gray map image of Z ps -additive codes (linear codes over Z ps ), are systematic and a systematic encoding has been found. This makes Z ps -linear codes suitable to apply the permutation decoding method, based on the existence of r -PD-sets, which are subsets of the permutation automorphism group of the code. Some constructions of r -PD-sets of minimum size r +1 for Z ps -linear generalized Hadamard codes of type ( n ; t 1 , …, ts ) are known. In this paper, for these codes, we present new constructions of r -PD-sets of size r +1, which are suitable for all parameters t 1 , …, ts . These allow us to obtain new r -PD-sets for values of r closer to the theoretical upper bound, improving previous known results.
Funding Information
  • Spanish Ministerio de Economía, Industria y Competitividad (PID2022-137924NB-I00 (AEI/10.13039/501100011033))
  • Catalan Agencia de Gestió d’Ajuts Universitaris i de Recerca (2021 SGR 00643)

This publication has 38 references indexed in Scilit: