?
Upper bounds for a coded DHA FH OFDMA system with noncoherent threshold reception
P. 53–56.
In what follows the problem of finding upper bounds on denial probability and probability of erroneous decoding in a coded Dynamic Hopset Allocation Frequency Hopping system with noncoherent threshold reception is considered.
In book
St. Petersburg: Institute of Electrical and Electronics Engineers, 2012.
Medvedev V., Canadian Journal of Mathematics 2022 Vol. 74 No. 4 P. 1093–1136
Let $\Sigma$ be a compact surface with boundary. For a given conformal class $c$ on $\Sigma$ the functional $\sigma_k^*(\Sigma,c)$ is defined as the supremum of the $k-$th normalized Steklov eigenvalue over all metrics in $c$. We consider the behaviour of this functional on the moduli space of conformal classes on $\Sigma$. A precise formula for ...
Added: March 21, 2021
Medvedev V., / Series arXiv "math". 2020.
Let $\Sigma$ be a compact surface with boundary. For a given conformal class $c$ on $\Sigma$ the functional $\sigma_k^*(\Sigma,c)$ is defined as the supremum of the $k-$th normalized Steklov eigenvalue over all metrics in $c$. We consider the behaviour of this functional on the moduli space of conformal classes on $\Sigma$. A precise formula for ...
Added: October 31, 2020
Osipov D., Автоматика и телемеханика 2020 № 1 С. 134–146
The model of a channel that describes the transmission of information in communication systems with a single-user receiver based on order statistics is considered. The transmission of information through such a channel using a linear block code is studied. The aim of this paper is to find an upper bound on error probability for the ...
Added: October 27, 2019
Irina Utkina, Mikhail Batsyn, Ekaterina Batsyna, , in: Discrete Optimization and Operations Research/9th International Conference, DOOR 2016, Vladivostok, Russia, September 19-23, 2016, Proceedings.: Springer, 2016. P. 244–255.
We consider a fractional 0-1 programming problem arising in manufacturing. The problem consists in clustering of machines together with parts processed on these machines into manufacturing cells so that intra-cell processing of parts is maximized and inter-cell movement is minimized. This problem is called Cell Formation Problem (CFP) and it is an NP-hard optimization problem ...
Added: October 3, 2018
Zhilin I., Zyablov V., Проблемы передачи информации 2017 Т. 53 № 2 С. 16–39
The paper discusses generalized error locating (GEL) codes over the same alpha- bet for both component codes. The algorithm for computing upper bound on decoding error probability under known input symbol error rate and code parameters. Is is used for construct- ing the algorithm of code parameters selection that maximizes code rate for given construction ...
Added: February 1, 2018
Bartoli D., Davydov A., Kreshchuk A. et al., Electronic Notes in Discrete Mathematics 2017 Vol. 57 P. 21–26
In this work we summarize some recent results to be included in a forthcoming paper [Bartoli, D., A. A. Davydov, A. A. Kreshchuk, S. Marcugini and F. Pambianco, Small complete caps in PG(3,q) and PG(4,q), preprint]. We present and analyze computational results concerning small complete caps in the projective spaces PG(N,q) of dimension N=3and N=4 over the finite field of order q. The ...
Added: January 29, 2018
Kabatiansky G. A., Fernandez M., Moreira J., Designs, Codes and Cryptography 2016 Vol. 80 No. 1 P. 11–28
In this paper we discuss some variations of the notion of separating code for alphabets of arbitrary size. We show how the original definition can be relaxed in two different ways, namely almost separating and almost secure frameproof codes, yielding two different concepts. The new definitions enable us to obtain codes of higher rate, at ...
Added: March 15, 2017