Majority-logic decoding algorithm improves understanding of error patterns in error-correcting codes, suggesting better performance.
We demonstrate a majority-logic decoding algorithm for decoding the generalised hyperoctahedral group Cm≀Sn 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.
No takes yet. Share an insight, caveat, or question.
Bailey et al. (2012) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: