Abstract

In this paper a generalization of classic Mollard construction for any code length is given. It is shown that such generalized codes have property of partial robustness. This construction has less undetectable and miscorrected errors than the traditional linear error-correcting codes, just as than the generalized Vasil'ev code for some code parameters, thereby providing better protection against multiple bit errors.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call