Abstract
The use of multi-level p.s.k. arouses interest in non-binary error-correcting codes. This paper points out that the algorithm for constructing BCH codes can be applied when the number of levels is a prime or a power of a prime. Quaternary codes are examined. Possible extensions to higher powers of two and to decimal codes are indicated.
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.
