The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ana Salagean: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Yee Chung Cheung, Paul Wai Chung, Ana Salagean
    A Set Theoretic View of the ISA Hierarchy. [Citation Graph (0, 0)][DBLP]
    IEA/AIE, 2006, pp:127-136 [Conf]
  2. Graham H. Norton, Ana Salagean
    On Efficient Decoding of Alternant Codes over a Commutative Ring. [Citation Graph (0, 0)][DBLP]
    IMA Int. Conf., 1999, pp:173-178 [Conf]
  3. Hongmei He, Ondrej Sýkora, Ana Salagean
    Various Island-based Parallel Genetic Algorithms for the 2-Page Drawing Problem. [Citation Graph (0, 0)][DBLP]
    Parallel and Distributed Computing and Networks, 2006, pp:316-323 [Conf]
  4. Ana Salagean
    On the Computation of the Linear Complexity and the k-Error Linear Complexity of Binary Sequences with Period a Power of Two. [Citation Graph (0, 0)][DBLP]
    SETA, 2004, pp:179-184 [Conf]
  5. Graham H. Norton, Ana Salagean
    On the Structure of Linear and Cyclic Codes over a Finite Chain Ring. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 2000, v:10, n:6, pp:489-506 [Journal]
  6. Ana Salagean
    Repeated-root cyclic and negacyclic codes over a finite chain ring. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2006, v:154, n:2, pp:413-419 [Journal]
  7. Hongmei He, Ondrej Sýkora, Ana Salagean, Erkki Mäkinen
    Parallelisation of genetic algorithms for the 2-page crossing number problem. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2007, v:67, n:2, pp:229-241 [Journal]
  8. Graham H. Norton, Ana Salagean
    On the Hamming distance of linear codes over a finite chain ring. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2000, v:46, n:3, pp:1060-1067 [Journal]
  9. Ana Salagean
    On the computation of the linear complexity and the k-error linear complexity of binary sequences with period a power of two. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:3, pp:1145-1150 [Journal]

  10. Modified Berlekamp-Massey Algorithm for Approximating the k -Error Linear Complexity of Binary Sequences. [Citation Graph (, )][DBLP]


  11. A genetic algorithm for computing the k-error linear complexity of cryptographic sequences. [Citation Graph (, )][DBLP]


Search in 0.015secs, Finished in 0.016secs
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