Pages that link to "Item:Q174177"
From MaRDI portal
The following pages link to Problems of Information Transmission (Q174177):
Displaying 50 items.
- An algorithm in the problem of interpolation of multidimensional time series (Q789861) (← links)
- Minimax filtration of functions in \(L_ 2\) (Q789862) (← links)
- Selection of features in pattern recognition (Q790626) (← links)
- Universal synthesis algorithm for 1/n testers (Q790789) (← links)
- Random multiple access of ''impatient'' packets (Q791498) (← links)
- Entropy characteristics and linear approximations for a homogeneous Gaussian field (Q792007) (← links)
- Capabilities of automata upon traversing a plane (Q792095) (← links)
- Constructive models of random sequences with specified statistical properties and their application (Q792293) (← links)
- Performance of q-ary coding in channels with fading when multiple- frequency signals are used (Q792949) (← links)
- Allowance for packet propagation time in random multiple access (Q792951) (← links)
- Sampling theorem for random processes and fields (Q793436) (← links)
- The theory of discrete signal processing (Q793693) (← links)
- Binary self-dual codes with automorphisms of odd order (Q794618) (← links)
- Minimum-check-density codes for correcting bytes of errors, erasures, or defects (Q794621) (← links)
- Fast decoding algorithm for first-order Reed-Muller codes (Q794623) (← links)
- Existence and uniqueness conditions for a random field describing the state of a switching network (Q794910) (← links)
- Discrete-time single-server system with requests of several types (Q794912) (← links)
- Estimation of a posteriori probability in problems of pattern recognition and prediction (Q796201) (← links)
- Efficient solution of the interpolation problem on the basis of observations of jump processes (Q796234) (← links)
- Some aspects of estimation of the bispectral density of a stationary stochastic process (Q796950) (← links)
- Lower bound for the number of states of purposeful deterministic automata (Q796993) (← links)
- Processes of self-assembly of trees with dependent connections (Q797509) (← links)
- Minimum possible block length of a linear binary code for some distances (Q798611) (← links)
- Shortening of codes (Q798612) (← links)
- Median filtering of random processes (Q799304) (← links)
- Analysis of the efficiency of some controlled search procedures (Q799648) (← links)
- Stable single-locus polyallele populations (Q800255) (← links)
- Stability of asynchronous ALOHA system (Q800287) (← links)
- Packet delay in the case of a multiple-access stack algorithm (Q800288) (← links)
- Coding in an asynchronous multiple-access channel (Q800291) (← links)
- Hadamard-type block designs and self-dual codes (Q800306) (← links)
- Sequential decoding algorithm producing the maximum-likelihood estimate for low-density Gallager codes (Q803111) (← links)
- Bounds on probability of connectedness of a random graph (Q803174) (← links)
- Hypotheses testing with incompletely known distribution function of the observations and unknown a priori probabilities of the hypotheses (Q805094) (← links)
- Spectral density estimators of a periodically correlated stochastic process (Q805120) (← links)
- Detection of a signal with unknown moments of appearance and disappearance (Q808095) (← links)
- Demodulation of discrete-frequency signals in a multipath channel (Q809052) (← links)
- Bounds on E-capacity of a channel with a random parameter (Q809054) (← links)
- On adaptive conflict resolution algorithms in a multiple access channel (Q809980) (← links)
- Universal coding for discrete memoryless sources uniform with respect to output (Q809982) (← links)
- Generalized correlation metric for decoding in a multiple access channel (Q809984) (← links)
- Weight distributions of subfield subcodes of algebraic-geometrical codes (Q809986) (← links)
- Asymptotically efficient recursive estimation of a nonparametric signal (Q911539) (← links)
- A comment on the paper of Kasami, Lin, Wei, and Yamamura, ``Coding for the binary symmetric broadcast channel with two receivers'' (Q911540) (← links)
- New optimal ensembles of nonlinear binary sequences (Q911546) (← links)
- A subclass of binary Goppa codes (Q911550) (← links)
- Decoding complexity bound for linear block codes (Q911553) (← links)
- On the existence of q-ary generalized concatenated codes with optimal error-correcting properties (Q911557) (← links)
- Concatenated codes in Euclidean space (Q911559) (← links)
- Design of high-speed checkers for Berger codes (Q911562) (← links)
