Samara University Repository
Welcome to the Samara University repository!
This is an open electronic archive created to preserve and disseminate the scientific results of our university. The works of researchers, faculty members, and students are available to everyone for academic and research purposes.
The repository contains dissertations, research articles, educational and methodological materials, monographs, and regulatory documents. The collections cover a wide range of fields: from aerospace technologies, engine engineering, and computer science to history, linguistics, mathematics, and ecology. The archive brings together the scientific heritage of the university, including materials prepared during the period of Samara State Aerospace University and Samara State University.
Looking for publications by author, title, date, or subject? Full-text search will provide relevant results. Want to explore the academic life more closely? Browse materials by the universityâs organizational units.
Descriptions of all publications and articles available in the repository can be found in the libraryâs electronic catalog. Staff and students can log in via the menu "Login -> My Resource Archive" using their personal account credentials (SSAU_id).
Use the archive for study, research, and professional development!
| Title: | Representation of MarkovFunctions byMinimal Polynomials over a Finite Field |
| Issue Date: | 2018 |
| Publisher: | Новая техника |
| Citation: | Zakharov V.M. Representation of MarkovFunctions byMinimal Polynomials over a Finite Field / V.M. Zakharov, S.V. Shalagin, B.F. Eminov // Сборник трудов IV международной конференции и молодежной школы «Информационные технологии и нанотехнологии» (ИТНТ-2018) - Самара: Новая техника, 2018. - С.1952-1959. |
| 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. |
| URI: | http://repo.ssau.ru/jspui/handle/123456789/13997 |
| Appears in Collections: | Информационные технологии и нанотехнологии |
| File | Description | Size | Format | |
|---|---|---|---|---|
| paper_263.pdf | Основная статья | 457.58 kB | Adobe PDF | View/Open |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.