New decoding algorithms for binary linear codes based on the concave-convex procedure are presented. Numerical experiments show that the proposed decoding algorithms surpass Belief Propagation (BP) decoding in error performance. Average computational complexity of one of the proposed decoding algorithms is only a few times greater than that of the BP decoding.

In this letter, we show the effectiveness of a double-loop algorithm based on the concave-convex procedure (CCCP) in decoding linear codes. For this purpose, we numerically compare the error performance of CCCP-based decoding algorithm with that of a conventional iterative decoding algorithm based on belief propagation (BP). We also investigate computational complexity and its relation to the error performance.

Analysis of electromagnetic wave propagation and scattering in a random medium is a field of great interest. This research field becomes more important if we consider the study of phsyical effects on wave propagation and scattering from targets in random media. Curvature of the targets' cross-sections plays an important parameter in the radar detection problem. In previous study, analysis of scattering data from nonconvex conducting targets has pointed out to the effect of target configuration together with both effects of the spatial coherence length of incident waves around the target and the double passage on the backscattering enhancement. Here, we make sure this fact by considering targets with relatively large sizes in continuous random media for H-wave incidence. We assume the cross-section of targets to be smoothly deformed contour comprising concave and convex portions.