Algebraic characterization of MDS group codes over cyclic groups
IEEE Transactions on Information Theory - Part 2
A cyclic [6,3,4] group code and the hexacode over GF(4)
IEEE Transactions on Information Theory
Subspace subcodes of Reed-Solomon codes
IEEE Transactions on Information Theory
A generalized DFT for Abelian codes over Zm
IEEE Transactions on Information Theory
Quasicyclic codes of index l over Fq viewed as Fq[x]-submodules of Fql[x]/ċ xmċ1ċ
AAECC'03 Proceedings of the 15th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Quaternary 1-generator quasi-cyclic codes
Designs, Codes and Cryptography
| Hi-index | 0.00 |
Codes over Fqm that form vector spaces over Fq are called Fq-linear codes over Fqm. Among these we consider only cyclic codes and call them Fq-linear cyclic codes (FqLC codes) over Fqm. This class of codes includes as special cases (i) group cyclic codes over elementary abelian groups (q = p, a prime), (ii) subspace subcodes of Reed-Solomon codes and (iii) linear cyclic codes over Fq (m=1). Transform domain characterization of FqLC codes is obtained using Discrete Fourier Transform (DFT) over an extension field of Fqm. We showho wone can use this transform domain structures to estimate a minimum distance bound for the corresponding quasicyclic code by BCH-like argument.