Cyclic codes from two-prime generalized cyclotomic sequences of order 6

From MaRDI portal
Publication:340160

DOI10.3934/AMC.2016036zbMATH Open1409.94937arXiv1510.01022OpenAlexW2963375796MaRDI QIDQ340160FDOQ340160


Authors: Tongjiang Yan, Yuhua Sun, Yanyan Liu Edit this on Wikidata


Publication date: 11 November 2016

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Abstract: Cyclic codes have wide applications in data storage systems and communication systems. Employing two-prime Whiteman generalized cyclotomic sequences of order 6, we construct several classes of cyclic codes over the finite field GF}(q) and give their generator polynomials. And we also calculate the minimum distance of some cyclic codes and give lower bounds of the minimum distance for some other cyclic codes.


Full work available at URL: https://arxiv.org/abs/1510.01022




Recommendations




Cites Work


Cited In (8)





This page was built for publication: Cyclic codes from two-prime generalized cyclotomic sequences of order 6

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q340160)