Electronic Notes in Discrete Mathematics, Volume 21

Volume 21, August 2005

• Rudolf Ahlswede:
  Editorial Note. 1-89
  
• Rudolf Ahlswede, Ella Aloyan, Evgueni A. Haroutunian:
  On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Source with Side Information. 91-95
  
• Rudolf Ahlswede, Erdal Arikan, Lars Bäumer, Christian Deppe:
  Information theoretic models in language evolution. 97-100
  
• Rudolf Ahlswede, Harout K. Aydinian:
  On diagnosability of large multiprocessor networks. 101-104
  
• Rudolf Ahlswede, Harout K. Aydinian:
  Sparse asymmetric connectors in communication networks. 105-109
  
• Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Martin Fröhlich:
  A Fast Suffix-Sorting Algorithm. 111-114
  
• Rudolf Ahlswede, Bernhard Balkenhol, Christian Kleinewächter:
  Identification for Sources. 115-118
  
• Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Haik Mashurian, T. Partner:
  T-shift synchronization codes. 119-123
  
• Rudolf Ahlswede, Vladimir Blinovsky:
  Correlation Inequalities in Function Spaces. 125-127
  
• Rudolf Ahlswede, Vladimir Blinovsky:
  Multiple Packing in Sum-type Metric Spaces. 129-131
  
• Rudolf Ahlswede, Ning Cai:
  A Kraft-type inequality for d-delay binary search codes. 133-136
  
• Rudolf Ahlswede, Ning Cai:
  A Strong Converse Theorem for Quantum Multiple Access Channels. 137-141
  
• Rudolf Ahlswede, Ning Cai:
  Codes with the identifiable parent property and the multiple-access channel. 143-147
  
• Rudolf Ahlswede, Ning Cai:
  Search with noisy and delayed response. 149-154
  
• Rudolf Ahlswede, Ning Cai:
  Transmission, identification and common randomness capacities for wire-tape channels with secure feedback from the decoder. 155-159
  
• Rudolf Ahlswede, Ning Cai:
  Watermarking Identification Codes with Related Topics on Common Randomness. 161-165
  
• Rudolf Ahlswede, Ning Cai, Zhaozhi Zhang:
  Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherers. 167-168
  
• Rudolf Ahlswede, Julien Cassaigne, András Sárközy:
  On the correlation of binary sequences. 169-171
  
• Rudolf Ahlswede, Ferdinando Cicalese, Christian Deppe:
  Searching with lies under error transition cost constraints. 173-179
  
• Rudolf Ahlswede:
  General theory of information transfer. 181-184
  
• Rudolf Ahlswede, Evgueni A. Haroutunian:
  Testing of Hypothesis and Identification. 185-189
  
• Rudolf Ahlswede:
  Identification Entropy. 191-192
  
• Rudolf Ahlswede, Levon H. Khachatrian:
  On attractive and friendly sets in sequence spaces. 193-198
  
• Rudolf Ahlswede, Christian Mauduit, András Sárközy:
  Large families of pseudorandom sequences of k symbols and their complexity, Part II. 199-201
  
• Rudolf Ahlswede, Christian Mauduit, András Sárközy:
  Large families of pseudorandom sequences of k symbols and their complexity, Part I. 203-204
  
• Rudolf Ahlswede, Mark S. Pinsker:
  Report on models of write-efficient memories with localized errors and defects. 205-207
  
• Rudolf Ahlswede:
  Ratewise-optimal non-sequential search strategies under cardinality constraints on the tests. 209-210
  
• Rudolf Ahlswede, Alexander Yudin:
  On partitions of a rectangle into rectangles with restricted number of cross sections. 211-212
  
• Rudolf Ahlswede, Zhen Zhang:
  Estimating with randomized encoding the joint empirical distribution in a correlated source. 213-218
  
• Alberto Apostolico, Matteo Comin, Laxmi Parida:
  Bridging Lossy and Lossless Compression by Motif Pattern Discovery. 219-225
  
• Alberto Apostolico, Raffaele Giancarlo:
  Periodicity and Repetitions in Parameterized Strings. 227-230
  
• Erdal Arikan:
  An upper bound on the rate of information transfer by Grover's oracle. 231-232
  
• Sergey V. Avgustinovich, Anastasia Yu. Vasil'eva:
  Testing sets for 1-perfect codes. 233-236
  
• Lars Bäumer:
  Identification and Prediction. 237-240
  
• Vieri Benci, Stefano Galatolo:
  Optimal information measures for weakly chaotic dynamical systems. 241-242
  
• Christian Bey:
  Remarks on an edge isoperimetric problem. 243
  
• Christian Bey:
  The Edge-Diametric Theorem in Hamming Spaces. 245-248
  
• Stefano Carpin:
  Algorithmic Motion Planning: the Randomized Approach. 249-253
  
• Ferdinando Cicalese, Christian Deppe:
  Q-ary Ulam-Rényi game with constrained lies. 255-261
  
• Sándor Csibi, Edward C. van der Meulen:
  Huge-size codes for identification via a multiple access channel under a word length constraint. 263-264
  
• Peter Damaschke:
  Threshold Group Testing. 265-271
  
• Rossitza Dodunekova, Stefan M. Dodunekov, E. Nikolova:
  A survey on proper codes. 273-275
  
• Ilya Dumer, Mark S. Pinsker, Vyacheslav V. Prelov:
  On the thinnest coverings of spheres and ellipsoids with balls in Hamming and Euclidean spaces. 277
  
• Mathieu Dutour, Michel Deza, Mikhail Shtogrin:
  Filling of a given boundary by p-gons and related problems. 279
  
• Arkadii G. D'yachkov, David C. Torney, Pavel A. Vilenkin, Scott White:
  Reverse-Complement Similarity Codes. 281-282
  
• Zoltán Füredi, Miklós Ruszinkó:
  Large Convex Cones in Hypercubes. 283-284
  
• Jozef Gruska:
  Universal Sets of Quantum Information Processing Primitives and their optimal use. 285-289
  
• Katalin Gyarmati:
  On a fast version of a pseudorandom generator. 291
  
• Sándor Györi:
  Coding for a Multiple Access OR Channel: a Survey. 293-296
  
• Frank Hampel:
  The proper fiducial argument. 297-300
  
• Ashot N. Harutyunyan:
  Notes on Conditions for Successive Refinement of Information. 301-302
  
• Mariam E. Haroutunian:
  Estimates of E-capacity and capacity regions for Multiple-access Channel With Random Parameter. 303-308
  
• Peter Harremoës:
  Lower Bounds for Divergence in Central Limit Theorem. 309-313
  
• Peter Harremoës, Flemming Topsøe:
  Zipf's law, hyperbolic distributions and entropy loss. 315-318
  
• Thomas Kalinowski:
  Realization of intensity modulated radiation fields using multileaf collimator. 319-320
  
• Christian Kleinewächter:
  On identification. 321-326
  
• Kingo Kobayashi, Hiroyoshi Morita, Mamoru Hoshi:
  Percolation on a k-ary Tree. 327
  
• Elena V. Konstantinova:
  On some applications of information indices in chemical graph theory. 329
  
• Alexandr V. Kostochka, Gexin Yu:
  Minimum degree conditions for H-linked graphs. 331
  
• Gohar M. M. Kyureghyan:
  Minimal Polynomials of the Modified de Bruijn Sequences. 333-336
  
• Melsik K. Kyuregyan:
  Monotonicity checking. 337-342
  
• Melsik K. Kyuregyan:
  Recursive Constructions of N-polynomials over GF (2^s). 343
  
• Bálint Laczay:
  Coding for the Multiple-Access Adder Channel. 345-346
  
• Vladimir I. Levenshtein, Elena V. Konstantinova, Eugene Konstantinov, Sergey Molodtsov:
  Reconstruction of a graph from 2-vicinities of its vertices^, . 347-351
  
• Mikhail B. Malyutov:
  Authorship attribution of texts: a review. 353-357
  
• Mikhail B. Malyutov, Dmitry M. Malyutov:
  On sequential discrimination between close Markov chains. 359-363
  
• Sergey G. Molodtsov:
  Largest Graphs of Diameter 2 and Maximum Degree 6. 365-366
  
• Melvyn B. Nathanson:
  Additive number theory and the ring of quantum integers. 367
  
• Joël Rivat, András Sárközy:
  On pseudorandom sequences and their application. 369-370
  
• Faina I. Solov'eva:
  On perfect binary codes. 371-372
  
• Ulrich Tamm:
  Size of Downsets in the Pushing Order and a Problem of Berlekamp. 373-376
  
• Armin Uhlmann:
  On Rank Two Channels. 377-378
  
• Armin Uhlmann:
  Quantum information transfer from one system to another one. 379-382
  
• Armin Uhlmann:
  Raum-Zeit und Quantenphysik - Ein Geburtstagsständchen für Hans-Jürgen Treder. 383-384
  
• Rainer Wilmink:
  Huge Quantum Broadcast Channels and Cryptographic Applications for Separable States. 385
  
• Andreas Winter:
  Identification via Quantum Channels in the Presence of Prior Correlation and Feedback. 387
  
• Zhaozhi Zhang:
  A Simplified Method for Computing the Key Equivocation for Additive-Like Instantaneous Block Encipherers. 389-391
  

Last update Tue Feb 14 04:17:27 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page