Abstract
Robust codes ${\mathcal {C}}(n,k)_q$C(n,k)q are nonlinear $q$q-ary codes of dimension $k$k and length $n\leq 2k$n≤2k. Robust codes can detect any error with nonzero probability; hence, they can effectively detect fault injection attacks. Most high rate robust codes are either restricted to certain ratios between $n$n and $k$k, or have relatively high hardware complexity. This paper presents new constructions for optimum or close to optimum low complexity high rate robust codes. These codes exist for any $k$k and $n$n. The hardware complexity of each construction is discussed, and a method to choose the one with the smallest implementation cost is presented.
Sign-in/Register to access full text options 
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
