Minimal PD-sets for codes associated with the graphs $$Q^m_2$$, m even

For $$m\ge 4$$ even, the duals of p-ary codes, for any prime p, from adjacency matrices m-ary 2-cube $$Q^m_2$$ are shown to have subcodes with parameters $$[m^2,2m-2,m]$$ which minimal PD-sets size $$\frac{m}{2}$$ constructed, hence attaining full error-correction capabilities code, and, as such, most efficient sets permutation decoding.