Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5777304 | Electronic Notes in Discrete Mathematics | 2017 | 6 Pages |
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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Darya Kovalevskaya,