Zobrazeno 1 - 10
of 150
pro vyhledávání: '"KELLEY, CHRISTINE A."'
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 errors that can arise in quantum codes. Failure inducing sets are subsets
Externí odkaz:
http://arxiv.org/abs/2307.14532
Autor:
Leticia Maria De Souza Cordeiro, Kelley Christine Atkinson, Argin Aivazian, Patrick Frank Joyce, Fang Jia, Alessandro Mascioni
Publikováno v:
mAbs, Vol 16, Iss 1 (2024)
Off-target biodistribution of biologics bears important toxicological consequences. Antibody fragments intended for use as vectors of cytotoxic payloads (e.g. antibody-drug conjugates, radiotherapy) can accumulate at clearance organs like kidneys and
Externí odkaz:
https://doaj.org/article/70311d3d906a489e9c94e288bac59a19
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
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 binary input channels. In this paper, we unify all existing SC-LDPC co
Externí odkaz:
http://arxiv.org/abs/1710.03619
Autor:
Bolkema, Jessalyn, Gluesing-Luerssen, Heide, Kelley, Christine A., Lauter, Kristin, Malmskog, Beth, Rosenthal, Joachim
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 done in such a way that the Hamming weight of the error, added in the en
Externí odkaz:
http://arxiv.org/abs/1612.05085
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
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 based on finite Euclidean geometries over $\mathbb{F}_2$. This construc
Externí odkaz:
http://arxiv.org/abs/1206.5762
Autor:
Kelley, Christine A., Kliewer, Joerg
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 of noise, in joint network-channel coding, or in physical-layer secrec
Externí odkaz:
http://arxiv.org/abs/1006.2977
Autor:
Kelley, Christine A., Sridhara, Deepak
Publikováno v:
Journal on Advances of Mathematics of Communications, vol. 1, no. 3, pp. 287 -- 307, Aug. 2007
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 pseudocodeword weight of expander (LDPC) codes are derived. These bounds
Externí odkaz:
http://arxiv.org/abs/0708.2462
The performance of codes defined from graphs depends on the expansion property of the underlying graph in a crucial way. Graph products, such as the zig-zag product and replacement product provide new infinite families of constant degree expander gra
Externí odkaz:
http://arxiv.org/abs/cs/0611155