Abstract
The problem of finding the covering radius and minimum distance of algebraic and arithmetic codes is shown to be related to Waring's problem in a finite field and to the theory of cyclotomic numbers. The methods developed lead to new results for the covering radius of certain t-error-correcting BCH codes. Further, new results are given for the covering radius and the minimum distance of some classes of arithmetic codes generated by prime numbers.
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.
