Decoding generalised hyperoctahedral groups and asymptotic analysis of correctible error patterns

Robert Bailey, Thomas Prellberg


We demonstrate a majority-logic decoding algorithm for decoding the

generalised hyperoctahedral group $C_m \wr S_n$ when thought of as

an error-correcting code. We also find the complexity of this

decoding algorithm and compare it with that of another, more general, algorithm.

Finally, we enumerate the number of error patterns exceeding the

correction capability that can be successfully decoded by this

algorithm, and analyse this asymptotically.

Full Text:


Comments on this article

View all comments

Contributions to Discrete Mathematics. ISSN: 1715-0868