Digital Library
Close Browse articles from a journal
 
Search for with title:
ABCDEFGHIJKLMNOPQRSTUVWXYZ

     Journal description
       All volumes of the corresponding journal
         All issues of the corresponding volume
                                       All articles of the corresponding issues
 
                             77 results found
no title author magazine year volume issue page(s) type
1 Additive number theory and the ring of quantum integers Nathanson, Melvyn B.
 2005
 21 C p. 367-
1 p.
 article
2 A Fast Suffix-Sorting Algorithm Ahlswede, R.
 2005
 21 C p. 111-114
4 p.
 article
3 A Kraft–type inequality for d–delay binary search codes Ahlswede, Rudolf
 2005
 21 C p. 133-136
4 p.
 article
4 Algorithmic Motion Planning: the Randomized Approach Carpin, Stefano
 2005
 21 C p. 249-253
5 p.
 article
5 An upper bound on the rate of information transfer by Grover's oracle Arikan, Erdal
 2005
 21 C p. 231-232
2 p.
 article
6 A Simplified Method for Computing the Key Equivocation for Additive-Like Instantaneous Block Encipherers Zhang, Zhaozhi
 2005
 21 C p. 389-391
3 p.
 article
7 A Strong Converse Theorem for Quantum Multiple Access Channels Ahlswede, Rudolf
 2005
 21 C p. 137-141
5 p.
 article
8 A survey on proper codes Dodunekova, R.
 2005
 21 C p. 273-275
3 p.
 article
9 Authorship attribution of texts: a review Malyutov, M.B.
 2005
 21 C p. 353-357
5 p.
 article
10 Bridging Lossy and Lossless Compression by Motif Pattern Discovery Apostolico, Alberto
 2005
 21 C p. 219-225
7 p.
 article
11 Codes with the identifiable parent property and the multiple–access channel Ahlswede, Rudolf
 2005
 21 C p. 143-147
5 p.
 article
12 Coding for a Multiple Access OR Channel: a Survey Győri, Sándor
 2005
 21 C p. 293-296
4 p.
 article
13 Coding for the Multiple-Access Adder Channel Laczay, Bálint
 2005
 21 C p. 345-346
2 p.
 article
14 Correlation Inequalities in Function Spaces Ahlswede, Rudolf
 2005
 21 C p. 125-127
3 p.
 article
15 Editorial Note Ahlswede, Rudolf
 2005
 21 C p. 1-89
89 p.
 article
16 Estimates of E-capacity and capacity regions for Multiple-access Channel With Random Parameter Haroutunian, Mariam E.
 2005
 21 C p. 303-308
6 p.
 article
17 Estimating with randomized encoding the joint empirical distribution in a correlated source Ahlswede, Rudolf
 2005
 21 C p. 213-218
6 p.
 article
18 Filling of a given boundary by p-gons and related problems Dutour, Mathieu
 2005
 21 C p. 279-
1 p.
 article
19 General theory of information transfer Ahlswede, Rudolf
 2005
 21 C p. 181-184
4 p.
 article
20 Huge Quantum Broadcast Channels and Cryptographic Applications for Separable States Wilmink, Rainer
 2005
 21 C p. 385-
1 p.
 article
21 Huge-size codes for identification via a multiple access channel under a word length constraint Csibi, Sándor
 2005
 21 C p. 263-264
2 p.
 article
22 Identification and Prediction Bäumer, Lars
 2005
 21 C p. 237-240
4 p.
 article
23 Identification Entropy Ahlswede, Rudolf
 2005
 21 C p. 191-192
2 p.
 article
24 Identification for Sources Ahlswede, R.
 2005
 21 C p. 115-118
4 p.
 article
25 Identification via Quantum Channels in the Presence of Prior Correlation and Feedback Winter, Andreas
 2005
 21 C p. 387-
1 p.
 article
26 Information theoretic models in language evolution Ahlswede, Rudolf
 2005
 21 C p. 97-100
4 p.
 article
27 Large Convex Cones in Hypercubes Füredi, Zoltán
 2005
 21 C p. 283-284
2 p.
 article
28 Large families of pseudorandom sequences of k symbols and their complexity, Part I Ahlswede, R.
 2005
 21 C p. 203-204
2 p.
 article
29 Large families of pseudorandom sequences of k symbols and their complexity, Part II Ahlswede, R.
 2005
 21 C p. 199-201
3 p.
 article
30 Largest Graphs of Diameter 2 and Maximum Degree 6 Molodtsov, Sergey G.
 2005
 21 C p. 365-366
2 p.
 article
31 Lower Bounds for Divergence in Central Limit Theorem Harremoës, Peter
 2005
 21 C p. 309-313
5 p.
 article
32 Minimal Polynomials of the Modified de Bruijn Sequences Kyureghyan, Gohar M.
 2005
 21 C p. 333-336
4 p.
 article
33 Minimum degree conditions for H-linked graphs Kostochka, A.
 2005
 21 C p. 331-
1 p.
 article
34 Monotonicity checking Kyureghyan, M.
 2005
 21 C p. 337-342
6 p.
 article
35 Multiple Packing in Sum-type Metric Spaces Ahlswede, Rudolf
 2005
 21 C p. 129-131
3 p.
 article
36 Notes on Conditions for Successive Refinement of Information Harutyunyan, Ashot N.
 2005
 21 C p. 301-302
2 p.
 article
37 On a fast version of a pseudorandom generator Gyarmati, Katalin
 2005
 21 C p. 291-
1 p.
 article
38 On attractive and friendly sets in sequence spaces Ahlswede, Rudolf
 2005
 21 C p. 193-198
6 p.
 article
39 On diagnosability of large multiprocessor networks Ahlswede, R.
 2005
 21 C p. 101-104
4 p.
 article
40 On identification Kleinewächter, C.
 2005
 21 C p. 321-326
6 p.
 article
41 On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Source with Side Information Ahlswede, Rudolf
 2005
 21 C p. 91-95
5 p.
 article
42 On partitions of a rectangle into rectangles with restricted number of cross sections Ahlswede, R.
 2005
 21 C p. 211-212
2 p.
 article
43 On perfect binary codes Solov'eva, Faina I.
 2005
 21 C p. 371-372
2 p.
 article
44 On pseudorandom sequences and their application Rivat, Jol
 2005
 21 C p. 369-370
2 p.
 article
45 On Rank Two Channels Uhlmann, Armin
 2005
 21 C p. 377-378
2 p.
 article
46 On sequential discrimination between close Markov chains Malyutov, M.B.
 2005
 21 C p. 359-363
5 p.
 article
47 On some applications of information indices in chemical graph theory Konstantinova, Elena V.
 2005
 21 C p. 329-
1 p.
 article
48 On the correlation of binary sequences Ahlswede, R.
 2005
 21 C p. 169-171
3 p.
 article
49 On the thinnest coverings of spheres and ellipsoids with balls in Hamming and Euclidean spaces Dumer, I.
 2005
 21 C p. 277-
1 p.
 article
50 Optimal information measures for weakly chaotic dynamical systems Benci, Vieri
 2005
 21 C p. 241-242
2 p.
 article
51 Percolation on a k-ary Tree Kobayashi, Kingo
 2005
 21 C p. 327-
1 p.
 article
52 Periodicity and Repetitions in Parameterized Strings Apostolico, Alberto
 2005
 21 C p. 227-230
4 p.
 article
53 Q-ary Ulam-Rényi game with constrained lies Cicalese, Ferdinando
 2005
 21 C p. 255-261
7 p.
 article
54 Quantum information transfer from one system to another one Uhlmann, Armin
 2005
 21 C p. 379-382
4 p.
 article
55 Ratewise-optimal non-sequential search strategies under cardinality constraints on the tests Ahlswede, Rudolf
 2005
 21 C p. 209-210
2 p.
 article
56 Raum-Zeit und Quantenphysik – Ein Geburtstagsständchen für Hans-Jürgen Treder Uhlmann, Armin
 2005
 21 C p. 383-384
2 p.
 article
57 Realization of intensity modulated radiation fields using multileaf collimator Kalinowski, Thomas
 2005
 21 C p. 319-320
2 p.
 article
58 Reconstruction of a graph from 2–vicinities of its vertices Levenshtein, Vladimir
 2005
 21 C p. 347-351
5 p.
 article
59 Recursive Constructions of N-polynomials over GF (2 s ) Kyuregyan, Melsik K.
 2005
 21 C p. 343-
1 p.
 article
60 Remarks on an edge isoperimetric problem Bey, Christian
 2005
 21 C p. 243-
1 p.
 article
61 Report on models of write–efficient memories with localized errors and defects Ahlswede, R.
 2005
 21 C p. 205-207
3 p.
 article
62 Reverse–Complement Similarity Codes D'yachkov, Arkadii
 2005
 21 C p. 281-282
2 p.
 article
63 Searching with lies under error transition cost constraints Ahlswede, Rudolf
 2005
 21 C p. 173-179
7 p.
 article
64 Search with noisy and delayed response Ahlswede, R.
 2005
 21 C p. 149-154
6 p.
 article
65 Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherers Ahlswede, Rudolf
 2005
 21 C p. 167-168
2 p.
 article
66 Size of Downsets in the Pushing Order and a Problem of Berlekamp Tamm, Ulrich
 2005
 21 C p. 373-376
4 p.
 article
67 Sparse asymmetric connectors in communication networks Ahlswede, R.
 2005
 21 C p. 105-109
5 p.
 article
68 Testing of Hypothesis and Identification Ahlswede, Rudolf
 2005
 21 C p. 185-189
5 p.
 article
69 Testing sets for 1-perfect codes Avgustinovich, S.V.
 2005
 21 C p. 233-236
4 p.
 article
70 The Edge-Diametric Theorem in Hamming Spaces Bey, Christian
 2005
 21 C p. 245-248
4 p.
 article
71 The proper fiducial argument Hampel, Frank
 2005
 21 C p. 297-300
4 p.
 article
72 Threshold Group Testing Damaschke, Peter
 2005
 21 C p. 265-271
7 p.
 article
73 Transmission, identification and common randomness capacities for wire-tape channels with secure feedback from the decoder Ahlswede, R.
 2005
 21 C p. 155-159
5 p.
 article
74 T-shift synchronization codes Ahlswede, R.
 2005
 21 C p. 119-123
5 p.
 article
75 Universal Sets of Quantum Information Processing Primitives and their optimal use Gruska, Jozef
 2005
 21 C p. 285-289
5 p.
 article
76 Watermarking Identification Codes with Related Topics on Common Randomness Ahlswede, Rudolf
 2005
 21 C p. 161-165
5 p.
 article
77 Zipf's law, hyperbolic distributions and entropy loss Harremoës, Peter
 2005
 21 C p. 315-318
4 p.
 article
                             77 results found
 
 Koninklijke Bibliotheek - National Library of the Netherlands