Results 1 to 10 of about 80 (79)

Upper Bounds of the Complexity of Functions over Finite Fields in Some Classes of Kroneker Forms

open access: yesИзвестия Иркутского государственного университета: Серия "Математика", 2015
Polynomial representations of Boolean functions have been studied well enough. Recently, the interest to polynomial representations of functions over finite fields and over finite rings is being increased.
A.S. Baliuk, G.V. Yanushkovsky
doaj   +1 more source

An Approach for Reconfigurable Intelligent Surface (RIS) design for MIMO-NOMA Transmission: theoretical study [PDF]

open access: yes, 2022
The approach (Paradigm) presented hereafter was inspired by two basic ideas: assuming the MIMO-RIS-NOMA communication channel as a dispersive channel with fading and representing the later by means of Generalized Kroneker Channel model (GKCM) applying ...
Valeri Kontorovich (12091406)
core   +1 more source

Lower Bound of the Complexity of Seven-Valued Functions in the Class of Polarized Polynomials

open access: yesИзвестия Иркутского государственного университета: Серия "Математика", 2017
One of the directions of the investigation of functions over finite fields is the study of their representations, including polynomial ones. In the area of polynomial representations of functions the problem of estimating the complexity of such ...
A.S. Baliuk, A.S. Zinchenko
doaj   +1 more source

Lower Bound of the Complexity of Functions over Finite Field of Order 4 in the Class of Polarized Polynomials

open access: yesИзвестия Иркутского государственного университета: Серия "Математика", 2016
The representations, including polynomial, of functions over final fields have been actively investigated. The complexity of such representations is the main stream of research.
A. Baliuk, A.S. Zinchenko
doaj  

Home - About - Disclaimer - Privacy