Minimal PD-sets for codes associated with the graphs Qm2, m even

J. D. Key*, B. G. Rodrigues

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (SciVal)
89 Downloads (Pure)


For m≥4m≥4 even, the duals of p-ary codes, for any prime p, from adjacency matrices for the m-ary 2-cube Qm2Q2m are shown to have subcodes with parameters [m2,2m−2,m][m2,2m−2,m] for which minimal PD-sets of size m2m2 are constructed, hence attaining the full error-correction capabilities of the code, and, as such, the most efficient sets for full permutation decoding.

Original languageEnglish
Pages (from-to)57-66
Number of pages10
JournalApplicable Algebra in Engineering, Communications and Computing
Issue number1
Early online date05 Jan 2021
Publication statusPublished - 01 Jan 2023


  • LCD codes
  • Lee graphs
  • Permutation decoding


Dive into the research topics of 'Minimal PD-sets for codes associated with the graphs Qm2, m even'. Together they form a unique fingerprint.

Cite this