TL;DR: A new class of asymptotically good codes is constructed by iteratively superimposing Justesen codes on a Justesesen code.
Abstract: A new class of asymptotically good codes is constructed by iteratively superimposing Justesen codes on a Justesen code. The lower bound for the new codes lies above the Zyahlov bound for rate r, 0.31 .