Abstract
For an odd integer B 0 mod(3) and for a cyclotomic coset C of integers modulo B having the property: if r ε C , then B — r ε C ; the number of integers which belong to C and to the half-open interval ( B /3, 2 B /3 is lower bounded. This result is then used to obtain a lower bound on the minimum arithmetic distance of a cyclic AN -code with generator A and length n whenever B = (2 n −1)/ A is not divisible by 3 and B |2 q + 1 for some integer q .
Sign-in/Register to access full text options 
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.
