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.
|Number of pages||10|
|Journal||Applicable Algebra in Engineering, Communications and Computing|
|Early online date||05 Jan 2021|
|Publication status||Published - 01 Jan 2023|
- LCD codes
- Lee graphs
- Permutation decoding