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 Euclidean 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 can(More)
Sequencing of pediatric gliomas has identified missense mutations Lys27Met (K27M) and Gly34Arg/Val (G34R/V) in genes encoding histone H3.3 (H3F3A) and H3.1 (HIST3H1B). We report that human diffuse intrinsic pontine gliomas (DIPGs) containing the K27M mutation display significantly lower overall amounts of H3 with trimethylated lysine 27 (H3K27me3) and that(More)
Cohesins, which mediate sister chromatin cohesion, and CTCF, which functions at chromatin boundaries, play key roles in the structural and functional organization of chromosomes. We examined the binding of these two factors on the Kaposi's sarcoma-associated herpesvirus (KSHV) episome during latent infection and found a striking colocalization within the(More)
New algebraic methods for constructing codes based on hyperplanes of two different dimensions in finite geometries are presented. The new construction methods result in a class of multistep majority-logic decodable codes and three classes of low-density parity-check (LDPC) codes. Decoding methods for the class of majority-logic decodable codes, and a class(More)
In the late 1950s and early 1960s, finite fields were successfully used to construct linear block codes, especially cyclic codes, with large minimum distances for hard-decision algebraic decoding, such as Bose-Chaudhuri-Hocquenghem (BCH) and Reed-Solomon (RS) codes. This paper shows that finite fields can also be successfully used to construct algebraic(More)
This letter presents an algebraic method for constructing regular low-density parity-check (LDPC) codes based on Reed–Solomon codes with two information symbols. The construction method results in a class of LDPC codes in Gallager’s original form. Codes in this class are free of cycles of length 4 in their Tanner graphs and have good minimum distances. They(More)
Firms have been investing over $5 billion a year in recent years on new information technology and software in their manufacturing plants. In this study, we develop a conceptual model based on the theory of dynamic capabilities to study how manufacturing plants realize improvements in plant performance by leveraging plant information systems to enable(More)