Abstract

An algorithm is given for the k-error linear complexity of sequences over GF(pm) with period pn, p a prime. The algorithm is derived by the generalized Games–Chan algorithm for the linear complexity of sequences over GF(pm) with period pn and by using the modified cost different from that used in the Stamp–Martin algorithm for sequences over GF(2) with period 2n. A method is also given for computing an error vector which gives the k-error linear complexity.

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 call

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.