Publications

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by the appropriate copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Journal publications:

  • [J9] P. M. Olmos, D. G. M. Mitchell, D. Truhachev, and D. J. Costello, Jr., “Improving the Finite-Length Performance of Spatially Coupled LDPC Codes by Connecting Multiple Code Chains”, submitted to the IEEE Transactions on Information Theory, Feb. 2014.
  • [J8] D. J. Costello, Jr., L. Dolecek, T. E. Fuja, J. Kliewer, D. G. M. Mitchell, and R. Smarandache, “Spatially Coupled Sparse Codes on Graphs - Theory and Practice”, submitted to the IEEE Communications Magazine, 2013.
  • [J7] D. G. M. Mitchell, R. Smarandache, and D. J. Costello, Jr., “Quasi-Cyclic LDPC Codes Based on Pre-lifted Protographs”, submitted to the IEEE Transactions on Information Theory, 2013.
  • [J6] D. Truhachev, D. G. M. Mitchell, M. Lentmaier, and D. J. Costello Jr., “New Codes on Graphs Constructed by Connecting Spatially Coupled Chains”, submitted to the IEEE Transactions on Information Theory, 2013.
  • [J5] H. Zhou, D. G. M. Mitchell, N. Goertz, and D. J. Costello, Jr., “Robust Rate-Compatible Punctured LDPC Convolutional Codes”, IEEE Transactions on Communications, vol. 61, no. 11, pp. 4428-4439, Nov. 2013.
  • [J4] D. G. M. Mitchell, M. Lentmaier, and D. J. Costello, Jr., “Spatially Coupled LDPC Codes Constructed from Protographs”, submitted to the IEEE Transactions on Information Theory, 2012.
  • [J3] D. G. M. Mitchell, A. E. Pusane, and D. J. Costello, Jr., “Minimum Distance and Trapping Set Analysis of LDPC Convolutional Codes”, IEEE Transactions on Information Theory, vol. 59, no. 1, pp. 254-281, Jan. 2013.
  • [J2] D. G. M. Mitchell, L. O’Carroll, and N. Goertz; "A New Method of Encoding Block Codes with Polynomials", submitted to Design, Codes and Cryptography.
  • [J1] D. G. M. Mitchell and D. C. Heggie, “Exact equilibria of a stellar system in a linearized tidal field”, Monthly Notices of the Royal Astronomical Society, vol. 376, pp. 705-708, 2007.

Conference publications:

  • [C28] P. Olmos, D. G. M. Mitchell, D. Truhachev, and D. J. Costello, Jr., “Improving the finite-length performance of long SC-LDPC code chains by connecting consecutive chains” submitted to the International Symposium on Turbo Codes and Iterative Information Processing, 2014.
  • [C27] D. G. M. Mitchell, L. Dolecek, and D. J. Costello, Jr., “Breaking Absorbing Sets in Array-Based Spatially Coupled LDPC Codes”, Proc. IEEE International Symposium on Information Theory, Honolulu, HI, June 2014.
  • [C26] K. Huang, D. G. M. Mitchell, L. Wei, X. Ma, and D. J. Costello, Jr., “Performance Comparison of Non-Binary LDPC Block and Spatially Coupled Codes”, Proc. IEEE International Symposium on Information Theory, Honolulu, HI, June 2014.
  • [C25] L. Wei, K.-A. Toshiaki, D. G. M. Mitchell, T. E. Fuja, and D. J. Costello, Jr., “Threshold Analysis of Non-Binary Spatially-Coupled LDPC Codes with Windowed Decoding”, Proc. IEEE International Symposium on Information Theory, Honolulu, HI, June 2014.
  • [C24] L. Wei, K. Huang, D. G. M. Mitchell, T. E. Fuja, and D. J. Costello, Jr., “Performance Comparison of Non-Binary LDPC Block and Spatially Coupled Codes”, Proc. Information Theory and Applications Workshop, San Diego, CA, Feb. 2014.
  • [C23] P. Olmos, D. G. M. Mitchell, D. Truhachev, and D. J. Costello Jr., “A Finite Length Performance Analysis of LDPC Codes Constructed by Connecting Spatially Coupled Chains”, Proc. IEEE Information Theory Workshop, Seville, Spain, Sept. 2013.
  • [C22] D. G. M. Mitchell, M. Lentmaier, and D. J. Costello Jr., “On the Minimum Distance of Generalized Spatially Coupled LDPC Codes”, Proc. IEEE International Symposium on Information Theory, Istanbul, Turkey, July 2013.
  • [C21] D. G. M. Mitchell, K. Kasai, M. Lentmaier, and D. J. Costello Jr., “Asymptotic Analysis of Spatially Coupled MacKay-Neal and Hsu-Anastasopoulos LDPC Codes”, Proc. International Symposium on Information Theory and its Applications, Honolulu, HI, Oct. 2012.
  • [C20] D. G. M. Mitchell, R. Smarandache, and D. J. Costello Jr., “Constructing Good QC-LDPC Codes by Pre-lifting Protographs Pre-lifted Protographs”, Proc. IEEE Information Theory Workshop, Lausanne, Switzerland, Sept. 2012.
  • [C19] H. Zhou, D. G. M. Mitchell, N. Goertz, and D. J. Costello Jr., “A Puncturing Algorithm for Rate-Compatible LDPC Convolutional Codes”, winner of best student paper, Proc. International Symposium on Turbo Codes and Iterative Information Processing, Gothenburg, Sweden, Aug. 2012.
  • [C18] D. Truhachev, D. G. M. Mitchell, M. Lentmaier, and D. J. Costello Jr., “Improving Spatially Coupled LDPC Codes by Connecting Chains”, Proc. IEEE International Symposium on Information Theory, Boston, MA, July 2012.
  • [C17] H. Zhou, D. G. M. Mitchell, N. Goertz, and D. J. Costello Jr., “Distance Spectrum Estimation of LDPC Convolutional Codes”, Proc. IEEE International Symposium on Information Theory, Boston, MA, July 2012.
  • [C16] D. Truhachev, D. G. M. Mitchell, M. Lentmaier, and D. J. Costello Jr., “Connecting Spatially Coupled LDPC Code Chains”, Proc. IEEE International Conference on Communications, Ottawa, Canada, June 2012.
  • [C15] D. Truhachev, D. G. M. Mitchell, M. Lentmaier, and D. J. Costello Jr., “New Codes on Graphs Constructed by Connecting Spatially Coupled Chains”, Proc. Information Theory and Applications Workshop, San Diego, CA, Feb. 2012.
  • [C14] D. G. M. Mitchell, R. Smarandache, and D. J. Costello Jr., “Quasi-Cyclic LDPC Codes Based on Pre-lifted Protographs”, Proc. IEEE Information Theory Workshop, Paraty, Brazil, Oct. 2011.
  • [C13] D. G. M. Mitchell, A. E. Pusane, M. Lentmaier, and D. J. Costello Jr., “Exact Free Distance and Trapping Set Growth Rates for LDPC Convolutional Codes”, Proc. IEEE International Symposium on Information Theory, St. Petersburg, Russia, July 2011.
  • [C12] R. Smarandache, D. G. M. Mitchell, and D. J. Costello Jr., “Partially-Quasi-Cyclic Protograph-Based LDPC Codes”, Proc. IEEE International Conference on Communications, Kyoto, Japan, June 2011.
  • [C11] D. G. M. Mitchell, M. Lentmaier, and D. J. Costello Jr., “AWGN Channel Analysis of terminated LDPC Convolutional Codes”, Proc. Information Theory and Applications Workshop, San Diego, CA, Feb. 2011.
  • [C10] M. Lentmaier, D. G. M. Mitchell, G. P. Fettweis, and D. J. Costello Jr., "Asymptotically Good LDPC Convolutional Codes with AWGN Channel Thresholds Close to the Shannon Limit", Proc. 6th International Symposium on Turbo Codes & Iterative Information Processing 2010, Brest, France, Sept. 2010.
  • [C9] D. G. M. Mitchell, R. Smarandache, M. Lentmaier, and D. J. Costello Jr., “Quasi-Cyclic Asymptotically Regular LDPC Codes”, Proc. IEEE Information Theory Workshop, Dublin, Ireland, Aug. 2010.
  • [C8] D. G. M. Mitchell, M. Lentmaier, and D. J. Costello Jr., “New Families of LDPC Block Codes Formed by Terminating Irregular Protograph-Based LDPC Convolutional Codes”, Proc. IEEE International Symposium on Information Theory, Austin, TX, June 2010.
  • [C7] M. Lentmiaer, D. G. M. Mitchell, G. P. Fettweis, and D. J. Costello Jr., “Asymptotically Regular LDPC Codes with Linear Distance Growth and Thresholds Close to Capacity”, Proc. Information Theory and Applications Workshop, San Diego, CA, Feb. 2010.
  • [C6] D. G. M. Mitchell, A. E. Pusane, and D. J. Costello Jr., “Trapping Set Analysis of LDPC Convolutional Codes”, Proc. IEEE International Symposium on Information Theory, Seoul, South Korea, June 2009.
  • [C5] D. G. M. Mitchell, A. E. Pusane, and D. J. Costello Jr., “Asymptotic Trapping Set Analysis of Regular Protograph-Based LDPC Convolutional Codes”, Proc. Information Theory and Applications Workshop, San Diego, CA, Feb. 2009.
  • [C4] D. G. M. Mitchell, A. E. Pusane, N. Goertz, and D. J. Costello Jr., “Free Distance Bounds for Regular Asymptotically Good LDPC Convolutional Codes based on Protographs”, Proc. International Symposium on Turbo Codes and Related Topics, pp. 408-413, Lausanne, Switzerland, Sept. 2008.
  • [C3] D. G. M. Mitchell, A.E. Pusane, K. Sh. Zigangirov, and D. J. Costello Jr., “Asymptotically Good LDPC Convolutional Codes based on Protographs”, Proc. IEEE International Symposium on Information Theory, pp. 1030-1034, Toronto, Canada, July 2008.
  • [C2] D. G. M. Mitchell, L. O’Carroll, and N. Goertz, “Towards Efficient Encoding Using Polynomials”, Proc. International ITG Conference on Source and Channel Coding, Ulm, Germany, Jan. 2008.
  • [C1] D. G. M. Mitchell, L. O’Carroll, and N. Goertz; "A New Method of Encoding Block Codes with Polynomials", Proc. International Symposium on Communication Theory and Applications, Ambleside, England, July 2007.

Publications in preparation:

Extensions of the above conference papers are currently in preparation in the following works. Drafts are available upon request.

  • D. G. M. Mitchell and D. J. Costello, Jr., “Trapping Set Analysis of Spatially Coupled LDPC Codes”, to be submitted to the IEEE Communications Letters.
  • R. Smarandache, D. G. M. Mitchell, and D. J. Costello Jr., “Partially-Quasi-Cyclic Protograph-Based LDPC Codes”, to be submitted to the IEEE Transactions on Information Theory.
  • K. Huang, D. G. M. Mitchell, L. Wei, X. Ma, and D. J. Costello, Jr., “Performance Comparison of Non-Binary LDPC Block and Spatially Coupled Codes”, to be submitted to the IEEE Transactions on Communications.
  • L. Wei, D. G. M. Mitchell, T. E. Fuja, and D. J. Costello, Jr., “Threshold and Minimum Distance Analysis of Non-Binary Spatially-Coupled LDPC Codes with Windowed Decoding”.