A New Bound for Cyclic Codes Beating the Roos Bound
From MaRDI portal
Publication:2850007
DOI10.1007/978-3-642-40663-8_11zbMATH Open1318.94121arXiv1306.4849OpenAlexW3102464391MaRDI QIDQ2850007
Massimiliano Sala, Matteo Piva
Publication date: 20 September 2013
Published in: Algebraic Informatics (Search for Journal in Brave)
Abstract: We use the algebraic structure of cyclic codes and some properties of the discrete Fourier transform to give a reformulation of several classical bounds for the distance of cyclic codes, by extending techniques of linear algebra. We propose a bound, whose computational complexity is polynomial bounded, which is a generalization of the Hartmann-Tzeng bound and the Betti-Sala bound. In the majority of computed cases, our bound is the tightest among all known polynomial-time bounds, including the Roos bound.
Full work available at URL: https://arxiv.org/abs/1306.4849
This page was built for publication: A New Bound for Cyclic Codes Beating the Roos Bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2850007)
