| Publication | Date of Publication | Type |
|---|
Secure codes with list decoding
IEEE Transactions on Information Theory | 2024-07-22 | Paper |
On the Information-Theoretic Security of Combinatorial All-or-Nothing Transforms
IEEE Transactions on Information Theory | 2024-03-14 | Paper |
Codes for exact support recovery of sparse vectors from inaccurate linear measurements and their decoding
Problems of Information Transmission | 2023-09-04 | Paper |
Ideal Secret Sharing Schemes: Combinatorial Characterizations, Certain Access Structures, and Related Geometric Problems
(available as arXiv preprint) | 2023-04-18 | Paper |
| Secure Codes with List Decoding | 2023-02-05 | Paper |
Optimal Locally Repairable Codes: An Improved Bound and Constructions
IEEE Transactions on Information Theory | 2022-08-19 | Paper |
A Construction of Maximally Recoverable Codes With Order-Optimal Field Size
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
Capacity-Achieving Private Information Retrieval Schemes From Uncoded Storage Constrained Servers With Low Sub-Packetization
IEEE Transactions on Information Theory | 2021-09-07 | Paper |
Algebraic manipulation detection codes via highly nonlinear functions
Cryptography and Communications | 2021-07-13 | Paper |
Union-intersection-bounded families and their applications
Discrete Applied Mathematics | 2021-05-19 | Paper |
Strongly separable matrices for nonadaptive combinatorial group testing
Discrete Applied Mathematics | 2021-03-25 | Paper |
Signature Codes for Weighted Binary Adder Channel and Multimedia Fingerprinting
IEEE Transactions on Information Theory | 2021-02-22 | Paper |
Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise
Problems of Information Transmission | 2021-02-18 | Paper |
BCH codes with minimum distance proportional to code length
SIAM Journal on Discrete Mathematics | 2021-02-15 | Paper |
On Optimal Locally Repairable Codes With Super-Linear Length
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
On Optimal Locally Repairable Codes With Multiple Disjoint Repair Sets
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
On optimal weak algebraic manipulation detection codes and weighted external difference families
Designs, Codes and Cryptography | 2020-07-15 | Paper |
Probabilistic Existence Results for Parent-Identifying Schemes
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Non-adaptive group testing on graphs with connectivity
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
Bounds on Traceability Schemes
IEEE Transactions on Information Theory | 2018-09-14 | Paper |
New Bounds for Frameproof Codes
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Zero-Difference Balanced Functions With New Parameters and Their Applications
IEEE Transactions on Information Theory | 2017-09-21 | Paper |
Optimal Frequency Hopping Sequences: Auto- and Cross-Correlation Properties
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Separable Codes
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Codes with the identifiable parent property for multimedia fingerprinting
Designs, Codes and Cryptography | 2017-03-23 | Paper |
Bounds and constructions for \(\overline{3}\)-separable codes with length 3
Designs, Codes and Cryptography | 2016-08-31 | Paper |
Strongly separable codes
Designs, Codes and Cryptography | 2016-05-19 | Paper |
| scientific article; zbMATH DE number 6497236 (Why is no real title available?) | 2015-10-21 | Paper |
New bounds on \(\bar{2}\)-separable codes of length 2
Designs, Codes and Cryptography | 2015-01-23 | Paper |
| scientific article; zbMATH DE number 6321321 (Why is no real title available?) | 2014-07-25 | Paper |
Bounds and constructions for \((v,W,2,Q)\)-OOCs
Discrete Mathematics | 2014-05-06 | Paper |
| scientific article; zbMATH DE number 5934246 (Why is no real title available?) | 2011-07-29 | Paper |
Monotonic directed designs
SIAM Journal on Discrete Mathematics | 2011-03-15 | Paper |
Perfect difference families, perfect difference matrices, and related combinatorial structures
Journal of Combinatorial Designs | 2010-11-24 | Paper |
On block sequences of Steiner quadruple systems with error correcting consecutive unions
SIAM Journal on Discrete Mathematics | 2010-06-01 | Paper |
A Systematic Construction for Radar Arrays
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Optimal Frequency Hopping Sequences: A Combinatorial Approach
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
A TWOOA construction for multi-receiver multi-message authentication codes
Journal of Mathematical Cryptology | 2008-08-11 | Paper |
| scientific article; zbMATH DE number 5180844 (Why is no real title available?) | 2007-08-20 | Paper |
Coding and Cryptography
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Further combinatorial constructions for optimal frequency-hopping sequences
Journal of Combinatorial Theory. Series A | 2006-12-07 | Paper |
GOB designs for authentication codes with arbitration
Designs, Codes and Cryptography | 2006-11-22 | Paper |
Combinatorial characterizations of one-coincidence frequency-hopping sequences
Designs, Codes and Cryptography | 2006-11-22 | Paper |
Information Security and Cryptology - ICISC 2003
Lecture Notes in Computer Science | 2005-12-27 | Paper |
Combinatorial Constructions for Optimal Splitting Authentication Codes
SIAM Journal on Discrete Mathematics | 2005-09-16 | Paper |
Combinatorial constructions of optimal optical orthogonal codes with weight 4
IEEE Transactions on Information Theory | 2005-06-01 | Paper |
Constructions for optimal optical orthogonal codes
Discrete Mathematics | 2003-03-16 | Paper |
Balanced nested designs and balanced arrays
Discrete Mathematics | 2003-03-16 | Paper |
A combinatorial characterization of regular anonymous perfect threshold schemes
Information Processing Letters | 2003-01-22 | Paper |
Directed \(B(K,1;v)\) with \(K= \{4,5\}\) and \(\{4,6\}\) related to deletion/insertion-correcting codes
Journal of Combinatorial Designs | 2002-10-09 | Paper |
Balanced nested designs and balanced \(n\)-ary designs
Journal of Statistical Planning and Inference | 2002-09-18 | Paper |
Frames with block size four and index three
Journal of Statistical Planning and Inference | 2002-09-18 | Paper |
General constructions for double group divisible designs and double frames
Designs, Codes and Cryptography | 2002-08-21 | Paper |
A note on geometric structures of linear ordered orthogonal arrays and \((t,m,s)\)-nets of low strength
Designs, Codes and Cryptography | 2002-08-21 | Paper |
Constructions for rotational near resolvable block designs
Journal of Combinatorial Designs | 2002-07-22 | Paper |
\((C_k\oplus G,k,\lambda)\) difference families
Designs, Codes and Cryptography | 2002-04-15 | Paper |
Cyclically resolvable cyclic Steiner 2-systems S(2, 4, 52)
Journal of Statistical Planning and Inference | 2002-01-28 | Paper |
Optical orthogonal codes derived from difference triangle sets
Congressus Numerantium | 2001-12-10 | Paper |
Optimal \((9v,4,1)\) optical orthogonal codes
SIAM Journal on Discrete Mathematics | 2001-06-21 | Paper |
Existence of nested designs with block size five
Journal of Statistical Planning and Inference | 2001-06-19 | Paper |
Optical orthogonal codes: Their bounds and new optimal constructions
IEEE Transactions on Information Theory | 2001-03-19 | Paper |
| scientific article; zbMATH DE number 1533228 (Why is no real title available?) | 2000-11-20 | Paper |
Cyclically resolvable cyclic Steiner triple systems of order 21 and 39
Discrete Mathematics | 2000-11-19 | Paper |
Two classes of \(q\)-ary codes based on group divisible association schemes
Discrete Mathematics | 1999-11-02 | Paper |
Nested designs of superblock size four
Journal of Statistical Planning and Inference | 1999-08-23 | Paper |
On cyclically resolvable cyclic Steiner 2-designs
Journal of Combinatorial Theory. Series A | 1999-08-19 | Paper |
| scientific article; zbMATH DE number 1161258 (Why is no real title available?) | 1999-08-19 | Paper |
| scientific article; zbMATH DE number 1229613 (Why is no real title available?) | 1999-03-17 | Paper |
A construction for resolvable designs and its generalizations
Graphs and Combinatorics | 1998-09-14 | Paper |
| scientific article; zbMATH DE number 1109418 (Why is no real title available?) | 1998-01-25 | Paper |
Nested designs with block size five and subblock size two
Journal of Statistical Planning and Inference | 1997-11-04 | Paper |
| scientific article; zbMATH DE number 1042588 (Why is no real title available?) | 1997-09-22 | Paper |
FURTHER CONSTRUCTIONS OF NESTED GROUP DIVISIBLE DESIGNS
JOURNAL OF THE JAPAN STATISTICAL SOCIETY | 1997-09-17 | Paper |
A few results on block-colourings of designs
Hiroshima Mathematical Journal | 1997-07-08 | Paper |
Some non-embeddable quasi-derived designs
Journal of Combinatorial Theory. Series A | 1997-06-10 | Paper |
Concerning the vector \(v(m,t)\)
Journal of Statistical Planning and Inference | 1997-01-26 | Paper |
Difference families with applications to resolvable designs
Hiroshima Mathematical Journal | 1996-08-22 | Paper |
| scientific article; zbMATH DE number 917328 (Why is no real title available?) | 1996-08-15 | Paper |
| scientific article; zbMATH DE number 786184 (Why is no real title available?) | 1996-01-28 | Paper |
Perfect Mendelsohn designs with block size six
Discrete Mathematics | 1995-10-22 | Paper |
Resolvable BIBDs with block size 8 and index 7
Journal of Combinatorial Designs | 1995-05-04 | Paper |
| scientific article; zbMATH DE number 749295 (Why is no real title available?) | 1995-05-01 | Paper |
Existence of resolvable BIBDs with \(k=5\) and \(\lambda=4\)
Discrete Mathematics | 1994-10-10 | Paper |
| scientific article; zbMATH DE number 398967 (Why is no real title available?) | 1993-08-25 | Paper |
| scientific article; zbMATH DE number 54795 (Why is no real title available?) | 1992-09-26 | Paper |
