Roxana's Publications

Journal publications:

[1] A. Dimakis, R. Smarandache, and P. O. Vontobel, “LDPC codes for compressed sensing,” IEEE Trans.Inf.Theory, vol. 58, pp. 3093-3114, May 2012. Available online at http://arxiv.org/abs/1012.0602 | bib ]
[2] R. Smarandache and P. O. Vontobel, “Quasi-cyclic LDPC codes: Influence of proto- and Tanner-graph structure on minimum Hamming distance upper bounds,” IEEE Trans. Inform. Theory, vol. 58, pp. 585-607, Feb. 2012. Available online at http://arxiv.org/abs/0901.4129 | bib ]
[3] V. Tomas, J. Rosenthal, and R. Smarandache, “Decoding of convolutional codes over the erasure channel,” IEEE Trans. Inform. Theory, vol. 58, pp. 90-108, Jan. 2012. [ http://arxiv.org/abs/1006.3156 | bib ]
[4] R. Smarandache, “Pseudo-codewords from Bethe permanents,” Submitted to IEEE Trans. Inf. Theory, Nov. 2011. Available online at http://arxiv.org/abs/1112.4625 | bib ]
[5] A. E. Pusane, R. Smarandache, P. O. Vontobel, and D. J. Costello, Jr., “Deriving good LDPC convolutional codes from LDPC block codes,” IEEE Trans. Inform. Theory, vol. 57, no. 2, pp. 835-857, 2011. [ http://arxiv.org/abs/1004.5157 | bib ]
[6] R. Smarandache, A. Pusane, P. O. Vontobel, and D. J. Costello, Jr., “Pseudo-codeword performance analysis of LDPC convolutional codes,” IEEE Trans. Inform. Theory, vol. 55, no. 6, pp. 2577-2598, 2009. [ http://arxiv.org/abs/cs/0609148 | bib ]
[7] R. Hutchinson, R. Smarandache, and J. Trumpf, “Superregular matrices and the construction of convolutional codes having a maximum distance profile,” Linear Algebra and Its Applications, vol. 428, pp. 2585-2596, 2008. [ http://arxiv.org/abs/cs/0607089 | bib ]
[8] R. Smarandache and P. O. Vontobel, “Pseudo-codeword analysis of Tanner graphs from projective and Euclidean planes,” IEEE Trans. Inform. Theory, vol. 53, no. 7, pp. 2376-2393, 2007. [ http://arxiv.org/abs/cs/0602089 | bib ]
[9] R. Smarandache and M. Wauer, “Bounds on the pseudo-weight of minimal pseudo-codewords of projective geometry codes,” Contemporary Mathematics, Algebra and its Applications, vol. 419, pp. 285-296, Dec. 2006. [ http://arxiv.org/abs/cs/0510049 | bib ]
[10] H. Gluesing-Luerssen, J. Rosenthal, and R. Smarandache, “Strongly MDS convolutional codes,” IEEE Trans. Inform. Theory, vol. 52, no. 2, pp. 584-598, 2006. Available online at http://arxiv.org/abs/math/0303254 | bib ]
[11] R. Hutchinson, J. Rosenthal, and R. Smarandache, “Convolutional codes with maximum distance profile,” Systems and Control Letters, vol. 54(1), pp.  53-63, 2005. Available online at http://arxiv.org/abs/math/0307196 | bib ]
[12] R. Smarandache, “Unit memory convolutional codes with maximum distance,” Codes, Systems and Graphical Models, vol. 123, pp. 381-396, 2001. | bib ]
[13] R. Smarandache, H. Gluesing-Luerssen, and J. Rosenthal, “Constructions for MDS-convolutional codes,” IEEE Trans. Inform. Theory, vol. 47, no. 5, pp. 2045-2049, 2001. | bib ]
[14] J. Rosenthal and R. Smarandache, “Maximum distance separable convolutional codes,” Appl. Algebra Engrg. Comm. Comput., vol. 10, no. 1, pp. 15-32, 1999. | bib ]

Conference publications:

[1] D. G. M. Mitchell, R. Smarandache, and D. J. Costello, Jr., “Quasi-cyclic LDPC codes based on pre-lifted protographs,” in IEEE Inform. Theory Workshop, (Paraty, Brazil), Oct. 2011. | bib ]
[2] R. Smarandache, D. G. M. Mitchell, and D. J. Costello, Jr., “Partially quasi-cyclic protograph-based LDPC codes,” in IEEE International Conference on Communications (ICC), June 2011. | bib ]
[3] D. G. M. Mitchell, R. Smarandache, M. Lentmaier, and D. J. Costello, Jr., “Quasi-cyclic asymptotically regular LDPC codes,” in IEEE Inform. Theory Workshop, Sept. 2010. [ http://arxiv.org/abs/1007.0404 | bib ]
[4] V. Tomas, J. Rosenthal, and R. Smarandache, “Reverse maximum distance profile convolutional codes over the erasure channel,” in 19th International Symposium on Mathematical Theory of Networks and Systems, July 2010. | bib ]
[5] R. Smarandache, “On minimal pseudo-codewords,” in IEEE Intern. Symp. on Inform. Theory, (Austin, Texas, USA), June 2010. | bib ]
[6] A. E. Pusane, R. Smarandache, P. O. Vontobel, and D. J. Costello, Jr., “On the iterative decoding of LDPC convolutional codes,” in 18th IEEE Signal Processing and Communications Applications Conference (SIU), pp. 519-522, Apr. 2010. | bib ]
[7] A. G. Dimakis, R. Smarandache, and P. O. Vontobel, “Channel coding LP decoding and compressed sensing LP decoding: further connections,” in 2010 Intern. Zurich Seminar on Communications, Mar. 2010. | bib ]
[8] R. Smarandache and M. F. Flanagan, “Spectral graph analysis of quasi-cyclic codes,” in IEEE GLOBECOM, Dec. 2009. Available online at http://arxiv.org/abs/0908.1966 | bib ]
[9] V. Tomas, J. Rosenthal, and R. Smarandache, “Decoding of MDP convolutional codes over the erasure channel,” in IEEE Intern. Symp. on Inform. Theory, pp. 556-560, July 2009. [ http://arxiv.org/abs/0903.3004 | bib ]
[10] R. Smarandache and P. O. Vontobel, “Absdet-pseudo-codewords and perm-pseudo-codewords: definitions and properties,” in IEEE Intern. Symp. on Inform. Theory, (Seoul, Korea), June 2009. [ http://arxiv.org/abs/0904.2022 | bib ]
[11] R. Smarandache, A. E. Pusane, P. O. Vontobel, and D. J. Costello, Jr., “Pseudo-codewords in LDPC convolutional codes,” in IEEE Intern. Symp. on Inform. Theory, (Seattle, WA, USA), pp. 1364-1368, July 9-14 2006. | bib ]
[12] P. O. Vontobel and R. Smarandache, “On minimal pseudo-codewords of Tanner graphs from projective planes,” in 43rd Allerton Conference on Communications, Control, and Computing, (Allerton House, Monticello, Illinois, USA), Sept. 2005. [ http://arxiv.org/abs/cs/0510043 | bib ]
[13] P. O. Vontobel, R. Smarandache, N. Kiyavash, J. Teutsch, and D. Vukobratovic, “On the minimal pseudo-codewords of codes from finite geometries,” in IEEE Intern. Symp. on Inform. Theory, (Adelaide, Australia), Sept. 2005. [ http://arxiv.org/abs/cs/0508019 | bib ]
[14] R. Smarandache and P. O. Vontobel, “On regular quasi-cyclic LDPC codes from binomials,” in IEEE Intern. Symp. on Inform. Theory, (Chicago, IL, USA), p. 274, June 27-July 2 2004. | bib ]
[15] M. E. O'Sullivan, M. Greferath, and R. Smarandache, “Construction of good LDPC codes using dilation matrices,” in IEEE International Symposium on Information Theory, (Chicago, IL), p. 237, June-July 2004. | bib ]
[16] M. E. O'Sullivan and R. Smarandache, “High-rate, short length, (3, 3s)-regular LDPC codes of girth 6 and 8,” in IEEE International Symposium on Information Theory, (Yokohama, Japan), p. 59, June-July 2003. | bib ]
[17] M. E. O'Sullivan, M. Greferath, and R. Smarandache, “Construction of LDPC codes from affine permutation matrices,” in 40th Allerton Conf. on Communication, Control, and Computing, (Allerton House, Monticello, Illinois, USA), Oct. 2002. | bib ]
[18] R. Smarandache, H. Gluesing-Luerssen, and J. Rosenthal, “Construction results for MDS-convolutional codes,” in Proceedings of the 2000 IEEE International Symposium on Information Theory, (Sorrento, Italy), p. 294, 2000. | bib ]
[19] R. Smarandache, H. Gluesing-Luerssen, and J. Rosenthal, “Generalized first order descriptions and canonical forms for convolutional codes,” in Mathematical Theory of Networks and Systems (A. Beghi, L. Finesso, and G. Picci, eds.), pp. 1091-1094, July 1998. Proceedings of the MTNS-98 Symposium held in Padova, Italy. | bib ]
[20] R. Smarandache and J. Rosenthal, “A state space approach for constructing MDS rate 1/n convolutional codes,” in Proceedings of the 1998 IEEE Information Theory Workshop on Information Theory, (Killarney, Kerry, Ireland), pp. 116-117, June 1998. | bib ]
[21] J. Rosenthal and R. Smarandache, “On the dual of MDS convolutional codes,” in 36-th Annual Allerton Conference on Communication, Control, and Computing, pp. 576-583, 1998. | bib ]
[22] R. Smarandache and J. Rosenthal, “Convolutional code constructions resulting in maximal or near maximal free distance,” in Proceedings of the 1998 IEEE International Symposium on Information Theory, (Boston, MA), p. 308, 1998. | bib ]
[23] J. Rosenthal and R. Smarandache, “Construction of convolutional codes using methods from linear systems theory,” in 35-th Annual Allerton Conference on Communication, Control, and Computing, pp. 953-960, 1997. | bib ]