Abstract
Let C be the binary narrow-sense BCH code of length n=(2/sup m/-1)/N and designed distance 2t+1, where m is the order of 2 module n. Using characters of finite fields and a theorem of Weil, and results of Vladut-Skorobogatov (1989) and Lang-Weil (1954) we prove that the code C is normal in the non-primitive case N>1 if 2/sup m//spl ges/4(2tN)/sup 4t+2/, and in the primitive case N=1 if m/spl ges/m/sub 0/, where the constant m/sub 0/ depends only on t. >
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 callMore From: Applicable Algebra in Engineering, Communication and Computing
Disclaimer: 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.
