Learn More
—This paper presents a geometric approach to the construction of low-density parity-check (LDPC) codes. Four classes of LDPC codes are constructed based on the lines and points of Eu-clidean and projective geometries over finite fields. Codes of these four classes have good minimum distances and their Tanner graphs have girth 6. Finite-geometry LDPC codes(More)
Low density parity check (LDPC) codes with iterative decoding based on belief propagation achieve astonishing error performance close to Shannon limit. No algebraic or geometric method for constructing these codes has been reported and they are largely generated by computer search. As a result, encoding of long LDPC codes is in general very complex. This(More)
Corruption can be unfair and detrimental to societies; however, little is known regarding how individuals perceive corruption. We aim to understand how psychological factors, such as lay belief of the world, influence perceived intention of corruptive behavior. As corruption undermines justice, we hypothesize that belief in a just world to others(More)
Previous studies have found that when low-status group members are aware that their in-group is stereotyped as dependent by a specific out-group (i.e. a dependency meta-stereotype is salient), they are reluctant to seek help from the high-status out-group to avoid confirming the negative meta-stereotype. However, it is unclear whether low-status group(More)
This paper presents a geometric approach to the construction of low density parity check (LDPC) codes. Four classes of LDPC codes are constructed based on the lines and points of Eu-clidean and projective geometries over finite fields. Codes of these four classes have good minimum distances and their Tanner graphs have girth 6. Finite geometry LDPC codes(More)
  • 1