Skew codes of prescribed distance or rank

详细信息    查看全文

• 作者：Lionel Chaussade ; Pierre Loidreau and Felix Ulmer
• 关键词：Error ; correcting codes ; Skew polynomial ; Rank of a code
• 刊名：Designs, Codes and Cryptography
• 出版年：2009
• 出版时间：March, 2009
• 年：2009
• 卷：50
• 期：3
• 页码：267-284
• 全文大小：247.4 KB

文摘

In this paper we generalize the notion of cyclic code and construct codes as ideals in finite quotients of non-commutative polynomial rings, so called skew polynomial rings of automorphism type. We propose a method to construct block codes of prescribed rank and a method to construct block codes of prescribed distance. Since there is no unique factorization in skew polynomial rings, there are much more ideals and therefore much more codes than in the commutative case. In particular we obtain a [40, 23, 10]₄ code by imposing a distance and a [42,14,21]₈ code by imposing a rank, which both improve by one the minimum distance of the previously best known linear codes of equal length and dimension over those fields. There is a strong connection with linear difference operators and with linearized polynomials (or q-polynomials) reviewed in the first section.