Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
