AAAAAA

   
Results: 1-25 | 26-49

Table of contents of journal:

Results: 1-25/49
On prefix-free and suffix-free sequences of integers
Authors: Ahlswede, R Khachatrian, LH Sarkozy, A
Citation: R. Ahlswede et al., On prefix-free and suffix-free sequences of integers, NUMBERS, INFORMATION AND COMPLEXITY, 2000, pp. 1-16
Almost arithmetic progressions
Authors: Harzheim, E
Citation: E. Harzheim, Almost arithmetic progressions, NUMBERS, INFORMATION AND COMPLEXITY, 2000, pp. 17-20
A method to estimate partial-period correlations
Authors: Tietavainen, A
Citation: A. Tietavainen, A method to estimate partial-period correlations, NUMBERS, INFORMATION AND COMPLEXITY, 2000, pp. 21-27
Splitting properties in partially ordered sets and set systems
Authors: Ahlswede, R Khachatrian, LH
Citation: R. Ahlswede et Lh. Khachatrian, Splitting properties in partially ordered sets and set systems, NUMBERS, INFORMATION AND COMPLEXITY, 2000, pp. 29-44
Old and new results for the weighted T-intersection problem via AK-methods
Authors: Bey, C Engel, K
Citation: C. Bey et K. Engel, Old and new results for the weighted T-intersection problem via AK-methods, NUMBERS, INFORMATION AND COMPLEXITY, 2000, pp. 45-74
Some new results on Macaulay posets
Authors: Bezrukov, SL Leck, U
Citation: Sl. Bezrukov et U. Leck, Some new results on Macaulay posets, NUMBERS, INFORMATION AND COMPLEXITY, 2000, pp. 75-94
Minimizing the absolute upper shadow
Authors: Bollobas, B Leader, I
Citation: B. Bollobas et I. Leader, Minimizing the absolute upper shadow, NUMBERS, INFORMATION AND COMPLEXITY, 2000, pp. 95-100
Convex bounds for the 0,1 co-ordinate deletions function
Authors: Daykin, DE
Citation: De. Daykin, Convex bounds for the 0,1 co-ordinate deletions function, NUMBERS, INFORMATION AND COMPLEXITY, 2000, pp. 101-104
The extreme points of the probabilistic capacities cone problem
Authors: Daykin, DE
Citation: De. Daykin, The extreme points of the probabilistic capacities cone problem, NUMBERS, INFORMATION AND COMPLEXITY, 2000, pp. 105-107
On shifts of cascades
Authors: Daykin, DE
Citation: De. Daykin, On shifts of cascades, NUMBERS, INFORMATION AND COMPLEXITY, 2000, pp. 109-116
Erdos-Ko-Rado theorems of higher order
Authors: Erdos, PL Szekely, LA
Citation: Pl. Erdos et La. Szekely, Erdos-Ko-Rado theorems of higher order, NUMBERS, INFORMATION AND COMPLEXITY, 2000, pp. 117-124
On the Prague dimension of Kneser graphs
Authors: Furedi, Z
Citation: Z. Furedi, On the Prague dimension of Kneser graphs, NUMBERS, INFORMATION AND COMPLEXITY, 2000, pp. 125-128
The cycle method and its limits
Authors: Katona, GOH
Citation: Goh. Katona, The cycle method and its limits, NUMBERS, INFORMATION AND COMPLEXITY, 2000, pp. 129-141
Extremal problems on Delta-systems
Authors: Kostochka, AV
Citation: Av. Kostochka, Extremal problems on Delta-systems, NUMBERS, INFORMATION AND COMPLEXITY, 2000, pp. 143-150
The AVC with noiseless feedback and maximal error probability: A capacity formula with a trichotomy
Authors: Ahlswede, R Cai, N
Citation: R. Ahlswede et N. Cai, The AVC with noiseless feedback and maximal error probability: A capacity formula with a trichotomy, NUMBERS, INFORMATION AND COMPLEXITY, 2000, pp. 151-176
Calculation of the asymptotically optimal capacity of a T-user M-frequencynoiseless multiple-access channel
Authors: Bassalygo, L Pinsker, M
Citation: L. Bassalygo et M. Pinsker, Calculation of the asymptotically optimal capacity of a T-user M-frequencynoiseless multiple-access channel, NUMBERS, INFORMATION AND COMPLEXITY, 2000, pp. 177-180
A survey of coding methods for the adder channel
Authors: Khachatrian, GH
Citation: Gh. Khachatrian, A survey of coding methods for the adder channel, NUMBERS, INFORMATION AND COMPLEXITY, 2000, pp. 181-196
Communication network with self-similar traffic
Authors: Tsybakov, B
Citation: B. Tsybakov, Communication network with self-similar traffic, NUMBERS, INFORMATION AND COMPLEXITY, 2000, pp. 197-219
Error probabilities for identification coding and least length single sequence hopping
Authors: van der Meulen, EC Csibi, S
Citation: Ec. Van Der Meulen et S. Csibi, Error probabilities for identification coding and least length single sequence hopping, NUMBERS, INFORMATION AND COMPLEXITY, 2000, pp. 221-238
A new upper bound on codes decodable into size-2 lists
Authors: Ashikhmin, A Barg, A Litsyn, S
Citation: A. Ashikhmin et al., A new upper bound on codes decodable into size-2 lists, NUMBERS, INFORMATION AND COMPLEXITY, 2000, pp. 239-244
Constructions of optimal linear codes
Authors: Dodunekov, S Simonis, J
Citation: S. Dodunekov et J. Simonis, Constructions of optimal linear codes, NUMBERS, INFORMATION AND COMPLEXITY, 2000, pp. 245-263
New applications and results of superimposed code theory arising from the potentialities of molecular biology
Authors: D'yachkov, AG Macula, AJ Rykov, VV
Citation: Ag. D'Yachkov et al., New applications and results of superimposed code theory arising from the potentialities of molecular biology, NUMBERS, INFORMATION AND COMPLEXITY, 2000, pp. 265-282
Rudified convolutional encoders
Authors: Johannesson, R
Citation: R. Johannesson, Rudified convolutional encoders, NUMBERS, INFORMATION AND COMPLEXITY, 2000, pp. 283-293
On check digit systems using anti-symmetric mappings
Authors: Schulz, RH
Citation: Rh. Schulz, On check digit systems using anti-symmetric mappings, NUMBERS, INFORMATION AND COMPLEXITY, 2000, pp. 295-310
Switchings and perfect codes
Authors: Solov'eva, FI
Citation: Fi. Solov'Eva, Switchings and perfect codes, NUMBERS, INFORMATION AND COMPLEXITY, 2000, pp. 311-324
Risultati: 1-25 | 26-49