Information Geometry of Loopy BP
We have given the information geometrical framework [1] to analyze the BP decoding algorithms of turbo codes and LDPC codes[2, 4]. In this article, we extend our results to the BP algorithm on general graphs. The main results are the characterization of the fixed points and geometrical explanation about the cause of error of the inference. We also gives a new cost function which yields a new algorithm.