Abstract

Algebraic manipulation detection codes were introduced in 2008 to protect data against a special type of its modification – an algebraic manipulation. There are three classes of codes: weak, strong and stronger ones. Weak codes detect only weak algebraic manipulations, while strong and stronger are capable to detect both weak and strong manipulations. In this paper, a method to transform codes from weak to stronger is described resulting in a construction of generalized robust codes. The proposed construction forms the second known family of stronger AMD codes. Codes provide simple procedures of error detectiona and correction, and allow using multi-code codec design that makes it applicable in fault-tolerant computing, storage and cryptographic devices.

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.