Harout K. Aydinian

Holger Boche

Proceedings of the 2019 IEEE Wireless Communications and Networking Conference, 2019

2018

A Combinatorial Model of Two-Sided Search.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2018

2017

A subspace covering problem in the n-cube.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Fractional repetition codes based on partially ordered sets.

[BibT_eX]

[DOI]

Holger Boche

Proceedings of the 2017 IEEE Information Theory Workshop, 2017

2016

Type II wiretap channel with an active eavesdropper in finite blocklength regime.

[BibT_eX]

[DOI]

Anna Frank

Holger Boche

Proceedings of the IEEE Wireless Communications and Networking Conference Workshops, 2016

2014

Maximizing the Number of Nonnegative Subsets.

[BibT_eX]

[DOI]

Noga Alon

Hao Huang

SIAM J. Discret. Math., 2014

AZ-Identities and Strict 2-Part Sperner Properties of Product Posets.

[BibT_eX]

[DOI]

Péter L. Erdös

Order, 2014

2013

Mixed Orthogonal Arrays, k-Dimensional M-Part Sperner Multifamilies, and Full Multitransversals.

[BibT_eX]

[DOI]

Éva Czabarka

László A. Székely

Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

New Construction of Error-Tolerant Pooling Designs.

[BibT_eX]

[DOI]

Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

2012

On Generic Erasure Correcting Sets and Related Problems.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

A remark on the problem of nonnegative k-subset sums.

[BibT_eX]

[DOI]

Vladimir M. Blinovsky

Probl. Inf. Transm., 2012

2011

On Security of Statistical Databases.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

A tour of M-part L-Sperner families.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2011

On two-part Sperner systems for regular posets (Extended Abstract).

[BibT_eX]

[DOI]

Péter L. Erdös

Electron. Notes Discret. Math., 2011

2010

A note on full transversals and mixed orthogonal arrays.

[BibT_eX]

[DOI]

Australas. J Comb., 2010

2009

Interactive Communication, Diagnosis and Error Control in Networks.

[BibT_eX]

[DOI]

Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

2008

Error Control Codes for Parallel Asymmetric Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Levon H. Khachatrian: 1954-2002.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

On diagnosability of large multiprocessor networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

2007

All Maximum Size Two-Part Sperner Systems: In Short.

[BibT_eX]

[DOI]

Péter L. Erdös

Comb. Probab. Comput., 2007

2006

Intersection theorems under dimension constraints.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2006

Construction of asymmetric connectors of depth two.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2006

An extremal problem on graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

On q-ary codes correcting all unidirectional errors of a limited magnitude

[BibT_eX]

[DOI]

Ludo M. G. M. Tolhuizen

CoRR, 2006

Generalized Anticodes in Hamming Spaces.

[BibT_eX]

[DOI]

Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

2005

Sparse asymmetric connectors in communication networks.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Forbidden (0, 1)-vectors in Hyperplanes of Rn: The unrestricted case.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2005

2004

On Shadows Of Intersecting Families.

[BibT_eX]

[DOI]

Comb., 2004

2003

More about shifting techniques.

[BibT_eX]

[DOI]

Eur. J. Comb., 2003

Maximal antichains under dimension constraints.

[BibT_eX]

[DOI]

Discret. Math., 2003

Forbidden (0, 1)-Vectors in Hyperplanes of Rn: The Restricted Case.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2003

Maximum Number of Constant Weight Vertices of the Unit n-Cube Contained in a k-Dimensional Subspace.

[BibT_eX]

[DOI]

Comb., 2003

2001

Extremal problems under dimension constraints.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

On Perfect Codes and Related Concepts.

[BibT_eX]

Des. Codes Cryptogr., 2001

1998

The Intersection Theorem for Direct Products.

[BibT_eX]

[DOI]