Abstract
There have been useful lower bounds for the minimum distance of a cyclic code, BCH bound, Hartmann-Tzeng bound, Roos bound and Shift bound. The authors proposed a lower bound of minimum distance by discrete Fourier transform (DFT) in 2010. The relationship between BCH bound, Hartmann-Tzeng bound and Roos bound, BCH bound, Hartmann-Tzeng bound and Shift bound are known, respectively. However, it's unknown the relationship between Roos bound, Shift bound and Proposed bound. In this paper, we discuss this relation with the cyclic codes.
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.
