Digitale Bibliotheek
Sluiten Bladeren door artikelen uit een tijdschrift
     Tijdschrift beschrijving
       Alle jaargangen van het bijbehorende tijdschrift
         Alle afleveringen van het bijbehorende jaargang
                                       Alle artikelen van de bijbehorende aflevering
 
                             208 gevonden resultaten
nr titel auteur tijdschrift jaar jaarg. afl. pagina('s) type
1 Activity maxima in random networks in the heavy tail case Lebedev, A. V.
2008
2 p. 156-160
artikel
2 Adaptive χ2 Test for Discriminating between Close Hypotheses with a Large Number of Classes and Its Application to Some Cryptography Problems B. Ya. Ryabko
2003
2 p. 207-215
9 p.
artikel
3 Adaptive χ2 Test for Discriminating between Close Hypotheses with a Large Number of Classes and Its Application to Some Cryptography Problems Ryabko, B. Ya.
2003
2 p. 207-215
artikel
4 A linear algebraic approach to multisequence shift-register synthesis Sidorenko, V. R.
2011
2 p. 149-165
artikel
5 Almost cover-free codes Polyansky, N. A.
2016
2 p. 142-155
artikel
6 Almost disjunctive list-decoding codes D’yachkov, A. G.
2015
2 p. 110-131
artikel
7 A method for computation of the discrete Fourier transform over a finite field Fedorenko, S. V.
2006
2 p. 139-151
artikel
8 A method for proving nonexistence of spherical designs of odd strength and odd cardinality Boumova, S.
2009
2 p. 110-123
artikel
9 Analysis of an open non-Markovian GI — (GI | ∞)K queueing network with high-rate renewal arrival process Nazarov, A. A.
2013
2 p. 167-178
artikel
10 A new class of nonlinear sensary codes Stepanov, S. A.
2006
2 p. 114-122
artikel
11 An Optimization Problem Related to the Computation of the Epsilon-entropy of an Ellipsoid in a Hamming Space Dumer, I. I.
2002
2 p. 99-112
artikel
12 Asymptotically optimal perfect steganographic systems Ryabko, B. Ya.
2009
2 p. 184-190
artikel
13 Asymptotic bounds for the rate of colored superimposed codes Lebedev, V. S.
2008
2 p. 112-118
artikel
14 Asymptotic estimation of the fraction of errors correctable by q-ary LDPC codes Frolov, A. A.
2010
2 p. 142-159
artikel
15 Binary extended perfect codes of length 16 and rank 14 Zinoviev, V. A.
2006
2 p. 123-138
artikel
16 Boolean Functions with Improper Parameters V. V. Tarasov
2003
2 p. 227-230
4 p.
artikel
17 Boolean Functions with Improper Parameters Tarasov, V. V.
2003
2 p. 227-230
artikel
18 Bounds on Borsuk Numbers in Distance Graphs of a Special Type Berdnikov, A. V.

2 p. 136-142
artikel
19 Claude Elwood Shannon 2001
2 p. 87-90
4 p.
artikel
20 Claude Elwood Shannon 2001
2 p. 87-90
artikel
21 Clique Numbers of Random Subgraphs of Some Distance Graphs Gusev, A. S.
2018
2 p. 165-175
artikel
22 Codes Derived from Binary Goppa Codes P. Loidreau
2001
2 p. 91-99
9 p.
artikel
23 Codes Derived from Binary Goppa Codes Loidreau, P.
2001
2 p. 91-99
artikel
24 Codes for Copyright Protection: The Case of Two Pirates Kabatiansky, G. A.
2005
2 p. 182-186
artikel
25 Codes in the Vandermonde F-Metric and Their Application E. M. Gabidulin
2003
2 p. 159-169
11 p.
artikel
26 Codes in the Vandermonde F-Metric and Their Application Gabidulin, E. M.
2003
2 p. 159-169
artikel
27 Code spectrum and the reliability function: Gaussian channel Burnashev, M. V.
2007
2 p. 69-88
artikel
28 Coding in a Z-Channel in Case of Many Errors Lebedev, V. S.

2 p. 129-135
artikel
29 Coding with noiseless feedback Lebedev, V. S.
2016
2 p. 103-113
artikel
30 Comparison of Contraction Coefficients for f-Divergences Makur, A.

2 p. 103-156
artikel
31 Compositional Restricted Multiple Access Channel Egorova, E. E.
2018
2 p. 116-123
artikel
32 Concentration Theorems for Entropy and Free Energy V’yugin, V. V.
2005
2 p. 134-149
artikel
33 Conditions for coincidence of the classical capacity and entanglement-assisted capacity of a quantum channel Shirokov, M. E.
2012
2 p. 85-101
artikel
34 Constructions and Invariants of Optimal Codes in the Lee Metric Mogilnykh, I. Yu.

2 p. 71-85
artikel
35 Counting the Number of Perfect Matchings, and Generalized Decision Trees Vyalyi, M. N.

2 p. 143-160
artikel
36 Coupling of probability distributions and an extremal problem for the divergence Prelov, V. V.
2015
2 p. 192-199
artikel
37 Covering Codes for the Fixed Length Levenshtein Metric Vorobyev, I. V.

2 p. 86-98
artikel
38 Criterion of Infinite Topological Entropy for Multidimensional Cellular Automata E. L. Lakshtanov
2004
2 p. 165-167
3 p.
artikel
39 Criterion of Infinite Topological Entropy for Multidimensional Cellular Automata Lakshtanov, E. L.
2004
2 p. 165-167
artikel
40 Critical states of strongly interacting many-particle systems on a circle Malyshev, V. A.
2011
2 p. 190-200
artikel
41 Decoding of low-density codes with parity-check matrices composed of permutation matrices in an erasure channel Zigangirov, D. K.
2006
2 p. 106-113
artikel
42 Detecting Cycles of Length 8 in the Tanner Graph of a QC-LDPC Code Based on Protograph Analysis Kharin, A. V.

2 p. 173-184
artikel
43 Determinization of ordinal automata Muchnik, An. A.
2013
2 p. 149-162
artikel
44 DNA codes for additive stem similarity D’yachkov, A. G.
2009
2 p. 124-144
artikel
45 Doubly randomized protocols for a random multiple access channel with “success–nonsuccess” feedback Foss, S. G.
2016
2 p. 156-165
artikel
46 Entropy in Thermodynamics and in Information Theory Zorich, V. A.

2 p. 103-110
artikel
47 Entropy of a stationary process and entropy of a shift transformation in its sample space Gurevich, B. M.
2017
2 p. 103-113
artikel
48 Equidistributed sequences over finite fields produced by one class of linear recurring sequences over residue rings Kamlovskii, O. V.
2014
2 p. 171-185
artikel
49 Ergodicity of Band Graph Markov Chains and Their Application to Problems of the Analysis of Existence of a Stationary Regime in a Dynamic Random Multiple Access Communication Network A. A. Nazarov
2001
2 p. 165-171
7 p.
artikel
50 Ergodicity of Band Graph Markov Chains and Their Application to Problems of the Analysis of Existence of a Stationary Regime in a Dynamic Random Multiple Access Communication Network Nazarov, A. A.
2001
2 p. 165-171
artikel
51 Erratum to: “Bounds on the rate of disjunctive codes” D’yachkov, A. G.
2016
2 p. 200
artikel
52 Error exponents for Nakagami-m fading channels Xue, J.
2014
2 p. 144-170
artikel
53 Estimation of Performance of the Hopfield Randomized Memory B. V. Kryzhanovskii
2001
2 p. 155-164
10 p.
artikel
54 Estimation of Performance of the Hopfield Randomized Memory Kryzhanovskii, B. V.
2001
2 p. 155-164
artikel
55 Exact asymptotics of small deviations for a stationary Ornstein-Uhlenbeck process and some Gaussian diffusion processes in the Lp-norm, 2 ≤ p ≤ ∞ Fatalov, V. R.
2008
2 p. 138-155
artikel
56 Exact formulas for computation of reception characteristics of a signal with unknown appearance and disappearance times Trifonov, A. P.
2009
2 p. 158-167
artikel
57 Existence of Sequences Satisfying Bilinear Type Recurrence Relations Illarionov, A. A.

2 p. 163-180
artikel
58 Fast discrete Fourier transform on local fields of positive characteristic Lukomskii, S. F.
2017
2 p. 155-163
artikel
59 Fast Jackson Networks with Dynamic Routing Yu. M. Suhov
2002
2 p. 136-153
18 p.
artikel
60 Fast Jackson Networks with Dynamic Routing Suhov, Yu. M.
2002
2 p. 136-153
artikel
61 Fast protocols for leader election and spanning tree construction in a distributed network Vyalyi, M. N.
2017
2 p. 183-201
artikel
62 Feasibility of Data Transmission under Attack: From Isolated Toughness Variant Perspective Gao, W.

2 p. 146-162
artikel
63 Finding one of D defective elements in some group testing models Ahlswede, R.
2012
2 p. 173-181
artikel
64 Finiteness in the Beggar-My-Neighbor card game Lakshtanov, E. L.
2013
2 p. 163-166
artikel
65 Flow Control as a Stochastic Optimal Control Problem with Incomplete Information Miller, B. M.
2005
2 p. 150-170
artikel
66 Frank Signal and Its Generalizations V. N. Malozemov
2001
2 p. 100-107
8 p.
artikel
67 Frank Signal and Its Generalizations Malozemov, V. N.
2001
2 p. 100-107
artikel
68 Fridrich Izrailevich Karpelevich. In Memoriam 2001
2 p. 185-186
2 p.
artikel
69 Fridrich Izrailevich Karpelevich. In Memoriam 2001
2 p. 185-186
artikel
70 Generalization of a Pinsker problem Prelov, V. V.
2011
2 p. 98-116
artikel
71 Generalized error-locating codes with component codes over the same alphabet Zhilin, I. V.
2017
2 p. 114-135
artikel
72 Generalized Preparata codes and 2-resolvable Steiner quadruple systems Zinoviev, V. A.
2016
2 p. 114-133
artikel
73 Geometric Interpretation of Entropy for Dyck Systems Dvorkin, G. D.

2 p. 137-143
artikel
74 Geometric Interpretation of the Entropy of Sofic Systems Dvorkin, G. D.

2 p. 115-127
artikel
75 Geometric relationship between parallel hyperplanes, quadrics, and vertices of a hypercube Gorbunov, K. Yu.
2012
2 p. 185-192
artikel
76 Geometry of Translations on a Boolean Cube Vyalyi, M. N.
2019
2 p. 152-173
artikel
77 Improved Frankl–Rödl Theorem and Some of Its Geometric Consequences Sagdeev, A. A.
2018
2 p. 139-164
artikel
78 Independence numbers and chromatic numbers of some distance graphs Bobu, A. V.
2015
2 p. 165-176
artikel
79 Information-geometric equivalence of transportation polytopes Kovačević, M.
2015
2 p. 103-109
artikel
80 Information security in a random network coding network Gabidulin, E. M.
2013
2 p. 179-191
artikel
81 Information-Theoretic Approach to Estimating the Capacity of Distributed Memory Systems Ryabko, B. Ya.
2018
2 p. 191-198
artikel
82 Interrelation of the Cyclic and Weight Structure of Codes over GF(q) and Proportionality Classes Mullayeva, I. I.
2005
2 p. 130-133
artikel
83 Invariant Measures for Contact Processes with State-Dependent Birth and Death Rates Zhizhina, E. A.

2 p. 128-145
artikel
84 Joint Matrix Universal Coding of Sequences of Independent Symbols Yu. M. Shtarkov
2002
2 p. 154-165
12 p.
artikel
85 Joint Matrix Universal Coding of Sequences of Independent Symbols Shtarkov, Yu. M.
2002
2 p. 154-165
artikel
86 Key masking using biometry Chmora, A. L.
2011
2 p. 201-215
artikel
87 Large Deviation Principle for Markov Chains in Continuous Time A. de La Fortelle
2001
2 p. 120-139
20 p.
artikel
88 Large Deviation Principle for Markov Chains in Continuous Time de La Fortelle, A.
2001
2 p. 120-139
artikel
89 Large Deviation Principle for Terminating Multidimensional Compound Renewal Processes with Application to Polymer Pinning Models Logachov, A. V.

2 p. 144-159
artikel
90 Large deviations for distributions of sums of random variables: Markov chain method Fatalov, V. R.
2010
2 p. 160-183
artikel
91 Limit Theorems for the Maximal Path Weight in a Directed Graph on the Line with Random Weights of Edges Konstantopoulos, T.

2 p. 161-177
artikel
92 Local and interweight spectra of completely regular codes and of perfect colorings Vasil’eva, A. Yu.
2009
2 p. 151-157
artikel
93 Low-complexity error correction of Hamming-code-based LDPC codes Zyablov, V. A.
2009
2 p. 95-109
artikel
94 Maximum Remaining Service Time in Infinite-Server Queues Lebedev, A. V.
2018
2 p. 176-190
artikel
95 MDS codes in Doob graphs Bespalov, E. A.
2017
2 p. 136-154
artikel
96 Minimax Theorems for Finite Blocklength Lossy Joint Source-Channel Coding over an Arbitrarily Varying Channel Vora, A. S.

2 p. 99-128
artikel
97 Multitrial decoding of concatenated codes using fixed thresholds Senger, C.
2010
2 p. 127-141
artikel
98 Near-Ideal Predictors and Causal Filters for Discrete-Time Signals Dokuchaev, N. G.

2 p. 99-114
artikel
99 New Product Theorems for Queueing Networks Tsitsiashvili, G. Sh.
2005
2 p. 171-181
artikel
100 New Quasi-cyclic Degenerate Linear Codes over GF(8) R. Daskalov
2003
2 p. 184-190
7 p.
artikel
101 New Quasi-cyclic Degenerate Linear Codes over GF(8) Daskalov, R.
2003
2 p. 184-190
artikel
102 New Upper Bounds in the Hypothesis Testing Problem with Information Constraints Burnashev, M. V.

2 p. 157-172
artikel
103 Nonbinary Error-Correcting Codes with One-Time Error-Free Feedback Bassalygo, L. A.
2005
2 p. 125-129
artikel
104 Nonparametric hypothesis testing with small type I or type II error probabilities Ermakov, M. S.
2008
2 p. 119-137
artikel
105 Nonrobustness Property of the Individual Ergodic Theorem V. V. V'yugin
2001
2 p. 108-119
12 p.
artikel
106 Nonrobustness Property of the Individual Ergodic Theorem V'yugin, V. V.
2001
2 p. 108-119
artikel
107 Non-split Toric Codes Koshelev, D. I.
2019
2 p. 124-144
artikel
108 Occurrence indices of elements in linear recurrence sequences over primary residue rings Bylkov, D. N.
2008
2 p. 161-168
artikel
109 On Adaptive Estimation of Linear Functionals from Observations against White Noise Golubev, G. K.

2 p. 185-200
artikel
110 On a Geometric Generalization of Entropy V. A. Leus
2003
2 p. 170-177
8 p.
artikel
111 On a Geometric Generalization of Entropy Leus, V. A.
2003
2 p. 170-177
artikel
112 On a model and capacity of MIMO channels Tsybakov, B. S.
2011
2 p. 89-97
artikel
113 On Application of the Modulus Metric to Solving the Minimum Euclidean Distance Decoding Problem Davydov, V. A.
2019
2 p. 145-151
artikel
114 On approximation of infinite-dimensional quantum channels Shirokov, M. E.
2008
2 p. 73-90
artikel
115 On a Sufficient Condition for Additivity in Quantum Information Theory Datta, N.
2005
2 p. 76-90
artikel
116 On binary self-complementary [120, 9, 56] codes having an automorphism of order 3 and associated SDP designs Bouyukliev, I.
2007
2 p. 89-96
artikel
117 On complete one-way functions Kozhevnikov, A. A.
2009
2 p. 168-183
artikel
118 On Components of Preparata Codes N. N. Tokareva
2004
2 p. 159-164
6 p.
artikel
119 On Components of Preparata Codes Tokareva, N. N.
2004
2 p. 159-164
artikel
120 On computation of information via variation and inequalities for the entropy function Prelov, V. V.
2010
2 p. 122-126
artikel
121 On convergence properties of Shannon entropy Piera, F. J.
2009
2 p. 75-94
artikel
122 On Discrimination between Classes of Distribution Tails Rodionov, I. V.
2018
2 p. 124-138
artikel
123 One-armed bandit problem for parallel data processing systems Kolnogorov, A. V.
2015
2 p. 177-191
artikel
124 On ergodic algorithms in random multiple access systems with “success-failure“ feedback Turlikov, A. M.
2010
2 p. 184-200
artikel
125 On error correction with errors in both the channel and syndrome Vlǎduţ, S. G.
2015
2 p. 132-138
artikel
126 On Estimation of Information via Variation Pinsker, M. S.
2005
2 p. 71-75
artikel
127 On frequency estimation for a periodic ergodic diffusion process Höpfner, R.
2012
2 p. 127-141
artikel
128 On interpolation of smooth processes and functions Golubev, G. K.
2013
2 p. 127-148
artikel
129 On interval modal logic with “after” relation Chizhov, A. S.
2016
2 p. 166-177
artikel
130 On limit distributions of the time of first passage over a high level Burnashev, M. V.
2015
2 p. 148-164
artikel
131 On multipartite superactivation of quantum channel capacities Shirokov, M. E.
2015
2 p. 87-102
artikel
132 On new completely regular q-ary codes Zinoviev, V. A.
2007
2 p. 97-112
artikel
133 On New Problems in Asymmetric Cryptography Based on Error-Resistant Coding Zyablov, V. V.

2 p. 184-201
artikel
134 On one method for fast approximation of zeta constants by rational fractions Karatsuba, E. A.
2014
2 p. 186-202
artikel
135 On Optimal Linear Detectors, Asymptotic Efficiency, and Some CDMA Problems M. V. Burnashev
2003
2 p. 191-206
16 p.
artikel
136 On Optimal Linear Detectors, Asymptotic Efficiency, and Some CDMA Problems Burnashev, M. V.
2003
2 p. 191-206
artikel
137 On Optimal SignalFilter Pairs V. N. Malozemov
2003
2 p. 216-226
11 p.
artikel
138 On Optimal Signal–Filter Pairs Malozemov, V. N.
2003
2 p. 216-226
artikel
139 On (Partial) unit memory codes based on Gabidulin codes Wachter, A.
2011
2 p. 117-129
artikel
140 On reconstruction of information on an input word in a Medvedev permutation automaton given initial and final states Babash, A. V.
2007
2 p. 132-142
artikel
141 On separability of the classes of homogeneous and transitive perfect binary codes Mogilnykh, I. Yu.
2015
2 p. 139-147
artikel
142 On the Asymptotic Power of the Likelihood Ratio Criterion for Testing the Hypothesis of Nonstationarity of an Autoregressive Series with Cauchy Innovations O. V. Gaas
2004
2 p. 175-185
11 p.
artikel
143 On the Asymptotic Power of the Likelihood Ratio Criterion for Testing the Hypothesis of Nonstationarity of an Autoregressive Series with Cauchy Innovations Gaas, O. V.
2004
2 p. 175-185
artikel
144 On the capacity of a multiple-access vector adder channel Frolov, A. A.
2014
2 p. 133-143
artikel
145 On the Epsilon-entropy of One Class of Ellipsoids in a Hamming Space V. V. Prelov
2002
2 p. 113-125
13 p.
artikel
146 On the Epsilon-entropy of One Class of Ellipsoids in a Hamming Space Prelov, V. V.
2002
2 p. 113-125
artikel
147 On the Maximum Number of Non-Confusable Strings Evolving under Short Tandem Duplications Kovačević, M.

2 p. 111-121
artikel
148 On the optimum choice of a threshold in a frequency hopping OFDMA system Zyablov, V. V.
2008
2 p. 91-98
artikel
149 On the reliability function for a BSC with noisy feedback Burnashev, M. V.
2010
2 p. 103-121
artikel
150 On the Smallest Size of an Almost Complete Subset of a Conic in PG(2, q) and Extendability of Reed–Solomon Codes Bartoli, D.
2018
2 p. 101-115
artikel
151 On the source-channel separation theorem for infinite source alphabets Aghajan, A.
2015
2 p. 200-204
artikel
152 On the Structure of Symmetry Groups of Vasil’ev Codes Avgustinovich, S. V.
2005
2 p. 105-112
artikel
153 On the 100th Anniversary since the Birth of Andrei Nikolaevich Kolmogorov 2002
2 p. 166-167
artikel
154 On universal algorithms for adaptive forecasting V’yugin, V. V.
2011
2 p. 166-189
artikel
155 On weak isometries of Preparata codes Mogil’nykh, I. Yu.
2009
2 p. 145-150
artikel
156 On Weight Distributions of Shifts of Goethals-like Codes V. A. Zinoviev
2004
2 p. 118-134
17 p.
artikel
157 On Weight Distributions of Shifts of Goethals-like Codes Zinoviev, V. A.
2004
2 p. 118-134
artikel
158 Playout in slotted CBR networks: Single and multiple nodes Privalov, A. Yu.
2007
2 p. 143-166
artikel
159 Poissonian Two-Armed Bandit: A New Approach Kolnogorov, A. V.

2 p. 160-183
artikel
160 Probability distribution in varying-structure queueing networks Tsitsiashvili, G. Sh.
2006
2 p. 158-165
artikel
161 Probability-Theoretic and Statistical Analysis of Dictionary Texts S. A. Nekrasov
2004
2 p. 168-174
7 p.
artikel
162 Probability-Theoretic and Statistical Analysis of Dictionary Texts Nekrasov, S. A.
2004
2 p. 168-174
artikel
163 Proof of one inequality in identification theory Blinovsky, V. M.
2012
2 p. 182-184
artikel
164 Quaternary Codes and Biphase Sequences from \mathbb{Z}_8-Codes D. V. Zinoviev
2004
2 p. 147-158
12 p.
artikel
165 Quaternary Codes and Biphase Sequences from $$\mathbb{Z}_8 $$-Codes Zinoviev, D. V.
2004
2 p. 147-158
artikel
166 Queueing networks with mobile servers: The mean-field approach Baccelli, F.
2016
2 p. 178-199
artikel
167 Random multiple access in a vector disjunctive channel Pustovalov, E. V.
2013
2 p. 111-126
artikel
168 Random Young Diagram, Variational Method, and Related Problems Blinovsky, V. M.
2002
2 p. 126-135
artikel
169 Reconstruction of cyclic words from their fragments Leont’ev, V. K.
2012
2 p. 193-197
artikel
170 Reliable Communication under the Influence of a State-Constrained Jammer: An Information-Theoretic Perspective on Receive Diversity Arendt, C.
2019
2 p. 101-123
artikel
171 Remark on Construction of Perfect q-ary Codes by Sequential Switchings of \Tilde{\alpha}-Components Published in Probl. Peredachi Inf., 2004, no. 1 2004
2 p. 186-186
1 p.
artikel
172 Remark on “Construction of Perfect q-ary Codes by Sequential Switchings of $${\tilde \alpha }$$-Components” Published in Probl. Peredachi Inf., 2004, no. 1 2004
2 p. 186
artikel
173 Remark on “On DNA Codes” published in Probl. Peredachi Inf., 2005, no. 4 D’yachkov, A. G.
2006
2 p. 166
artikel
174 Remark on “On Error-free Filtering of Finite-State Singular Processes under Dependent Distortions” published in Probl. Peredachi Inf., 2007, no. 4 Prelov, V. V.
2009
2 p. 191
artikel
175 Remark on “Steiner triple systems S(2m − 1, 3, 2) of rank 2m −m+ 1 over $$\mathbb{F}_2$$” published in Probl. Peredachi Inf., 2012, no. 2 Zinoviev, V. A.
2013
2 p. 192-195
artikel
176 Remark on the additivity conjecture for a quantum depolarizing channel Amosov, G. G.
2006
2 p. 69-76
artikel
177 Remark on the reliability function of a symmetric channel under list decoding Blinovsky, V. M.
2011
2 p. 85-88
artikel
178 Representation of ℤ4-Linear Preparata Codes Using Vector Fields Tokareva, N. N.
2005
2 p. 113-124
artikel
179 Self-checking circuits and decoding algorithms for binary hamming and BCH codes and Reed-Solomon codes over GF(2m) Boyarinov, I. M.
2008
2 p. 99-111
artikel
180 Separable Collusion-Secure Multimedia Codes Egorova, E. E.

2 p. 178-198
artikel
181 Sequential estimation of a threshold crossing time for a Gaussian random walk through correlated observations Burnashev, M. V.
2012
2 p. 142-153
artikel
182 Some high-rate linear codes over GF(5) and GF(7) Daskalov, R.
2007
2 p. 124-131
artikel
183 Some new results on Hadamard modulo prime matrices Borissov, Y. L.
2016
2 p. 134-141
artikel
184 Some properties of Rényi entropy over countably infinite alphabets Kovačević, M.
2013
2 p. 99-110
artikel
185 Spaceability for sets of bandlimited input functions and stable linear time-invariant systems with finite time blowup behavior Boche, H.
2017
2 p. 164-182
artikel
186 Spectral approach to linear programming bounds on codes Barg, A. M.
2006
2 p. 77-89
artikel
187 Steiner systems S(v, k, k − 1): Components and rank Zinoviev, V. A.
2011
2 p. 130-148
artikel
188 Steiner triple systems S(2m − 1, 3, 2) of rank 2m − m+ 1 over $$\mathbb{F}_2$$ Zinoviev, V. A.
2012
2 p. 102-126
artikel
189 Strong converse for the classical capacity of the pure-loss bosonic channel Wilde, M. M.
2014
2 p. 117-132
artikel
190 Symmetric Rank Codes E. M. Gabidulin
2004
2 p. 103-117
15 p.
artikel
191 Symmetric Rank Codes Gabidulin, E. M.
2004
2 p. 103-117
artikel
192 The Geometry of Big Queues Puhalskii, A. A.
2019
2 p. 174-200
artikel
193 The Nonexistence of Ternary 284, 6, 188 Codes R. Daskalov
2004
2 p. 135-146
12 p.
artikel
194 The Nonexistence of Ternary [284, 6, 188] Codes Daskalov, R.
2004
2 p. 135-146
artikel
195 Theoretical and Experimental Upper and Lower Bounds on the Efficiency of Convolutional Codes in a Binary Symmetric Channel Kurmukova, A. A.

2 p. 122-136
artikel
196 Toom’s partial order is transitive Raskin, M. A.
2012
2 p. 154-172
artikel
197 To the Metrical Rigidity of Binary Codes S. V. Avgustinovich
2003
2 p. 178-183
6 p.
artikel
198 To the Metrical Rigidity of Binary Codes Avgustinovich, S. V.
2003
2 p. 178-183
artikel
199 To the problem of realizability of Boolean functions by circuits in a basis of unreliable functional elements Tarasov, V. V.
2006
2 p. 152-157
artikel
200 Two-dimensional array codes correcting rectangular burst errors Boyarinov, I. M.
2006
2 p. 90-105
artikel
201 Uniqueness of some optimal superimposed codes Hong, S.
2007
2 p. 113-123
artikel
202 Untying of Clutter-Family Supports and Its Role in the Monotone-Structure Reliability Theory V. P. Polesskii
2001
2 p. 140-154
15 p.
artikel
203 Untying of Clutter-Family Supports and Its Role in the Monotone-Structure Reliability Theory Polesskii, V. P.
2001
2 p. 140-154
artikel
204 Using Literal and Grammatical Statistics for Authorship Attribution O. V. Kukushkina
2001
2 p. 172-184
13 p.
artikel
205 Using Literal and Grammatical Statistics for Authorship Attribution Kukushkina, O. V.
2001
2 p. 172-184
artikel
206 Viktor Dmitrievich Kolesnik: In Memoriam 2008
2 p. 169-170
artikel
207 Viktor Dmitrievich Kolesnik: In Memoriam
2 p. 169-170
artikel
208 Weight Functions and Generalized Hamming Weights of Linear Codes Nogin, D. Yu.
2005
2 p. 91-104
artikel
                             208 gevonden resultaten
 
 Koninklijke Bibliotheek - Nationale Bibliotheek van Nederland