Cyclotomic Constructions of Cyclic Codes With Length Being the Product of Two Primes

From MaRDI portal
Publication:5272005

DOI10.1109/TIT.2011.2176915zbMATH Open1365.94553arXiv1111.2991OpenAlexW2110017198MaRDI QIDQ5272005FDOQ5272005


Authors: Cunsheng Ding Edit this on Wikidata


Publication date: 12 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: Cyclic codes are an interesting type of linear codes and have applications in communication and storage systems due to their efficient encoding and decoding algorithms. They have been studied for decades and a lot of progress has been made. In this paper, three types of generalized cyclotomy of order two and three classes of cyclic codes of length n1n2 and dimension (n1n2+1)/2 are presented and analysed, where n1 and n2 are two distinct primes. Bounds on their minimum odd-like weight are also proved. The three constructions produce the best cyclic codes in certain cases.


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







Cited In (20)





This page was built for publication: Cyclotomic Constructions of Cyclic Codes With Length Being the Product of Two Primes

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