Publications

Book Chapters

Journal Papers

  1. S. Laendner, T, Hehn, O. Milenkovic, and J. Huber, Two methods for reducing the error floor of LDPC codes
    submitted, December 2006.
  2. V. Nagarajan, S. Laendner, N. Jayakumar, O. Milenkovic and S. Khatri, High-Throughput VLSI Implementations of Iterative Decoders and Related Code Construction Problems,
    accepted for publication, Springer Verlag, December 2006.
  3. O. Milenkovic, E. Soljanin, and P. Whiting, Asymptotic Spectra of Trapping Sets in Regular and Irregular LDPC Code Ensembles,
    IEEE Trans. on Info. Theory, vol. 53, no. 1, pp. 39-55, January 2007.
  4. S. Laendner and O. Milenkovic, Codes Based on Latin Squares: Stopping Set, Trapping Set, and Cycle-Length Distribution Analysis,
    to appear in IEEE Trans. on Communication Theory, February 2007.
  5. O. Milenkovic, D.Leyba, and N. Kashyap, Shortened Array Codes of Large Girth,
    IEEE Trans. on Info. Theory, Vol. 5, No. 8, pp. 3707-3722, August 2006.
  6. O. Milenkovic and N. Kashyap, On the Design of Codes for DNA Computing,
    Lecture Notes in Computer Science 3969, pp. 100-119, Springer Verlag, Berlin-Heidelberg, 2006.
  7. V. Kumar and O. Milenkovic, On Unequal Error Protection LDPC Codes Based on Plotkin-type Constructions,
    IEEE Transactions on Communications, vol. 54, no. 6, pp. 994-1005, June 2006.
  8. V. Kumar and O. Milenkovic, On Graphical Representations of Algebraic Codes Suitable for Iterative Decoding,
    IEEE Communication Letters, Vol. 9, No. 8, pp. 729-731, August 2005.
  9. O.Milenkovic and K. Compton, Average Case Analysis of Gosper's Algorithm for a Class of Urn Model Inputs,
    Algorithmica, Vol. 43, No. 3, pp. 211-244, September 2005.
  10. I. Djordjevic, O. Milenkovic, and B. Vasic, Generalized LDPC Codes for Long-Haul Optical Communication Systems,
    IEEE Journal of Lightwave Technology, Vol. 23, No. 5, pp. 1939-1946, May 2005.
  11. O. Milenkovic, Higher Weight and Coset Weight Enumerators of Formally Self-Dual codes,
    Designs, Codes and Cryptography, Vol. 35, pp. 81-109, April 2005.
  12. O. Milenkovic, I. Djordjevic, and B. Vasic, Block-Circulant Low-Density Parity-Check Codes for Optical Communication Systems,
    IEEE Journal of Selected Topics in Quantum Electronics, Vol. 10, No. 2, pp. 294-299, April 2004.
  13. B. Vasic, O. Milenkovic, Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding,
    IEEE Transactions on Information Theory, Vol. 50, No.6, pp 1156-1176, June 2004.
  14. O. Milenkovic, K. Compton, Probabilistic Transforms and Combinatorial Urn Models,
    Combinatorics, Probability and Computing, pp. 645-675, Vol. 13 No. 4-5, July-September 2004.
  15. O. Milenkovic, S. Coffey, K. Compton, The Third Support Weight Enumerators of the [32,16,8] Doubly-Even, Self-Dual Codes,
    IEEE Transactions on Information Theory, Vol. 49, No. 3, March 2003.
  16. O. Milenkovic, and B. Vasic, Permutation (d,k) Codes: Efficient Enumerative Coding and Phrase Length Distribution Shaping,
    IEEE Transactions on Information Theory, Vol. 46, No.7, pp. 2671-2675, Nov. 2000.
  17. B. Vasic, S.McLaughlin, and O. Milenkovic, Shannon Capacity of M-ary Redundant Multitrack Runlength Limited Codes,
    IEEE Transactions on Information Theory, Vol. 44, No. 2, pp. 766-774, March 1998.
  18. B. Vasic, and O. Milenkovic, Power Spectral Density of Multitrack (0,G/I) Codes,
    IEEE Electronics Letters, Vol. 33, No. 9, pp.784-786, April 1997.
  19. O. Milenkovic, S. McLaughlin, B.Vasic, Scrambling for Unequiprobable Signaling,
    IEEE Electronics Letters, Vol. 32, No. 17, pp. 1551-1552, Aug. 1996.

Selected Conference Publications

  1. A. McGregor and O. Milenkovic, On the Hardness of Approximating Stopping and Trapping Sets in LDPC Codes,
    submitted to ITW'2007, Lake Tahoe, Sept. 2007.
  2. M. Sheikh, S. Sarvotham, O. Milenkovic, and R. Baraniuk, DNA Array Decoding from Nonlinear Measurements by Belief Propagation,
    submitted, April 2007.
  3. O. Milenkovic, Constrained Coding for Context-Free Languages with Applications to Genetic Sequence Modelling,
    accepted for presentation at ISIT'2007, France, June 2007.
  4. T. Hehn, O. Milenkovic, S. Laendner, and J. Huber Permutation Decoding and the Stopping Redundancy Hierarchy of Linear Block Codes,
    accepted for presentation at ISIT'2007, France, June 2007.
  5. T. Hehn, J. Huber, S. Laendner, and O. Milenkovic, Multiple-Bases Belief Propagation for Decoding of Short Block Codes,
    accepted for presentation at ISIT'2007, France, June 2007.
  6. O. Milenkovic, On the generalized reversal distance,
    American Mathematical Society Meeting, New Orleans, January 2007. September 2006 (invited paper).
  7. O. Milenkovic, Enumerating RNA Shapes: A Constrained Coding Approach,
    Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, October 2006. September 2006 (invited paper).
  8. T. Hehn, S. Laendner, O. Milenkovic, and J. Huber, The stopping redundancy hierarchy of cyclic codes,
    Allerton Conference on Communications, Control and Computing, September 2006 (regular paper).
  9. O. Milenkovic, Enumerating RNA Motifs: A Coding-Theoretic Approach,
    Allerton Conference on Communications, Control and Computing, September 2006 (invited paper).
  10. S. Laendner, T. Hehn, O. Milenkovic, and J. Huber, When does one parity-check equation matter?,
    presented at Globecom 2006, San Francisco.
  11. O. Milenkovic, E. Soljanin, and P. Whiting, Stopping and Trapping Sets in Generalized Covering Arrays,
    accepted for presentation at CISS'2006, Princeton, NJ.
  12. O. Milenkovic, Error and Quality Control Coding for DNA Microarrays,
    presented at the Inaugural Workshop of the Center for Information Theory and Application (ITA), San Diego, February 2006.
  13. O. Milenkovic, E. Soljanin, and P. Whiting, Trapping Sets in Irregular LDPC Code Ensembles,
    accepted for presentation at ICC'2006, Istanbul, Turkey.
  14. O. Milenkovic, and N. Kashyap, Construction of DNA Codes which Avoid Secondary Structures,
    accepted for presentation at ISIT'05.
  15. V. Kumar and O. Milenkovic, Improved Distance Bounds for Recursive Decoding of Reed-Muller Codes,
    accepted for presentation at ISCTA 2005, Ambleside, UK.
  16. S. Laendner, and O. Milenkovic, Algorithmic and Combinatorial Analysis of Trapping Sets in Structured LDPC Codes,
    accepted for presentation at WirelessCom 2005, Hawaii, USA.
  17. S. Denic, C. Charalambous, S. Djouadi, O. Milenkovic Capacity of MIMO Gaussian Channels with H^{\infty} Normed Channel Uncertainties,
    accepted for presentation at CWIT'2005.
  18. O. Milenkovic and S. Denic, Characterization of Generalized Tsallis Entropies,
    accepted for presentation at CWIT'2005.
  19. O. Milenkovic, N. Kashyap, and B. Vasic, Coding for DNA Computers Controlling Gene Expression Levels,
    Invited Talk, CDC'2005, Spain.
  20. S. Chilappagari, O. Milenkovic and B. Vasic, Compression of DNA Sequences using Fractal Grammars and Integer Wavelet Transforms,
    accepted for presentation at GENSIPS'2005.
  21. V. Kumar and O. Milenkovic, On Representations of Algebraic Codes Suitable for Iterative Decoding,
    Proceedings of the CISS'2005, Baltimore.
  22. O. Milenkovic and N. Kashyap, New Constructions of Codes for DNA Computing,
    Proceedings of the WCC'05, pp. 204-214, Bergen, Norway, March 2005.
  23. O. Milenkovic, The Yang-Lee Zeros Model with Applications to Coding Theory
    Invited Talk, Workshop on Statistical Physics and Coding, Santa Fee, January 2005.
  24. I. B. Djordjevic, O. Milenkovic, and B. Vasic, “Generalized Low-Density Parity-Check Codes for Long-Haul High-Speed Optical Communication,
    presented at the Optical Fiber Communications Conference (OFC) 2005.
  25. V. Nagarajan, N. Jayakumar, S. Khatri and O. Milenkovic, High Throughput VLSI Implementations of Iterative Decoders and Related Code Construction Problems,
    Proceedings of Globecom 2004, Dallas, December 2004.
  26. V. Kumar and O. Milenkovic Unequal Error Protection LDPC Codes Based on Plotkin-Type Constructions,
    Proceedings of Globecom 2004, Dallas, December 2004.
  27. O. Milenkovic, Problems in Combinatorial and Number Theory Arising in the Construction of LDPC Codes,
    presented at the Regional AMS Meeting, Illinois, October 2004.
  28. O. Milenkovic, and B. Vasic Information Theory Problems in Genetics,
    Proceedings of the ITW'2004, San Antonio, October 2004.
  29. O. Milenkovic, D. Leyba, D. Bennett and N. Kashyap New Partition Regular Sequences and Array Codes of Large Girth,
    presented at the 42nd Allerton Conference on CCC, September 2004.
  30. V. Kumar, O. Milenkovic, and B. Vasic Structured LDPC Codes over GF(q) and Companion Matrix Based Decoding,
    Proceedings of the ISIT'2004, Chicago, June 2004.
  31. O. Milenkovic, Analysis of Urn Models with Applications to Coding Theory,
    Proceedings of ISIT'2004, Chicago, June 2004.
  32. O. Milenkovic, and B. Vasic The Information Processing Mechanism of DNA and Efficient DNA Storage,
    DIMACS Workshop, Rutgers University, March 2004.
  33. V. Nagarajan, and O.Milenkovic, Performance Analysis of Structured LDPC codes in the Polya-Urn Channel with Finite Memory,
    Proceedings of the CCECE'2004, Niagara Falls, Canada 2004.
  34. O. Milenkovic and S. Laendner Analysis of the Cycle Structure of LDPC Codes Based on Latin Squares,
    Proceedngs of the ICC'04, Paris, France 2004.
  35. O. Milenkovic, V. Kumar, and B. Vasic, Analysis of Companion Matrix Based Iterative Decoding of LDPC Codes over the Field GF(p^m) ,
    presented at CTW'04, Capri 2004.
  36. O. Milenkovic, K.Prakash, and B. Vasic, Regular and Irregular Low Density Parity Check Codes for Iterative Decoding based on Cycle-Invariant Difference Sets,
    41st Allerton conference on communication, control and computing, Illinois, 2003.
  37. O. Milenkovic, B. Vasic, Asymptotic Analysis of A* ML Decoding with Reliability Reordering,
    Proceedings of the ITW'03, Paris, 2003.
  38. O. Milenkovic, K. Compton, Average Case Analysis of Gosper's Algorithm,
    Invited Talk, AMS Meeting, Bloomington, Indiana 2003.
  39. K. Compton, O. Milenkovic, Probabilistic Transforms in the Analysis of Algorithms,
    Seminar on Analysis of Algorithms, Strobl, Austria, 2002.
  40. K. Compton, O. Milenkovic, An Analysis Inspired by Gosper's Algorithm,
    Seminar on Analysis of Algorithms, Tatihou, France, 2001.
  41. O. Milenkovic, and K. Compton, A Method for Reducing the Number of Unknown Coefficients in Generalized Hamming Weight Enumerators,
    ISIT 2002, Lauzanne, Switzerland
  42. O. Milenkovic, On the Generalized Hamming Weight Enumerators and Coset Weight Distributions of Even, Isodual Codes,
    ISIT 2001, Washington, USA.
  43. B. Vasic, S.McLaughlin, and O.Milenkovic, M-ary(d,k) Codes,
    ISIT 1997, Ulm, Germany
  44. B. Vasic, and O. Milenkovic, Cyclic Two-Dimensional IT Reducing Codes,
    ISIT 1997, Ulm, Germany
  45. O. Milenkovic and B. Vasic , Power Spectral Density of Multitrack (0,G/I) Codes,
    ISIT 1997, Ulm, Germany.
  46. O.Milenkovic, S. Denic, and B.Vasic, Novel Multilevel (d,k) Codes,
    accepted for presentation at CWIT'1997, Whistler, Canada.
  47. B.Vasic, O.Milenkovic, and D.Vasic, Channel Capacities and Spectra of Maxentropic (O,G/I) Matched-Spectral-Null Sequences,
    Proceedings of the IEEE IT Workshop, Rydzyna, Poland, 1995.
  48. MSc and PhD Thesis

    PRESENTATIONS

    Back