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

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

*Awdur cyfatebol y gwaith hwn

Allbwn ymchwil: Cyfraniad at gyfnodolynErthygladolygiad gan gymheiriaid

1 Dyfyniad (Scopus)
101 Wedi eu Llwytho i Lawr (Pure)

Crynodeb

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.

Iaith wreiddiolSaesneg
Tudalennau (o-i)57-66
Nifer y tudalennau10
CyfnodolynApplicable Algebra in Engineering, Communications and Computing
Cyfrol34
Rhif cyhoeddi1
Dyddiad ar-lein cynnar05 Ion 2021
Dynodwyr Gwrthrych Digidol (DOIs)
StatwsCyhoeddwyd - 01 Ion 2023

Ôl bys

Gweld gwybodaeth am bynciau ymchwil 'Minimal PD-sets for codes associated with the graphs Qm2, m even'. Gyda’i gilydd, maen nhw’n ffurfio ôl bys unigryw.

Dyfynnu hyn