Chanya Lawong. The Construction of ternary low density parity check codes using graphs. Master's degree(Applied Mathematics). Chiang Mai University. Library. : Chiang Mai University, 2024.
The Construction of ternary low density parity check codes using graphs
Abstract:
Since the late 1990s, communication systems have widely adopted low-density parity-check codes as a highly efficient error-correcting code. Tanner graphs are considered one of the most effective representations of low-density parity-check codes. In this research, we study Tanner graphs for ternary codes within both finite fields and finite rings of integers. We have also extended the method for constructing binary low-density parity-check codes, proposed by Polak and Zhupa, to ternary codes within rings of integers. Therefore, our objective is to adapt Polak and Zhupas Tanner graph construction method for ternary codes that achieve a satisfactory bit error rate.