IEEE Fellow 2013, "For contributions to combinatorial aspects of coding theory".
2019
Interlocked Permutations.
SIAM J. Discret. Math., 2019
On q-ary plateaued functions over Fq and their explicit characterizations.
Eur. J. Comb., 2019
How many weights can a linear code have?
Des. Codes Cryptogr., 2019
2018
Maximum weight spectrum codes with reduced length.
CoRR, 2018
2017
Path Separation by Short Cycles.
J. Graph Theory, 2017
On a generalised combinatorial conjecture involving addition mod 2<sup>k</sup> - 1.
Int. J. Inf. Coding Theory, 2017
Fast algebraic immunity of Boolean functions.
Adv. Math. Commun., 2017
2016
Zero-Error Capacity of Binary Channels With Memory.
IEEE Trans. Inf. Theory, 2016
Yet another variation on minimal linear codes.
Adv. Math. Commun., 2016
2015
Cyclic codes and algebraic immunity of Boolean functions.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015
On Existence (Based on an Arithmetical Problem) and Constructions of Bent Functions.
Proceedings of the Cryptography and Coding - 15th IMA International Conference, 2015
2014
Connector Families of Graphs.
Graphs Comb., 2014
Sphere coverings and identifying codes.
Des. Codes Cryptogr., 2014
Variations on Minimal Linear Codes.
Proceedings of the Coding Theory and Applications, 4th International Castle Meeting, 2014
2013
Cyclic colliding permutations.
Electron. Notes Discret. Math., 2013
More on Connector Families.
Electron. Notes Discret. Math., 2013
Public-key Cryptography from Different Assumptions - A Multi-bit Version.
Proceedings of the SECRYPT 2013, 2013
On Minimal and Quasi-minimal Linear Codes.
Proceedings of the Cryptography and Coding - 14th IMA International Conference, 2013
Towards Secure Two-Party Computation from the Wire-Tap Channel.
Proceedings of the Information Security and Cryptology - ICISC 2013, 2013
On constructions of semi-bent functions from bent functions.
Proceedings of the Discrete Geometry and Algebraic Combinatorics, 2013
2012
Secure network coding and non-malleable codes: Protection against linear tampering.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012
2011
IEEE Trans. Inf. Theory, 2011
IEEE Trans. Inf. Theory, 2011
The Value 4 of Binary Kloosterman Sums.
IACR Cryptol. ePrint Arch., 2011
On a generalized combinatorial conjecture involving addition mod 2<sup>k</sup>-1.
IACR Cryptol. ePrint Arch., 2011
Permutation Capacities and Oriented Infinite Paths.
Electron. Notes Discret. Math., 2011
Non-malleable codes from the wire-tap channel.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011
The average radius of codes: Survey and new results.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011
Binary Kloosterman Sums with Value 4.
Proceedings of the Cryptography and Coding - 13th IMA International Conference, 2011
On the Link of Some Semi-bent Functions with Kloosterman Sums.
Proceedings of the Coding and Cryptology - Third International Workshop, 2011
Generalized Witness Sets.
Proceedings of the First International Conference on Data Compression, 2011
2010
Permutation Capacities of Families of Oriented Infinite Paths.
SIAM J. Discret. Math., 2010
On a conjecture about binary strings distribution.
IACR Cryptol. ePrint Arch., 2010
New identifying codes in the binary Hamming space.
Eur. J. Comb., 2010
Identification codes in cryptographic protocols.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010
On the threshold of Maximum-Distance Separable codes.
Proceedings of the IEEE International Symposium on Information Theory, 2010
Proceedings of the IEEE International Symposium on Information Theory, 2010
2009
RFID key establishment against active adversaries.
Proceedings of the First IEEE International Workshop on Information Forensics and Security, 2009
Private Interrogation of Devices via Identification Codes.
Proceedings of the Progress in Cryptology, 2009
Separation and Witnesses.
Proceedings of the Coding and Cryptology, Second International Workshop, 2009
2008
Theoretical and Practical Boundaries of Binary Secure Sketches.
IEEE Trans. Inf. Forensics Secur., 2008
Discriminating codes in (bipartite) planar graphs.
Eur. J. Comb., 2008
On the permutation capacity of digraphs
CoRR, 2008
Discriminating codes in bipartite graphs: bounds, extremal cardinalities, complexity.
Adv. Math. Commun., 2008
Convolutional Tanner structures for non-ergodic wireless channels.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008
Proceedings of the Coding Theory and Applications, Second International Castle Meeting, 2008
2007
Optimal Iris Fuzzy Sketches
CoRR, 2007
Duality between packings and coverings of the Hamming space.
Adv. Math. Commun., 2007
Links Between Discriminating and Identifying Codes in the Binary Hamming Space.
Proceedings of the Applied Algebra, 2007
2006
Discriminating codes in bipartite graphs.
Electron. Notes Discret. Math., 2006
Nested Codes for Constrained Memory and for Dirty Paper.
Proceedings of the Applied Algebra, 2006
2005
Bounds on distance distributions in codes of known size.
IEEE Trans. Inf. Theory, 2005
A Trellis-Based Bound on (2, 1)-Separating Codes.
Proceedings of the Cryptography and Coding, 2005
North-Holland mathematical library 54, North-Holland, ISBN: 978-0-444-82511-7, 2005
2004
Upper Bounds on Separating Codes.
IEEE Trans. Inf. Theory, 2004
Separating Codes: Constructions and Bounds.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004
2003
The rate of regular LDPC codes.
IEEE Trans. Inf. Theory, 2003
Generalized hashing and parent-identifying codes.
J. Comb. Theory A, 2003
Erratum to "Intersecting codes and separating codes": [Discrete Applied Mathematics 128 (2003) 75-83].
Discret. Appl. Math., 2003
Intersecting Codes and Separating Codes.
Discret. Appl. Math., 2003
Copyright Control and Separating Systems.
Proceedings of the Applied Algebra, 2003
2002
More on (2,2)-separating systems.
IEEE Trans. Inf. Theory, 2002
Frameproof codes against limited coalitions of pirates.
Theor. Comput. Sci., 2002
2001
On Codes Identifying Vertices in the Two-Dimensional Square Lattice with Diagonals.
IEEE Trans. Computers, 2001
Binary B<sub>2</sub>-Sequences : A New Upper Bound.
J. Comb. Theory A, 2001
Intersecting codes and partially identifying codes.
Electron. Notes Discret. Math., 2001
A hypergraph approach to the identifying parent property: the case of multiple parents.
Electron. Notes Discret. Math., 2001
Some new p-ary two-secure frameproof codes.
Appl. Math. Lett., 2001
Binary Codes for Collusion-Secure Fingerprinting.
Proceedings of the Information Security and Cryptology, 2001
Partially Identifying Codes for Copyright Protection.
Proceedings of the Applied Algebra, 2001
2000
Bounds for Codes Identifying Vertices in the Hexagonal Grid.
SIAM J. Discret. Math., 2000
On self-dual ternary codes and their coordinate ordering.
Inf. Sci., 2000
Copyright protection for digital data.
IEEE Commun. Lett., 2000
A hypergraph approach to digital fingerprinting.
Electron. Notes Discret. Math., 2000
Codes with forbidden distances.
Discret. Math., 2000
Linear Codes and Their Coordinate Ordering.
Des. Codes Cryptogr., 2000
Projective codes which satisfy the chain condition.
Appl. Math. Lett., 2000
Tracing and Proving Ownership of Digital Objects.
Proceedings of the 2000 International Symposium on Information Technology (ITCC 2000), 2000
1999
Constructions of Intersecting Codes.
IEEE Trans. Inf. Theory, 1999
On binary constructions of quantum codes.
IEEE Trans. Inf. Theory, 1999
On Linear Projective Codes Which Satisfy the Chain Condition.
Inf. Sci., 1999
On the Characterization of Linear Uniquely Decodable Codes.
Des. Codes Cryptogr., 1999
Des. Codes Cryptogr., 1999
New Bounds for Codes Identifying Vertices in Graphs.
Electron. J. Comb., 1999
Proceedings of the Codes and Association Schemes, 1999
On the State Complexities of Ternary Codes.
Proceedings of the Applied Algebra, 1999
1998
How to Improve an Exponentiation Black-Box.
Proceedings of the Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31, 1998
1997
Long packing and covering codes.
IEEE Trans. Inf. Theory, 1997
Covering Radius 1985-1994.
Appl. Algebra Eng. Commun. Comput., 1997
1996
On greedy algorithms in coding theory.
IEEE Trans. Inf. Theory, 1996
On the traveling salesman problem in binary Hamming spaces.
IEEE Trans. Inf. Theory, 1996
Tilings of Binary Spaces.
SIAM J. Discret. Math., 1996
1995
The threshold probability of a code.
IEEE Trans. Inf. Theory, 1995
Weighted coverings and packings.
IEEE Trans. Inf. Theory, 1995
Variations on Minimal Codewords in Linear Codes.
Proceedings of the Applied Algebra, 1995
1994
Intersecting codes and independent families.
IEEE Trans. Inf. Theory, 1994
Upper bounds on generalized distances.
IEEE Trans. Inf. Theory, 1994
1993
Write-isolated memories (WIMs).
Discret. Math., 1993
Bounds on generalized weights.
Proceedings of the Algebraic Coding, 1993
1992
On the covering radius of Reed-Muller codes.
Discret. Math., 1992
Application of Coding Theory to Interconnection Networks.
Discret. Appl. Math., 1992
1991
Error-correcting WOM-codes.
IEEE Trans. Inf. Theory, 1991
A note on perfect multiple covetings of the Hamming space.
IEEE Trans. Inf. Theory, 1991
DC-constrained error-correcting codes with small running digital sum.
IEEE Trans. Inf. Theory, 1991
On Perfect Weighted Coverings with Small Radius.
Proceedings of the Algebraic Coding, 1991
Error-Correction for WIMs and WUMs.
Proceedings of the Applied Algebra, 1991
1990
Applications of coding theory to communication combinatorial problems.
Discret. Math., 1990
Unidirectional error-detecting codes.
Proceedings of the EUROCODE '90, 1990
Covering Radius and Writing on Memories.
Proceedings of the Applied Algebra, 1990
1989
Coding for write-unidirectional memories and conflict resolution.
Discret. Appl. Math., 1989
1988
Generating codewords in real space: Application to decoding.
Proceedings of the Coding Theory and Applications, 1988
1987
Sur La Complexité D'un Problème De Codage.
RAIRO Theor. Informatics Appl., 1987
Non Linear Covering Codes: A Few Results and Conjectures.
Proceedings of the Applied Algebra, 1987
1986
Further results on the covering radius of codes.
IEEE Trans. Inf. Theory, 1986
Linear binary code for write-once memories.
IEEE Trans. Inf. Theory, 1986
Composite permutation coding of speech waveforms.
Proceedings of the IEEE International Conference on Acoustics, 1986
On the Inherent Intractability of Soft Decision Decoding of Linear Codes.
Proceedings of the Coding Theory and Applications, 2nd International Colloquium, 1986
On the Density of Best Coverings in Hamming Spaces.
Proceedings of the Coding Theory and Applications, 2nd International Colloquium, 1986
1985
Covering radius - Survey and recent results.
IEEE Trans. Inf. Theory, 1985
Linear intersecting codes.
Discret. Math., 1985
Good coverings of Hamming spaces with spheres.
Discret. Math., 1985
Authorized Writing for "Write-Once" Memories.
Proceedings of the Advances in Cryptology, 1985
Some Cryptographic Aspects of Womcodes.
Proceedings of the Advances in Cryptology, 1985
1984
On a conjecture concerning coverings of Hamming space.
Proceedings of the Applied Algebra, 1984
1983
A nonconstructive upper bound on covering radius.
IEEE Trans. Inf. Theory, 1983
1980
On the minimum distance of some BCH codes (Corresp.).
IEEE Trans. Inf. Theory, 1980
On tilings of the binary vector space.
Discret. Math., 1980
1979
Inf. Control., October, 1979
1976
Residual error rate of binary linear block codes (Corresp.).
IEEE Trans. Inf. Theory, 1976
