| Year |
Citation |
Score |
| 2019 |
Beemer A, Haymaker K, Kelley CA. Absorbing sets of codes from finite geometries Cryptography and Communications. 11: 1115-1131. DOI: 10.1007/S12095-019-0353-6 |
0.497 |
|
| 2018 |
Mayer C, Haymaker K, Kelley CA. Channel decomposition for multilevel codes over multilevel and partial erasure channels Advances in Mathematics of Communications. 12: 151-168. DOI: 10.3934/Amc.2018010 |
0.385 |
|
| 2016 |
Cummings J, Kelley CA. On the independence and domination numbers of replacement product graphs Involve, a Journal of Mathematics. 9: 181-194. DOI: 10.2140/Involve.2016.9.181 |
0.401 |
|
| 2014 |
Haymaker K, Kelley CA. Structured bit-interleaved LDPC codes for MLC flash memory Ieee Journal On Selected Areas in Communications. 32: 870-879. DOI: 10.1109/Jsac.2014.140507 |
0.453 |
|
| 2014 |
Haymaker K, Kelley CA. Geometric WOM codes and coding strategies for multilevel flash memories Designs, Codes, and Cryptography. 70: 91-104. DOI: 10.1007/S10623-012-9681-7 |
0.485 |
|
| 2013 |
Kelley CA. Algebraic design and implementation of protograph codes using non-commuting permutation matrices Ieee Transactions On Communications. 61: 910-918. DOI: 10.1109/Tcomm.2013.012313.110513 |
0.572 |
|
| 2012 |
Haymaker K, Kelley CA. Covering codes for multilevel flash memories Conference Record - Asilomar Conference On Signals, Systems and Computers. 942-949. DOI: 10.1109/ACSSC.2012.6489155 |
0.429 |
|
| 2010 |
Kelley CA. Minimum distance and pseudodistance lower bounds for generalised LDPC codes International Journal of Information and Coding Theory. 1: 313-333. DOI: 10.1504/Ijicot.2010.032546 |
0.59 |
|
| 2010 |
Kelley CA, Kliewer J. Algebraic constructions of graph-based nested codes from protographs Ieee International Symposium On Information Theory - Proceedings. 829-833. DOI: 10.1109/ISIT.2010.5513628 |
0.522 |
|
| 2008 |
Kelley CA, Sridhara D, Rosenthal J. Zig-zag and replacement product graphs and LDPC codes Advances in Mathematics of Communications. 2: 347-372. DOI: 10.3934/Amc.2008.2.347 |
0.547 |
|
| 2008 |
Kelley CA, Walker JL. LDPC codes from voltage graphs Ieee International Symposium On Information Theory - Proceedings. 792-796. DOI: 10.1109/ISIT.2008.4595095 |
0.536 |
|
| 2008 |
Kelley CA. On codes designed via algebraic lifts of graphs 46th Annual Allerton Conference On Communication, Control, and Computing. 1254-1261. DOI: 10.1109/ALLERTON.2008.4797704 |
0.441 |
|
| 2007 |
Kelley CA, Sridhara D. Eigenvalue Bounds On The Pseudocodeword Weight Of Expander Codes Advances in Mathematics of Communications. 1: 287-306. DOI: 10.3934/Amc.2007.1.287 |
0.568 |
|
| 2007 |
Kelley CA, Sridhara D. Pseudocodewords of tanner graphs Ieee Transactions On Information Theory. 53: 4013-4038. DOI: 10.1109/Tit.2007.907501 |
0.489 |
|
| 2007 |
Kelley CA, Sridhara D, Rosenthal J. Tree-based construction of LDPC codes having good pseudocodeword weights Ieee Transactions On Information Theory. 53: 1460-1478. DOI: 10.1109/Tit.2007.892774 |
0.574 |
|
| 2007 |
Kelley CA, Sridhara D. On the pseudocodeword weight and parity-check matrix redundancy of linear codes 2007 Ieee Information Theory Workshop, Itw 2007, Proceedings. 1-6. DOI: 10.1109/ITW.2007.4313040 |
0.539 |
|
| 2007 |
Kelley C, Rosenthal J, Sridhara D. Systems theoretic questions in coding theory Pamm. 7: 1030601-1030602. DOI: 10.1002/Pamm.200700018 |
0.557 |
|
| 2006 |
Kelley CA, Sridhara D, Rosenthal J. Pseudocodeword weights for non-binary LDPC codes Ieee International Symposium On Information Theory - Proceedings. 1379-1383. DOI: 10.1109/ISIT.2006.262072 |
0.307 |
|
| 2006 |
Sridhara D, Kelley CA. LDPC coding for the three-terminal erasure relay channel Ieee International Symposium On Information Theory - Proceedings. 1229-1233. DOI: 10.1109/ISIT.2006.262001 |
0.327 |
|
| Show low-probability matches. |