We consider codes for channels with extreme noise that emerge in various low-power applications. Simple LDPC codes with parity checks of weight 3 are first studied for any code dimension m → ∞. These codes form modulation schemes: they improve the original channel outputs for any SNR > -6 dB (per information bit) and gain 3 dB over uncoded modulation as SNR grows. However, they also have a floor on the output bit error rate (BER) irrespective of their length. Tight lower and upper bounds, which are virtually identical to simulation results, are then obtained for BER at any SNR. We also study a combined scheme that splits$m$information bits into$b$blocks and protects each with some polar code. Decoding moves back and forth between polar and LDPC codes, every time using a polar code of a higher rate. For m → ∞and a sufficiently large parameter b, this design yields a vanishing BER at any SNR above the Shannon limit of -1.59 dB and has complexity order of m log m per information bit.

We combine polar and LDPC codes to address data correction for various low-power applications. We first use long low-rate LDPC codes that have parity checks of a low weight. Decoding performs several iterations of the belief propagation (BP) algorithm that recalculates the information bits only. Partially corrected bits are then passed to a short polar code that uses successive cancellation list (SCL) decoder. The newly corrected bits then serve as the new inputs for an LDPC decoder. For codes of rate less than 0.1, the algorithm performs on par with a CA-SCL decoder, while substantially reducing its latency.