Izv. Saratov Univ. (N.S.), Ser. Math. Mech. Inform., 2015, Volume 15, Issue 1, Pages 106–112
Models of information $K$-channels with memory
A. A. L'vova, M. S. Svetlovb, Yu. A. Ulyaninaa
a Saratov State Technical University named after Gagarin Yu. A., 77, Politechnicheskaya str., 410054, Saratov, Russia
b Institute of Precision Mechanics and Control, Russian Academy of
Sciences, 24, Rabochaya str., 410028, Saratov, Russia
Analysis of non-binary ($K$-ary, $K\geqslant3$) information channels (IC) with memory as complex stochastic structures is rather complicated mathematically. Of significant interest is the synthesis of simplified mathematical models for such channels that allow clarifying relatively simply the most important regularities occurring in real processes. Modeling of IC ($K$-channels) with memory is a vital problem that has both theoretical and practical importance. In this paper models of discrete $K$-channels with memory are presented, their graphs of transition probabilities for various operating conditions built, and probabilities of outcomes of reception for symbols of the used alphabet estimated.
$K$-channel, mathematical model, transition probability, unconditional probability.
PDF file (448 kB)
A. A. L'vov, M. S. Svetlov, Yu. A. Ulyanina, “Models of information $K$-channels with memory”, Izv. Saratov Univ. (N.S.), Ser. Math. Mech. Inform., 15:1 (2015), 106–112
Citation in format AMSBIB
\by A.~A.~L'vov, M.~S.~Svetlov, Yu.~A.~Ulyanina
\paper Models of information $K$-channels with memory
\jour Izv. Saratov Univ. (N.S.), Ser. Math. Mech. Inform.
Citing articles on Google Scholar:
Related articles on Google Scholar:
|Number of views:|