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