Information Theory, Combinatorics, and Search Theory

Keyphrases

Publications

2013

Igor Bjelakovic, Holger Boche, Gisbert Janßen, Janis Nötzel
Arbitrarily Varying and Compound Classical-Quantum Channels and a Note on Quantum Zero-Error Capacities. Information Theory, Combinatorics, and Search Theory (2013)
Christian Deppe, Christian Wischmann
A Heuristic Solution of a Cutting Problem Using Hypergraphs. Information Theory, Combinatorics, and Search Theory (2013)
Igor Bjelakovic, Holger Boche, Jochen Sommerfeld
Capacity Results for Arbitrarily Varying Wiretap Channels. Information Theory, Combinatorics, and Search Theory (2013)
Éva Czabarka, Matteo Marsili, László A. Székely
Threshold Functions for Distinct Parts: Revisiting Erdős-Lehner. Information Theory, Combinatorics, and Search Theory (2013)
Matthias Löwe
How to Read a Randomly Mixed Up Message. Information Theory, Combinatorics, and Search Theory (2013)
Vladimir M. Blinovsky, Minglai Cai
Classical-Quantum Arbitrarily Varying Wiretap Channel. Information Theory, Combinatorics, and Search Theory (2013)
Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann
An Unstable Hypergraph Problem with a Unique Optimal Solution. Information Theory, Combinatorics, and Search Theory (2013)
Elena V. Konstantinova
On Some Structural Properties of Star and Pancake Graphs. Information Theory, Combinatorics, and Search Theory (2013)
Evgueni A. Haroutunian, Parandzem M. Hakobyan
Multiple Objects: Error Exponents in Hypotheses Testing and Identification. Information Theory, Combinatorics, and Search Theory (2013)
Andreas J. Winter
Identification via Quantum Channels. Information Theory, Combinatorics, and Search Theory (2013)
Andreas Allemann
An Efficient Algorithm for Combinatorial Group Testing. Information Theory, Combinatorics, and Search Theory (2013)
Anas Chaaban, Aydin Sezgin, Daniela Tuninetti
Achieving Net Feedback Gain in the Linear-Deterministic Butterfly Network with a Full-Duplex Relay. Information Theory, Combinatorics, and Search Theory (2013)
Rudolf Ahlswede, Harout K. Aydinian
New Construction of Error-Tolerant Pooling Designs. Information Theory, Combinatorics, and Search Theory (2013)
Christian Heup
Two New Results for Identification for Sources. Information Theory, Combinatorics, and Search Theory (2013)
Rudolf Ahlswede, Imre Csiszár
On Oblivious Transfer Capacity. Information Theory, Combinatorics, and Search Theory (2013)
Ulrich Tamm
Creating Order and Ballot Sequences. Information Theory, Combinatorics, and Search Theory (2013)
Ulrich Tamm
Multiparty Communication Complexity of Vector-Valued and Sum-Type Functions. Information Theory, Combinatorics, and Search Theory (2013)
Christian Heup
L-Identification for Uniformly Distributed Sources and the q-ary Identification Entropy of Second Order. Information Theory, Combinatorics, and Search Theory (2013)
Moritz Wiese, Holger Boche
Strong Secrecy for Multiple Access Channels. Information Theory, Combinatorics, and Search Theory (2013)
Charles J. Colbourn, Peyman Nayeri
Randomized Post-optimization for t-Restrictions. Information Theory, Combinatorics, and Search Theory (2013)
David M. Einstein, Lee K. Jones
Uniformly Generating Origin Destination Tables. Information Theory, Combinatorics, and Search Theory (2013)
Rudolf Ahlswede, Christian Deppe, Vladimir S. Lebedev
Threshold and Majority Group Testing. Information Theory, Combinatorics, and Search Theory (2013)
Ingo Althöfer
Remarks on History and Presence of Game Tree Search and Research. Information Theory, Combinatorics, and Search Theory (2013)
Rudolf Ahlswede, Vladimir S. Lebedev
The Restricted Word Shadow Problem. Information Theory, Combinatorics, and Search Theory (2013)
Binyue Liu, Ning Cai
Optimal Rate Region of Two-Hop Multiple Access Channel via Amplify-and-Forward Scheme. Information Theory, Combinatorics, and Search Theory (2013)
Michael Bodewig
Multiplied Complete Fix-Free Codes and Shiftings Regarding the 3/4-Conjecture. Information Theory, Combinatorics, and Search Theory (2013)
Christian Mauduit, András Sárközy
Family Complexity and VC-Dimension. Information Theory, Combinatorics, and Search Theory (2013)
Dániel Gerbner, Balázs Keszegh, Dömötör Pálvölgyi, Gábor Wiener
Density-Based Group Testing. Information Theory, Combinatorics, and Search Theory (2013)
Arkadii G. D'yachkov, Vyacheslav V. Rykov, Christian Deppe, Vladimir S. Lebedev
Superimposed Codes and Threshold Group Testing. Information Theory, Combinatorics, and Search Theory (2013)
David E. Daykin, Jacqueline W. Daykin, Costas S. Iliopoulos, W. F. Smyth
Generic Algorithms for Factoring Strings. Information Theory, Combinatorics, and Search Theory (2013)
Gyula O. H. Katona, Krisztián Tichler
Search When the Lie Depends on the Target. Information Theory, Combinatorics, and Search Theory (2013)
Sergei L. Bezrukov, Uwe Leck, Victor P. Piotrowski
On Data Recovery in Distributed Databases. Information Theory, Combinatorics, and Search Theory (2013)
Hong-Bin Chen, Hung-Lin Fu
Group Testing with Multiple Mutually-Obscuring Positives. Information Theory, Combinatorics, and Search Theory (2013)
Mikhail B. Malyutov
Search for Sparse Active Inputs: A Review. Information Theory, Combinatorics, and Search Theory (2013)
Travis Gagie
On the Value of Multiple Read/Write Streams for Data Compression. Information Theory, Combinatorics, and Search Theory (2013)
Harout K. Aydinian, Éva Czabarka, László A. Székely
Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full Multitransversals. Information Theory, Combinatorics, and Search Theory (2013)

volume 7777, 2013

Information Theory, Combinatorics, and Search Theory - In Memory of Rudolf Ahlswede Information Theory, Combinatorics, and Search Theory 7777 (2013)