| Session: | 1.1.5 - LDPC Codes: Algebraic Constructions |
| Session Time: | Monday, July 10, 09:40 - 11:00 |
| Paper Time: | Monday, July 10, 10:40 - 11:00 |
| Title: |
Design of non binary LDPC codes using their binary image: algebraic properties. |
| Authors: |
Charly Poulliat; ETIS - ENSEA/UCP/CNRS | | |
| | Marc Fossorier; University of Hawaii at Manoa | | |
| | David Declercq; ETIS - ENSEA/UCP/CNRS | | |
| Abstract: |
In this paper, we develop algebraic properties of regular (2,tr,N) non binary LDPC codes designed using their binary image. First, we characterize the algebraic properties of optimized rows of the parity check matrix H associated with a code, and then we study the algebraic properties of cycles and stopping sets associated with the underlaying Tanner graph. This analysis allows us to show that the equivalent binary minimum distance of the non binary code associated with H asymptotically increases with log(N), exhibiting poor minimum distance properties for that kind of codes, and emphasizing the need for efficient methods to construct codes with good minimum distance properties. |
