### ?

## Upper bound on the performance of an order statistics-based decoder

.

Osipov D., Lecture Notes in Computer Science 2012 Vol. 7642 LNCS P. 37-48

In what follows an upper bound for the probability of erroneous decoding in a coded DHA FH OFDMA system with a noncoherent ML detector under multitone jamming is introduced. ...

Added: February 6, 2013

Zhilin I., Kreshchuk A., Zyablov V. V., Journal of Communications Technology and Electronics 2015 Vol. 60 No. 6 P. 695-706

Generalized error-locating codes are discussed. An algorithm for calculation of the upper bound of the probability of erroneous decoding for known code parameters and the input error probability is given. Based on this algorithm, an algorithm for selection of the code parameters for a specified design and input and output error probabilities is constructed. The ...

Added: January 30, 2018

Ivanov F., Rybin P., , in: Proccedings of the International Symposium on Information Theory and Its Applications (ISITA 2018). .: IEEE, 2018.. Ch. 1. P. 560-564.

We consider a new signal-code construction for a special class of multiple access system over vector-disjunctive channel when users transmit some vector of bits of finite length L. We propose a special encoding and decoding algorithms for such transmission scenario. Our suggested methods of encoding and decoding on one hand have acceptable complexity for a ...

Added: October 30, 2019

Osipov D., , in: Multiple Access Communications. Vol. 8715: 7th International Workshop, MACOM 2014, Halmstad, Sweden, August 27-28, 2014. Proceedings.: Halmstad: Springer, 2014.. P. 29-34.

Future generation communication systems will have to endure interference induced by communication systems operating within the same frequency bands. Recently several coded DHA FH OFDMA systems employing rank-based detectors able to solve this problem were proposed. Unfortunately such detectors have relatively high complexity. In what follows a reduced-complexity detector using only column sorting for a ...

Added: October 29, 2014

Cham: Springer, 2016

This book constitutes the proceedings of the 9th International Workshop on Multiple Access Communications, MACOM 2016, held in Aalborg, Denmark, in November 2016. The 10 full papers presented in this volume were carefully reviewed and selected from 12 submissions. They were organized in topical sections named: physical layer aspects; MAC layer aspects; and information theory. ...

Added: January 4, 2017

Субботин А. А., Osipov D., , in: Multiple Access Communications. 9th International Workshop, MACOM 2016, Aalborg, Denmark, November 21-22, 2016, Proceedings. .: Cham: Springer, 2016.. P. 15-29.

In what follows a coded DHA FH OFDMA employing robust reception and concatenated coding construction is considered. The problem of employing Generalized Minimum Distance decoder as an outer code decoder is considered. The effectiveness of the proposed decision is verified by means of simulation. In particular performance of the communication system under intensive mixed interference ...

Added: January 4, 2017

Springer, 2015

This book constitutes the refereed proceedings of the 8th International Workshop on Multiple Access Communications, MACOM 2015, held in Helsinki, Finland, in September 2015.
The 12 full papers presented were carefully reviewed and selected from 18 submissions. They describe the latest advancements in the field of multiple access communications with an emphasis on wireless sensor networks; ...

Added: August 28, 2015

Podolskaya O., В кн.: Материалы IX молодежной научной школы по дискретной математике и ее приложениям (Москва, 16-21 сентября 2013 г.). .: М.: Издательство ИПМ РАН, 2013.. С. 97-100.

We study Boolean circuit complexity in an infinite basis consisting of all Boolean functions that equal 1 only on sets of pair-wise incomparable tuples. It is known that lower bounds on the complexity of linear function, majority function and almost all boolean functions of $n$ variables are of the order $\sqrt n.$ We show that ...

Added: May 31, 2015

Osipov D., , in: Proceedings of the XV International Symposium "Problems of Redundancy in Information and Control Systems" September 26-29, 2016 St. Petersburg, Russia. .: St. Petersburg: IEEE, 2016.. P. 100-104.

In what follows a channel model that describes a class of communication systems employing a certain nonparametric receiver is considered. In particular a block coded transmission via the channel under consideration and soft-input mismatched decoding are considered. The paper deals with a problem of finding an upper bound on the probability of erroneous decoding. In ...

Added: August 22, 2016

Utkina I. E., Batsyn M. V., Batsyna E. K., , 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

Osipov D., Frolov A., Zyablov V., , in: Lecture Notes in Computer Science. Vol. 8072: Wireless Access Flexibility. First International Workshop, WiFlex 2013, Kaliningrad, Russia, September 4-6, 2013. Proceedings.: Berlin, Heidelberg: Springer, 2013.. P. 49-57.

We consider an uncoordinated multiple-access system that employs a modulation technique, in which the probability of suppressing the signal sent by a certain user can be considered negligible, to transmit information via a wireless channel (e.g. time hopping (TH) with pulse position modulation (PPM)).This channel can be considered as an A channel (channel without intensity ...

Added: November 17, 2013

Kulikov A., Podolskii V. V., , in: 34th Symposium on Theoretical Aspects of Computer Science (STACS 2017). March 8–11, 2017, Hannover, Germany. Т. 66.: Лейпциг: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2017.. P. 1-14.

We study the following computational problem: for which values of k, the majority of n bits MAJn can be computed with a depth two formula whose each gate computes a majority function of at most k bits? The corresponding computational model is denoted by MAJk o MAJk. We observe that the minimum value of k ...

Added: June 1, 2017