Article history: Received 13 February 2014 Accepted 18 April 2014 Available online 2 June 2014 Communicated by Gary L. Mullen

In algebraic coding theory it is common practice to require that (n, q) = 1, where n is the word length and F = GF(q) is the alphabet. In this paper, which is about constacyclic codes, we shall stick to this practice too. Since linear codes have the structure of linear subspaces of F , an alternative description of constacyclic codes in terms of linear algebra appears to be another quite natura...

Quantum error-correcting codes play an important role in both quantum communication and quantum computation. It has experienced a great progress since the establishment of the connections between quantum codes and classical codes (see [4]). It was shown that the construction of quantum codes can be reduced to that of classical linear error-correcting codes with certain self-orthogonality proper...

We consider the algorithmic problem of computing a primitive idempotent central simple algebra over field rational functions finite field. The is given by set structure constants. reduced to computation division Brauer equivalent algebra. This constructed as cyclic algebra, once Hasse invariants have been computed. give an application skew constacyclic convolutional codes.

Symbol-pair code is a new coding framework which is proposed to correct errors in the symbolpair read channel. In particular, maximum distance separable (MDS) symbol-pair codes are a kind of symbol-pair codes with the best possible error-correction capability. Employing cyclic and constacyclic codes, we construct three new classes of MDS symbol-pair codes with minimum pairdistance five or six. ...