8 citations · 18 across the 10 of their papers we have counts for
11 papers
Absorbing Sets in Quantum LDPC Codes
Kirsten D. Morris, Tefjol Pllaha, Christine A. Kelley
Iterative decoder failures of quantum low density parity check (QLDPC) codes are attributed to substructures in the code's graph, known as trapping sets, as well as degenerate erro…
A Generalized Algebraic Approach to Optimizing SC-LDPC Codes
Allison Beemer, Salman Habib, Christine A. Kelley +1
Spatially coupled low-density parity-check (SC-LDPC) codes are sparse graph codes that have recently become of interest due to their capacity-approaching performance on memoryless…
Variations of the McEliece Cryptosystem
Jessalyn Bolkema, Heide Gluesing-Luerssen, Christine A. Kelley +3
Two variations of the McEliece cryptosystem are presented. The first one is based on a relaxation of the column permutation in the classical McEliece scrambling process. This is do…
Geometric WOM codes and coding strategies for multilevel flash memories
Kathryn Haymaker, Christine A. Kelley
This paper investigates the design and application of write-once memory (WOM) codes for flash memory storage. Using ideas from Merkx ('84), we present a construction of WOM codes b…
Algebraic Constructions of Graph-Based Nested Codes from Protographs
Christine A. Kelley, Joerg Kliewer
Nested codes have been employed in a large number of communication applications as a specific case of superposition codes, for example to implement binning schemes in the presence…
Eigenvalue bounds on the pseudocodeword weight of expander codes
Christine A. Kelley, Deepak Sridhara
Four different ways of obtaining low-density parity-check codes from expander graphs are considered. For each case, lower bounds on the minimum stopping set size and the minimum ps…