Pages that link to "Item:Q174177"
From MaRDI portal
The following pages link to Problems of Information Transmission (Q174177):
Displaying 50 items.
- On enumeration of \(q\)-ary sequences with a fixed number of occurrences of the subblock 00 (Q764090) (← links)
- On the rate of beta-mixing and convergence to a stationary distribution in continuous-time Erlang-type systems (Q764091) (← links)
- Fast enumeration algorithm for words with given constraints on run lengths of ones (Q764093) (← links)
- Woven convolutional graph codes with large free distances (Q764245) (← links)
- On metric rigidity for some classes of codes (Q764247) (← links)
- Computing the longest common substring with one mismatch (Q764249) (← links)
- Intersection theorem for finite permutations (Q764250) (← links)
- On conditions for a product-form stationary probability distribution of states of a multimode service network (Q764251) (← links)
- A zero-or-one law in aggregated closed queueing networks (Q764252) (← links)
- Enumeration of constant-weight run-length limited binary sequences (Q764254) (← links)
- Iosif Abramovich Ovseevich: in memoriam (Q764255) (← links)
- Remark on the reliability function of a symmetric channel under list decoding (Q764384) (← links)
- On a model and capacity of MIMO channels (Q764385) (← links)
- Generalization of a Pinsker problem (Q764386) (← links)
- On (partial) unit memory codes based on Gabidulin codes (Q764387) (← links)
- Steiner systems \(S(v, k, k - 1)\): components and rank (Q764388) (← links)
- A linear algebraic approach to multisequence shift-register synthesis (Q764390) (← links)
- On universal algorithms for adaptive forecasting (Q764391) (← links)
- Critical states of strongly interacting many-particle systems on a circle (Q764392) (← links)
- Key masking using biometry (Q764394) (← links)
- New \((n, r)\)-arcs in \(\mathrm{PG}(2, 17)\), \(\mathrm{PG}(2, 19)\), and \(\mathrm{PG}(2, 23)\) (Q764397) (← links)
- Classification of optimal \((v, 4, 1)\) binary cyclically permutable constant-weight codes and cyclic \(2\)-\((v, 4, 1)\) designs with \(v \leq 76\). (Q764400) (← links)
- Method of Lyapunov functions for analysis of absorption and explosion in Markov chains (Q764402) (← links)
- On a sequence of random distance graphs subject to the zero-one law (Q764404) (← links)
- Linear algorithm for selecting an almost regular spanning subgraph in an almost regular graph (Q764406) (← links)
- The tree nearest on average to a given set of trees (Q764407) (← links)
- Configuration of overloaded servers with dynamic routing (Q764408) (← links)
- Comparison of contraction coefficients for \(f\)-divergences (Q784380) (← links)
- New upper bounds in the hypothesis testing problem with information constraints (Q784381) (← links)
- Detecting cycles of length 8 in the Tanner graph of a QC-LDPC code based on protograph analysis (Q784385) (← links)
- On adaptive estimation of linear functionals from observations against white noise (Q784386) (← links)
- Nonparametric estimates of probability density and its derivatives (Q786475) (← links)
- Prediction under conditions of indeterminacy (Q786501) (← links)
- Bounds for packet transmission rate in a random-multiple-access system (Q786745) (← links)
- Upper bound for the delay in a multiple-random-access system with a splitting algorithm (Q786746) (← links)
- Methods of code lengthening (Q786750) (← links)
- Integral equilibrium relations of non-full-access systems with repeated calls, and their applications (Q786786) (← links)
- Packet switching in a channel without feedback (Q786787) (← links)
- Properties of the statistical estimate of the entropy of a random vector with a probability density (Q787605) (← links)
- Robust estimates of a function (Q787616) (← links)
- Investigation of monotonicity of various criteria of informativeness (Q787623) (← links)
- Unidirectional loop communications networks with packet switching (Q787670) (← links)
- Lower bound for error probability in a discrete memoryless channel with feedback (Q788694) (← links)
- Goppa codes that are better than the Varshamov-Gilbert bound (Q788695) (← links)
- Cyclicity of extended Goppa codes (Q788697) (← links)
- Random multiple access of packets to a channel with errors (Q789373) (← links)
- Some Markov queueing networks with absolute priorities (Q789826) (← links)
- Estimation of square-integrable probability density of a random variable (Q789843) (← links)
- Sequential parameter estimation and filtration of stochastic processes (Q789854) (← links)
- Multivariate asymptotically optimal stochastic approximation procedure (Q789857) (← links)
