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: 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 Deppe, Haik Mashurian, T. Partner: T-shift synchronization codes. 119-123
- Rudolf Ahlswede, Ning Cai: Codes with the identifiable parent property and the multiple-access channel. 143-147
- 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, 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: Identification Entropy. 191-192
- 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
- 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
- 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
- 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
- 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
- Thomas Kalinowski: Realization of intensity modulated radiation fields using multileaf collimator. 319-320
- Christian Kleinewächter: On identification. 321-326
- Elena V. Konstantinova: On some applications of information indices in chemical graph theory. 329
- 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 (2s). 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
- 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
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-19T203413 by the dblp team