Learn More
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)
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)
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)
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)
Repeated-root cyclic and negacyclic codes over a nite chain ring „his item w—s su˜mitted to vough˜orough …niversity9s snstitution—l ‚epository ˜y theG—n —uthorF Citation: ƒeveqiexD eFwFD PHHTF ‚epe—tedEroot ™y™li™ —nd neg—™y™li™ ™odes over — (nite ™h—in ringF his™rete —pplied m—them—ti™sD ISR @PAD ppF RIQERIW Additional Information: • „his —rti™le w—s(More)