| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Rudolf Ahlswede, Harout K. Aydinian |
On Generic Erasure Correcting Sets and Related Problems.  |
IEEE Transactions on Information Theory  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Harout K. Aydinian |
On generic erasure correcting sets and related problems |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Harout K. Aydinian |
On Security of Statistical Databases. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Christian Deppe, Vladimir Lebedev |
Bounds for threshold and majority group testing. |
ISIT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Christian Deppe, Vladimir Lebedev |
Majority group testing with density tests. |
ISIT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Igor Bjelakovic, Holger Boche, Janis Noetzel |
Quantum capacity under adversarial quantum noise: arbitrarily varying quantum channels |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Igor Bjelakovic, Holger Boche, Janis Noetzel |
Entanglement transmission over arbitrarily varying quantum channels. |
ISIT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Ferdinando Cicalese, Christian Deppe, Ugo Vaccaro |
Two Batch Search With Lie Cost. |
IEEE Transactions on Information Theory |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Harout K. Aydinian |
Interactive Communication, Diagnosis and Error Control in Networks. |
Algorithmics of Large and Complex Networks |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede |
Ratewise-optimal non-sequential search strategies under constraints on the tests. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Ferdinando Cicalese, Christian Deppe |
Searching with lies under error cost constraints. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede |
Preface. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Vladimir Blinovsky |
Multiple packing in sum-type metric spaces. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede |
General theory of information transfer: Updated. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Harout K. Aydinian |
On diagnosability of large multiprocessor networks. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Haik Mashurian, T. Partner |
T-shift synchronization codes. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Julien Cassaigne, András Sárközy |
On the correlation of binary sequences. |
Discrete Applied Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Harout K. Aydinian |
Error Control Codes for Parallel Asymmetric Channels. |
IEEE Transactions on Information Theory |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Faina I. Solov'eva |
A Diametric Theorem in Z nm for Lee and Related Distances. |
ICMCTA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Vladimir Blinovsky |
Classical Capacity of Classical-Quantum Arbitrarily Varying Channels. |
IEEE Transactions on Information Theory |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian |
Intersection theorems under dimension constraints. |
J. Comb. Theory, Ser. A |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Vladimir Blinovsky |
Maximal sets of numbers not containing k+1 pairwise coprimes and having divisors from a specified set of primes. |
J. Comb. Theory, Ser. A |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Harout K. Aydinian |
Construction of asymmetric connectors of depth two. |
J. Comb. Theory, Ser. A |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian, Ludo M. G. M. Tolhuizen |
On q-ary codes correcting all unidirectional errors of a limited magnitude |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Rudolf Ahlswede, A. Cai |
An Interpretation of Identification Entropy. |
IEEE Transactions on Information Theory |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede |
Introduction. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Ning Cai |
Search with Noisy and Delayed Responses. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede |
Identification Entropy. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Ning Cai |
Appendix: On Edge-Isoperimetric Theorems for Uniform Hypergraphs. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Iskandar Karapetyan |
Intersection Graphs of Rectangles and Segments. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Erdal Arikan, Lars Bäumer, Christian Deppe |
Information Theoretic Models in Language Evolution. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Alexander Yudin |
On Partitions of a Rectangle into Rectangles with Restricted Number of Cross Sections. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Zheng Zhang |
Estimating with Randomized Encoding the Joint Empirical Distribution in a Correlated Source. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Ning Cai |
Transmission, Identification and Common Randomness Capacities for Wire-Tape Channels with Secure Feedback from the Decoder. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Levon H. Khachatrian |
On Attractive and Friendly Sets in Sequence Spaces. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede |
On Concepts of Performance Parameters for Channels. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Ning Cai |
Watermarking Identification Codes with Related Topics on Common Randomness. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede |
Information Theory and Some Friendly Neighbors - Ein Wunschkonzert. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede |
Finding CNRI(W), the Identification Capacity of the AVC W, if Randomization in the Encoding Is Excluded. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, János Körner |
Appendix: On Common Information and Related Characteristics of Correlated Information Sources. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Vladimir Blinovsky |
Correlation Inequalities in Function Spaces. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Ning Cai |
A Kraft-Type Inequality for d-Delay Binary Search Codes. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Søren Riis, Rudolf Ahlswede |
Problems in Network Coding and Error Correcting Codes Appended by a Draft Version of S. Riis "Utilising Public Information in Network Coding". |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Christian Mauduit, András Sárközy |
Large Families of Pseudorandom Sequences of k Symbols and Their Complexity - Part I. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Ning Cai |
Codes with the Identifiable Parent Property and the Multiple-Access Channel. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Martin Fröhlich |
A Fast Suffix-Sorting Algorithm. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Christian Mauduit, András Sárközy |
Large Families of Pseudorandom Sequences of k Symbols and Their Complexity - Part II. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede |
Rudolf Ahlswede - From 60 to 66. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede |
Appendix: On Set Coverings in Cartesian Product Spaces. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede |
Appendix: Solution of Burnashev's Problem and a Sharpening of the Erdös/Ko/Rado Theorem. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Bernhard Balkenhol, Christian Kleinewächter |
Identification for Sources. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Ning Cai |
A Strong Converse Theorem for Quantum Multiple Access Channels. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
classical quantum multiple access channel, strong converse, wringing technique, non–stationary memoryless classical quantum channel |
| 1 | Rudolf Ahlswede, Ning Cai, Zhaozhi Zhang |
Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherer. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Ella Aloyan, Evgueni A. Haroutunian |
On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Sources with Side Information. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Lars Bäumer, Ning Cai, Harout K. Aydinian, Vladimir Blinovsky, Christian Deppe, Haik Mashurian (eds.) |
General Theory of Information Transfer and Combinatorics |
GTIT-C |
2006 |
DBLP BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Harout K. Aydinian |
Sparse Asymmetric Connectors in Communication Networks. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
fault–tolerant connector, connector, rearrangeable network |
| 1 | Rudolf Ahlswede |
An Outside Opinion. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Evgueni A. Haroutunian |
On Logarithmically Asymptotically Optimal Testing of Hypotheses and Identification. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Mark S. Pinsker |
Report on Models of Write-Efficient Memories with Localized Errors and Defects. |
GTIT-C |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Christian Deppe, Vladimir Lebedev |
Non--binary error correcting codes with noiseless feedback, localized errors, or both. |
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery |
2006 |
DBLP BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Alberto Apostolico, Vladimir I. Levenshtein |
06201 Executive Summary -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery. |
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery |
2006 |
DBLP BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Alberto Apostolico, Vladimir I. Levenshtein (eds.) |
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, 14.05. - 19.05.2006 |
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery |
2006 |
DBLP BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Alberto Apostolico, Vladimir I. Levenshtein |
06201 Abstracts Collection -- Combinatorial and Algorithmic Foundations of Pattern and Association Discovery. |
Combinatorial and Algorithmic Foundations of Pattern and Association Discovery |
2006 |
DBLP BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Ella Aloyan, Evgueni A. Haroutunian |
On Logarithmically Asymptotically Optimal Hypothesis Testing for Arbitrarily Varying Source with Side Information. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Harout K. Aydinian |
On diagnosability of large multiprocessor networks. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Mark S. Pinsker |
Report on models of write-efficient memories with localized errors and defects. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Ning Cai |
Transmission, identification and common randomness capacities for wire-tape channels with secure feedback from the decoder. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Julien Cassaigne, András Sárközy |
On the correlation of binary sequences. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Vladimir Blinovsky |
Correlation Inequalities in Function Spaces. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Bernhard Balkenhol, Christian Kleinewächter |
Identification for Sources. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Vladimir Blinovsky |
Multiple Packing in Sum-type Metric Spaces. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Ferdinando Cicalese, Christian Deppe |
Searching with lies under error transition cost constraints. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Erdal Arikan, Lars Bäumer, Christian Deppe |
Information theoretic models in language evolution. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede |
Ratewise-optimal non-sequential search strategies under cardinality constraints on the tests. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Harout K. Aydinian |
Sparse asymmetric connectors in communication networks. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Christian Mauduit, András Sárközy |
Large families of pseudorandom sequences of k symbols and their complexity, Part II. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Levon H. Khachatrian |
On attractive and friendly sets in sequence spaces. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Haik Mashurian, T. Partner |
T-shift synchronization codes. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede |
General theory of information transfer. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Ning Cai |
Search with noisy and delayed response. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede |
Editorial Note. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Ning Cai |
Codes with the identifiable parent property and the multiple-access channel. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Zhen Zhang |
Estimating with randomized encoding the joint empirical distribution in a correlated source. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Ning Cai |
A Kraft-type inequality for d-delay binary search codes. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Ning Cai |
Watermarking Identification Codes with Related Topics on Common Randomness. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Ning Cai, Zhaozhi Zhang |
Secrecy Systems for Identification Via Channels with Additive-Like Instantaneous Block Encipherers. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Christian Mauduit, András Sárközy |
Large families of pseudorandom sequences of k symbols and their complexity, Part I. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Alexander Yudin |
On partitions of a rectangle into rectangles with restricted number of cross sections. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede |
Identification Entropy. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Ning Cai |
A Strong Converse Theorem for Quantum Multiple Access Channels. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Evgueni A. Haroutunian |
Testing of Hypothesis and Identification. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Bernhard Balkenhol, Christian Deppe, Martin Fröhlich |
A Fast Suffix-Sorting Algorithm. |
Electronic Notes in Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian |
Forbidden (0, 1)-vectors in Hyperplanes of Rn: The unrestricted case. |
Des. Codes Cryptography |
2005 |
DBLP DOI BibTeX RDF |
combinatorial extremal theory, (0, 1)-vectors, dimension constraints, forbidden weights |
| 1 | Rudolf Ahlswede, Levon H. Khachatrian |
Katona's Intersection Theorem: Four Proofs. |
Combinatorica |
2004 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C35, 05D05, 05C65 |
| 1 | Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian |
On Shadows Of Intersecting Families. |
Combinatorica |
2004 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 05C35, 05D05, 05C65 |
| 1 | Rudolf Ahlswede, Ning Cai |
On Lossless Quantum Data Compression With a Classical Helper. |
IEEE Transactions on Information Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian |
Extremal problems under dimension constraints. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian |
Maximal antichains under dimension constraints. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian |
More about shifting techniques. |
Eur. J. Comb. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian |
Maximum Number of Constant Weight Vertices of the Unit n-Cube Contained in a k-Dimensional Subspace. |
Combinatorica |
2003 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000): 05D05, 15A03 |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")