The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Olgica Milenkovic: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Olgica Milenkovic, Navin Kashyap
    On the Design of Codes for DNA Computing. [Citation Graph (0, 0)][DBLP]
    WCC, 2005, pp:100-119 [Conf]
  2. Olgica Milenkovic, Kevin J. Compton
    Average Case Analysis of Gosper's Algorithm for a Class of Urn Model Inputs. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:43, n:3, pp:211-244 [Journal]
  3. Olgica Milenkovic, Kevin J. Compton
    Probabilistic Transforms for Combinatorial Urn Models. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2004, v:13, n:4-5, pp:645-675 [Journal]
  4. Olgica Milenkovic
    Support Weight Enumerators and Coset Weight Distributions of Isodual Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2005, v:35, n:1, pp:81-109 [Journal]
  5. Vidya Kumar, Olgica Milenkovic
    On unequal error protection LDPC codes based on plotkin-type constructions. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Communications, 2006, v:54, n:6, pp:994-1005 [Journal]
  6. Olgica Milenkovic, T. S. Coffey, Kevin J. Compton
    The third support weight enumerators of the doubly-even, self-dual [32, 16, 8] codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2003, v:49, n:3, pp:740-746 [Journal]
  7. Olgica Milenkovic, Bane V. Vasic
    Permutation (d, k) codes: Efficient enumerative coding and phrase length distribution shaping. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:7, pp:2671-2675 [Journal]
  8. Bane V. Vasic, Olgica Milenkovic
    Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:6, pp:1156-1176 [Journal]
  9. Bane V. Vasic, Steven W. McLaughlin, Olgica Milenkovic
    Shannon Capacity of M-ary Redundant Multitrack Runlength Limited Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:2, pp:766-774 [Journal]
  10. Olgica Milenkovic, Navin Kashyap, David Leyba
    Shortened Array Codes of Large Girth. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:8, pp:3707-3722 [Journal]
  11. Olgica Milenkovic, Emina Soljanin, P. Whiting
    Asymptotic Spectra of Trapping Sets in Regular and Irregular LDPC Code Ensembles. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:1, pp:39-55 [Journal]
  12. Stefan Laendner, Thorsten Hehn, Olgica Milenkovic, Johannes B. Huber
    When Does One Redundant Parity-Check Equation Matter? [Citation Graph (0, 0)][DBLP]
    GLOBECOM, 2006, pp:- [Conf]
  13. Stefan Laendner, Thorsten Hehn, Olgica Milenkovic, Johannes B. Huber
    Two Methods for Reducing the Error-Floor of LDPC Codes [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  14. Thorsten Hehn, Olgica Milenkovic, Stefan Laendner, Johannes B. Huber
    Permutation Decoding and the Stopping Redundancy Hierarchy of Linear Block Codes [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  15. Andrew McGregor, Olgica Milenkovic
    On the Hardness of Approximating Stopping and Trapping Sets in LDPC Codes [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  16. Olgica Milenkovic, Navin Kashyap, David Leyba
    Shortened Array Codes of Large Girth [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  17. Thorsten Hehn, Olgica Milenkovic, Stefan Laendner, Johannes B. Huber
    Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  18. Sparse weighted Euclidean superimposed coding for integer compressed sensing. [Citation Graph (, )][DBLP]


  19. Sparse weighted Euclidean superimposed coding for integer compressed sensing. [Citation Graph (, )][DBLP]


  20. Probe Design for Compressive Sensing DNA Microarrays. [Citation Graph (, )][DBLP]


  21. List-decoding methods for inferring polynomials in finite dynamical gene network models. [Citation Graph (, )][DBLP]


  22. DNA Codes that Avoid Secondary Structures [Citation Graph (, )][DBLP]


  23. Subspace Pursuit for Compressive Sensing: Closing the Gap Between Performance and Complexity [Citation Graph (, )][DBLP]


  24. Weighted Superimposed Codes and Constrained Integer Compressed Sensing [Citation Graph (, )][DBLP]


  25. Distortion-Rate Functions for Quantized Compressive Sensing [Citation Graph (, )][DBLP]


  26. Multiple-Bases Belief-Propagation Decoding of High-Density Cyclic Codes [Citation Graph (, )][DBLP]


  27. SET: an algorithm for consistent matrix completion [Citation Graph (, )][DBLP]


  28. A Geometric Approach to Low-Rank Matrix Completion [Citation Graph (, )][DBLP]


  29. Subspace Evolution and Transfer (SET) for Low-Rank Matrix Completion [Citation Graph (, )][DBLP]


  30. Sorting of Permutations by Cost-Constrained Transpositions [Citation Graph (, )][DBLP]


Search in 0.379secs, Finished in 0.381secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002