Martijn Brehm

Linear time encodable binary code achieving GV bound with linear time encodable dual achieving GV bound

We initiate the study of what we term “fast good codes” with “fast good duals.” Specifically, we consider the task of constructing a rate 1/2 binary linear code such that both it and its dual are asymptotically good (in fact, have rate-distance tradeoff approaching the GV bound),...