|
|
Article: Data on symbolic computation detailed by researchers at University of Rennes.
- Article from:
- Mathematics Week
- Article date:
- November 10, 2009
CopyrightCOPYRIGHT 2009 NewsRX. This material is published under license from the publisher through the Gale Group, Farmington Hills, Michigan. All inquiries regarding rights should be directed to the Gale Group. (Hide copyright information)
|
"In analogy to cyclic codes, we study linear codes over finite fields obtained from left ideals in a quotient ring of a (non-commutative) skew polynomial ring. The paper shows how existence and properties of such codes are linked to arithmetic properties of skew polynomials," researchers in Rennes, France report.
"This class of codes is a generalization of the theta-cyclic codes discussed in [Boucher, D., Geiselmann, W., Ulmer, F., 2007. Skew cyclic codes. Applied Algebra in Engineering, Communication and Computing 18, 379-389]. However theta-cyclic codes are powerful representatives of this family and we show that the dual of a theta-cyclic code is still ...