Concatenated codes: serial and parallel

In this paper, new construction methods of parallel-concatenated codes that are analogous to more traditional serial concatenations are presented (for instance, Forney´s concatenated codes). Improved lower bounds on error exponents attainable under linear-time decoding are established. As the rate approaches the capacity of a binary symmetric channel, these exponents come arbitrarily close to the sphere-packing bound.