Robust codes C(n, k)_q are nonlinear q-ary codes of dimension k and length 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 and 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 and n. The hardware complexity of each construction is discussed, and a method to choose the one with the smallest implementation cost is presented.