Abstract
The method of representing Markov functions with minimal characteristic polynomials over a finite field is proposed. These polynomials are defined on the basis of integrated stochastic matrices. The representation accuracy of stochastic matrices is linearly dependent on the minimum degree of the polynomials. The algorithmic implementation of the method is shown to build a sequence of the Markov functions class considered, with a given 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 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.
