Five infinite families of binary cyclic codes and their related codes with good parameters

From MaRDI portal
Publication:6136718

DOI10.1016/J.FFA.2023.102270arXiv2301.06446OpenAlexW4385505927MaRDI QIDQ6136718FDOQ6136718

Cunsheng Ding, Chengju Li, Hai Liu

Publication date: 31 August 2023

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Abstract: Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. Inspired by the recent work on binary cyclic codes published in IEEE Trans. Inf. Theory, vol. 68, no. 12, pp. 7842-7849, 2022, the objectives of this paper are the construction and analyses of five infinite families of binary cyclic codes with parameters [n,k] and (n6)/3leqkleq2(n+6)/3. Three of the five families of binary cyclic codes and their duals have a very good lower bound on their minimum distances and contain distance-optimal codes. The other two families of binary cyclic codes are composed of binary duadic codes with a square-root-like lower bound on their minimum distances. As a by-product, two infinite families of self-dual binary codes with a square-root-like lower bound on their minimum distances are obtained.


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




Recommendations




Cites Work


Cited In (5)





This page was built for publication: Five infinite families of binary cyclic codes and their related codes with good parameters

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