Linear Programming Decoding of Non-Linear Sparse-Graph Codes

Abstract

In modern coding theory, linear code constructions are mainly used. Their properties and fundamental theoretical limits are well studied, and they are successfully applied to different classes of problems. Until now, non-linear codes did not attract much attention from specialists because linear structures have coped with their tasks and have the required research tools developed earlier. But in a series of works devoted to the study of codes with graceful degradation, H. Roozbehani, and Y. Polyanskiy proposed the construction of non-linear low-density majority codes (LDMC) and effective encoding and decoding algorithms for them. Moreover, they showed that LDMC has a lower bit error rate (BER) than any linear code in the error-reducing regime for the binary erasure channel (BEC). Given this motivation, we consider non-linear sparse-graph codes (a generalized version of LDMC) and investigate their performance in the AWGN channel. For this class of codes, we proposed efficient generalized BP-based and LP-based decoding algorithms. We accurately estimated BER under ML decoding of non-linear codes based on the LP-based decoder. Also, by simulation, we carried out the analysis and comparison of performances of various non-linear codes.