Full metadata record
DC FieldValueLanguage
dc.date2018
dc.date.accessioned2025-08-22T12:19:38Z-
dc.date.available2025-08-22T12:19:38Z-
dc.date.issued2018
dc.identifier.identifierDspace\SGAU\20180516\69405
dc.identifier.citationZakharov 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.
dc.identifier.urihttp://repo.ssau.ru/jspui/handle/123456789/13997-
dc.description.abstractThe 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.
dc.description.sponsorshipThis work was supported by RFBR Grant 18-01-00120а «Specialized devices for generating and processing data sets in the architecture of programmable logic devices class FPGA».
dc.languageen_US
dc.publisherНовая техника
dc.titleRepresentation of MarkovFunctions byMinimal Polynomials over a Finite Field
dc.typeArticle
local.identifier.oldurihttp://repo.ssau.ru/handle/Informacionnye-tehnologii-i-nanotehnologii/Representation-of-MarkovFunctions-byMinimal-Polynomials-over-a-Finite-Field-69405
local.identifier.oldurihttp://repo.ssau.ru/handle/Informacionnye-tehnologii-i-nanotehnologii/Representation-of-MarkovFunctions-byMinimal-Polynomials-over-a-Finite-Field-69405
Appears in Collections:Информационные технологии и нанотехнологии

Files in This Item:
File Description SizeFormat 
paper_263.pdfОсновная статья457.58 kBAdobe PDFView/Open


Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.