Computer Science – Information Theory
Scientific paper
2012-03-20
Computer Science
Information Theory
6
Scientific paper
In this paper, we present a novel way for solving the main problem of designing the capacity approaching irregular low-density parity-check (LDPC) code ensemble over binary erasure channel (BEC). The proposed method is much simpler, faster, accurate and practical than other methods. Our method does not use any relaxation or any approximate solution like previous works. Our method works and finds optimal answer for any given check node degree distribution. The proposed method was implemented and it works well in practice with polynomial time complexity. As a result, we represent some degree distributions that their rates are close to the capacity with maximum erasure probability and maximum code rate.
Attari Mahmoud Ahmadian
Peyghami Reza M.
Tavakoli H.
No associations
LandOfFree
Optimal Rate and Maximum Erasure Probability LDPC Codes in Binary Erasure Channel does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Optimal Rate and Maximum Erasure Probability LDPC Codes in Binary Erasure Channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Rate and Maximum Erasure Probability LDPC Codes in Binary Erasure Channel will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-494581