#### Filter Results:

- Full text PDF available (12)

#### Publication Year

1985

2017

- This year (1)
- Last 5 years (9)
- Last 10 years (20)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Graham H. Norton, Ana Salagean
- IEEE Trans. Information Theory
- 2000

2006 IEEE] Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. Abstract Let R be a… (More)

- Ana Salagean
- Discrete Applied Mathematics
- 2006

We show that repeated-root cyclic codes over a finite chain ring are in general not principally generated. Repeated-root negacyclic codes are principally generated if the ring is a Galois ring with characteristic a power of 2. For any other finite chain ring they are in general not principally generated. We also prove results on the structure, cardinality… (More)

- Graham H. Norton, Ana Salagean
- Applicable Algebra in Engineering, Communication…
- 2000

We generalise structure theorems of Calderbank and Sloane for linear and cyclic codes over ℤ pa to a finite chain ring. Our results are more detailed and do not use non-trivial results from Commutative Algebra.

- Ana Salagean
- IEEE Transactions on Information Theory
- 2004

The linear Games-Chan algorithm for computing the linear complexity c(s) of a binary sequence s of period lscr=2<sup>n</sup> requires the knowledge of the full sequence, while the quadratic Berlekamp-Massey algorithm requires knowledge of only 2c(s) terms. We show that we can modify the Games-Chan algorithm so that it computes the complexity in linear time… (More)

- Ana Salagean
- IEEE Transactions on Information Theory
- 2008

We consider the problem of computing a linear recurrence relation (or equivalently a linear feedback shift register) of minimum order for a finite sequence over a field, with the additional requirement that not only the highest but also the lowest coefficient of the recurrence is nonzero. Such a recurrence relation can then be used to generate the sequence… (More)

- Alexandra Alecu, Ana Salagean
- IMA Int. Conf.
- 2007

- Ana Sălăgean
- 2016

Repeated-root cyclic and negacyclic codes over a nite chain ring his item ws sumitted to voughorough
niversity9s snstitutionl epository y theGn uthorF Citation: eveqiexD eFwFD PHHTF epetedEroot yli nd negyli odes over (nite hin ringF hisrete pplied mthemtisD ISR @PAD ppF RIQERIW Additional Information: • his rtile ws… (More)

- Hongmei He, Ondrej Sýkora, Ana Salagean, Erkki Mäkinen
- J. Parallel Distrib. Comput.
- 2007

- Graham H. Norton, Ana Salagean
- Electronic Notes in Discrete Mathematics
- 2001

- Hongmei He, Ana Salagean, Erkki Mäkinen
- Int. J. Comput. Math.
- 2010