Generalized concatenated code constructions with low overhead for optical channels and NAND-flash memory
Igor V. Zhilin, Alexey Kreshchuk · 2016
We propose an error-correcting code construction that allows constructing codes with low overhead (less than 20%) and long length (10000 bits and more) that have good error correction performance and relatively low decoding complexity. A way of reducing decoder latency is proposed. Decoding complexity is estimated and compared to complexity of decoding BCH code.