Pages that link to "Item:Q174177"
From MaRDI portal
The following pages link to Problems of Information Transmission (Q174177):
Displaying 50 items.
- Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes (Q259876) (← links)
- Decoding of repeated-root cyclic codes up to new bounds on their minimum distance (Q259877) (← links)
- Reconstruction of eigenfunctions of a \(q\)-ary \(n\)-dimensional hypercube (Q259879) (← links)
- Strong divergence for system approximations (Q259881) (← links)
- Algorithmic aspects of decomposition and equivalence of finite-valued transducers (Q259883) (← links)
- The \(MMAP/M/R/0\) queueing system with reservation of servers operating in a random environment (Q259885) (← links)
- A mathematical method for packet loss ratio estimation for a multipath route in the presence of correlated errors (Q259889) (← links)
- On multipartite superactivation of quantum channel capacities (Q259891) (← links)
- Information-geometric equivalence of transportation polytopes (Q259895) (← links)
- Almost disjunctive list-decoding codes (Q259899) (← links)
- On error correction with errors in both the channel and syndrome (Q259902) (← links)
- On separability of the classes of homogeneous and transitive perfect binary codes (Q259904) (← links)
- On limit distributions of the time of first passage over a high level (Q259905) (← links)
- Independence numbers and chromatic numbers of some distance graphs (Q259909) (← links)
- One-armed bandit problem for parallel data processing systems (Q259910) (← links)
- Coupling of probability distributions and an extremal problem for the divergence (Q259911) (← links)
- On the source-channel separation theorem for infinite source alphabets (Q259916) (← links)
- On the BSC reliability function: expanding the region where it is known exactly (Q327296) (← links)
- Nonexistence of binary orthogonal arrays via their distance distributions (Q327301) (← links)
- Estimation of matrices with row sparsity (Q327303) (← links)
- On regular realizability problems for context-free languages (Q327306) (← links)
- The Laguerre-and-sums-of-powers algorithm for the efficient and reliable approximation of all polynomial roots (Q327308) (← links)
- A new estimate for the number of edges in induced subgraphs of a special distance graph (Q327309) (← links)
- On a method for constructing a family of approximations of zeta constants by rational fractions (Q327310) (← links)
- Interrelation of families of points of high order on the Edwards curve over a prime field (Q327313) (← links)
- Analysis of properties of \(q\)-ary Reed-Muller error-correcting codes viewed as codes for copyright protection (Q327317) (← links)
- On computation of entropy of an ellipsoid in a Hamming space (Q361691) (← links)
- On classical capacities of infinite-dimensional quantum channels (Q361692) (← links)
- Local distributions and reconstruction of hypercube eigenfunctions (Q361693) (← links)
- Rank subcodes in multicomponent network coding (Q361696) (← links)
- Non-crossing matchings (Q361698) (← links)
- Help desk center operating model as a two-phase queueing system (Q361699) (← links)
- Secrecy results for compound wiretap channels (Q361702) (← links)
- Conditions for coincidence of the classical capacity and entanglement-assisted capacity of a quantum channel (Q375948) (← links)
- Steiner triple systems \(S(2^m-1,3,2)\) of rank \(2^m-m+1\) over \(\mathbb F_2\) (Q375950) (← links)
- On frequency estimation for a periodic ergodic diffusion process (Q375951) (← links)
- Sequential estimation of a threshold crossing time for a Gaussian random walk through correlated observations (Q375953) (← links)
- Toom's partial order is transitive (Q375954) (← links)
- Finding one of \(D\) defective elements in some group testing models (Q375957) (← links)
- Proof of one inequality in identification theory (Q375958) (← links)
- Geometric relationship between parallel hyperplanes, quadrics, and vertices of a hypercube (Q375961) (← links)
- Reconstruction of cyclic words from their fragments (Q375962) (← links)
- Codes for MIMO transmission based on orthogonal sequences (Q375964) (← links)
- Bounds on the minimum code distance for nonbinary codes based on bipartite graphs (Q375966) (← links)
- On regular realizability problems (Q375967) (← links)
- Properties of a folded category constructed from a category and a lattice (Q375970) (← links)
- Call center operation model as a \(MAP/PH/N/R-N\) system with impatient customers (Q375971) (← links)
- Minkowski's theorem for random lattices (Q375972) (← links)
- Information capacity of a quantum observable (Q376102) (← links)
- Boundary distortion rate in synchronized systems: geometrical meaning of entropy (Q376104) (← links)
