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.

Click here to order publications by type. (*Student authors advised by Dr. Mitchell)

Under Review

  • D. G. M. Mitchell, M. Lentmaier, P. M. Olmos, and Daniel J. Costello, Jr., “Generalized Spatially-Coupled LDPC Codes: Asymptotic Analysis and Finite Length Scaling,” submitted to the IEEE Transactions on Communications.
  • 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.

2017

  • P. M. Olmos, D. G. M. Mitchell, D. Truhachev, and D. J. Costello, Jr., “Continuous Transmission of Spatially-Coupled LDPC Code Chains,” IEEE Transactions on Communications, vol. XX, no. XX, pp. XX-YY, DDD. 2017.
  • H. Hatami*, D. G. M. Mitchell, D. J. Costello, Jr., and T. Fuja, “Lower Bounds for Quantized LDPC Min-Sum Decoders based on Absorbing Sets,” Proc. 55th Annual Allerton Conference on Communication, Control, and Computing, pp. XX-YYY, Allerton, IL, Oct. 2017.
  • M. Zhu*, D. G. M. Mitchell, M. Lentmaier, D. J. Costello, Jr., and B. Bai, “Braided Convolutional Codes with Sliding Window Decoding,” IEEE Transactions on Communications, vol. 65, no. 9, pp. 3645-3658, Sept. 2017.
  • D. G. M. Mitchell and E. Rosnes, “Edge Spreading Design of High Rate Array-Based SC-LDPC Codes,” Proc. IEEE International Symposium on Information Theory, pp. 2950-2954, Aachen, Germany, June 2017.
  • L. Chen, S. Mo, D. J. Costello, Jr., D. G. M. Mitchell, and R. Smarandache, “A Protograph-Based Design of Quasi-Cyclic Spatially Coupled LDPC Codes,” Proc. IEEE International Symposium on Information Theory, pp. 1683-1687, Aachen, Germany, June 2017.

2016

  • A. Golmohammadi*, J. Kliewer, D. J. Costello, Jr., and D. G. M. Mitchell, “On the Windowed Encoding Complexity of SC-LDGM Codes for Lossy Source Compression,” Proc. International Symposium on Information Theory and Its Applications, pp. 627-631, Monterey, CA, Oct. 2016.
  • L. Wei*, D. G. M. Mitchell, T. E. Fuja, and D. J. Costello, Jr., “Design of Spatially Coupled LDPC Codes Over GF(q) for Windowed Decoding,” IEEE Transactions on Information Theory, vol. 62, no. 9, pp. 4781-4800, Sept. 2016.
  • D. G. M. Mitchell, A. E. Pusane, M. Lentmaier, and D. J. Costello, Jr., “On the Block Error Rate Performance of Spatially Coupled LDPC Codes for Streaming Applications,” Proc. IEEE Information Theory Workshop, pp. 236-240, Cambridge, UK, Sept. 2016.
  • D. J. Costello, Jr., M. Lentmaier, and D. G. M. Mitchell, “New Perspectives on Braided Convolutional Codes,” Proc. International Symposium on Turbo Codes and Iterative Information Processing, pp. 400-405, Brest, France, Sept. 2016.
  • A. Golmohammadi*, D. G. M. Mitchell, J. Kliewer, and D. J. Costello, Jr., “Windowed Encoding of Spatially Coupled LDGM Codes for Lossy Source Compression,” Proc. IEEE International Symposium on Information Theory, pp. 2084-2088, Barcelona, Spain, July 2016.
  • H. Hatami*, D. G. M. Mitchell, D. J. Costello, Jr., and T. Fuja, “Performance bounds for Quantized LDPC Decoders based on Absorbing Sets,” Proc. IEEE International Symposium on Information Theory, pp. 2539-2543, Barcelona, Spain, July 2016.
  • D. G. M. Mitchell, M. Lentmaier, A. E. Pusane, and D. J. Costello, Jr., “Randomly Punctured LDPC Codes,” IEEE Journal on Selected Areas in Communications, vol. 34, no. 2, pp. 408-421, Feb. 2016.

2015

  • M. Zhu*, D. G. M. Mitchell, M. Lentmaier, D. J. Costello, Jr., and B. Bai, “Window Decoding of Braided Convolutional Codes”, Proc. IEEE Information Theory Workshop, pp. 143-147, Jeju Island, Korea, Oct. 2015.
  • D. G. M. Mitchell, M. Lentmaier, and D. J. Costello, Jr., “Spatially Coupled LDPC Codes Constructed from Protographs,” IEEE Transactions on Information Theory, vol. 61, no. 9, pp. 4866-4889, Sep. 2015.
  • D. G. M. Mitchell, M. Lentmaier, A. E. Pusane, and D. J. Costello, Jr., “Approximating Thresholds of Punctured LDPC Codes on the AWGN Channel”, Proc. IEEE International Symposium on Information Theory, pp. 421-425, Hong Kong, China, June 2015.
  • P. Olmos, D. G. M. Mitchell, and D. J. Costello, Jr., "Analyzing the Finite-length Performance of Generalized LDPC Codes”, Proc. IEEE International Symposium on Information Theory, pp. 2683-2687, Hong Kong, China, June 2015.
  • K. Huang*, D. G. M. Mitchell, X. Ma, and D. J. Costello, Jr., “Asymptotic Distance Properties of Protograph-based Spatially Coupled LDPC Codes over GF(q)”, Proc. IEEE Information Theory Workshop, pp. 1-5, Jerusalem, Isreal, Apr. 2015.
  • K. Huang*, D. G. M. Mitchell, L. Wei*, X. Ma, and D. J. Costello, Jr., “Performance Comparison of LDPC Block and Spatially Coupled Codes over GF(q),” IEEE Transactions on Communications, vol. 63, no. 3, pp. 592-604, Mar. 2015.

2014

  • D. G. M. Mitchell, R. Smarandache, and D. J. Costello, Jr., “Quasi-Cyclic LDPC Codes Based on Pre-lifted Protographs,” IEEE Transactions on Information Theory, vol. 60, no. 10, pp. 5856-5874, Oct. 2014.
  • D. G. M. Mitchell, M. Lentmaier, A. E. Pusane, and D. J. Costello, Jr., “Randomly Punctured Spatially Coupled LDPC Codes ”, Proc. International Symposium on Turbo Codes and Iterative Information Processing, pp. 1-6, Bremen, Germany, Aug. 2014.
  • 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”, Proc. International Symposium on Turbo Codes and Iterative Information Processing, pp. 72-76, Bremen, Germany, Aug. 2014.
  • 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,” IEEE Communications Magazine, vol. 52, no. 7, pp. 168-176, July 2014.
  • 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, pp. 886-890, Honolulu, HI, June 2014.
  • 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, pp. 876-880, Honolulu, HI, June 2014.
  • 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, pp. 881-885, Honolulu, HI, June 2014.
  • 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, pp. 1-2, San Diego, CA, Feb. 2014.

2013

  • 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.
  • 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, pp. 1-5, Seville, Spain, Sept. 2013.
  • 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, pp. 1874-1878, Istanbul, Turkey, July 2013.
  • 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.

2012

  • 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, pp. 337-341, Honolulu, HI, Oct. 2012.
  • 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, pp. 202-206, Lausanne, Switzerland, Sept. 2012.
  • 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, pp. 255-259, Gothenburg, Sweden, Aug. 2012.
  • 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, pp. 468-472, Boston, MA, July 2012.
  • 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, pp. 473-477, Boston, MA, July 2012.
  • 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, pp. 2176-2180, Ottawa, Canada, June 2012.
  • 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, pp. 392-397, San Diego, CA, Feb. 2012.

2011

  • 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, pp. 350-354, Paraty, Brazil, Oct. 2011.
  • 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, pp. 1096-1100, St. Petersburg, Russia, July 2011.
  • R. Smarandache, D. G. M. Mitchell, and D. J. Costello Jr., “Partially-Quasi-Cyclic Protograph-Based LDPC Codes”, Proc. IEEE International Conference on Communications, pp. 1-5, Kyoto, Japan, June 2011.
  • 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, pp. 1-5, San Diego, CA, Feb. 2011.

2010

  • 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, pp. 324-328, Brest, France, Sept. 2010.
  • D. G. M. Mitchell, R. Smarandache, M. Lentmaier, and D. J. Costello Jr., “Quasi-Cyclic Asymptotically Regular LDPC Codes”, Proc. IEEE Information Theory Workshop, pp. 1-5, Dublin, Ireland, Aug. 2010.
  • 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, pp. 824-828, Austin, TX, June 2010.
  • 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, pp. 1-8, San Diego, CA, Feb. 2010.

2009

  • 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, pp. 561-565, Seoul, South Korea, June 2009.
  • 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, pp. 264-271, San Diego, CA, Feb. 2009.

2008

  • 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.
  • 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.
  • D. G. M. Mitchell, L. O’Carroll, and N. Goertz, “Towards Efficient Encoding Using Polynomials”, Proc. International ITG Conference on Source and Channel Coding, pp. 1-6, Ulm, Germany, Jan. 2008.

2007

  • 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.
  • 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, pp. 1-5, Ambleside, England, July 2007.

Poster presentations:

  • [P8] A. Golmohammadi*, David G. M. Mitchell, J. Kliewer, and D. J. Costello, Jr., “Encoding of Spatially Coupled LDGM Codes for Lossy Source Compression,” 10th Annual North American School of Information Theory, Georgia Tech University, Atlanta, GA, June 2017.
  • [P7] H. Hatami*, D. G. M. Mitchell, D. J. Costello, Jr., and T. Fuja, “Lower bounds for Quantized LDPC Min- Sum Decoders Based on Absorbing Sets,” 10th Annual North American School of Information Theory, Georgia Tech University, Atlanta, GA, June 2017.
  • [P6] H. Hatami*, D. G. M. Mitchell, D. J. Costello, Jr., and T. Fuja, “Performance bounds for Quantized LDPC Decoders,” 9th Annual North American School of Information Theory, Duke University, Durham, NC, June 2016.
  • [P5] M. Zhu*, D. G. M. Mitchell, M. Lentmaier, D. J. Costello, Jr., and B. Bai, “Window Decoding of Braided Convolutional Codes,” 8th Annual North American School of Information Theory, La Jolla, CA, Aug. 2015.
  • [P4] H. Hatami*, D. G. M. Mitchell, D. J. Costello, Jr., and T. Fuja, “Performance Bounds for Quantized LDPC Decoders based on Absorbing Sets,” 8th Annual North American School of Information Theory, La Jolla, CA, Aug. 2015.
  • [P3] 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,” 7th Annual North American School of Information Theory, Fields Institute for Research in Mathematical Sciences, Toronto, Canada, June 2014.
  • [P2] D. G. M. Mitchell, R. Smarandache, and D. J. Costello Jr., “Constructing Good QC-LDPC Codes by Pre- lifting Protographs,” Proc. IEEE Information Theory Workshop, Lausanne, Switzerland, Sept. 2012.
  • [P1] 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.