| Publication | Date of Publication | Type |
|---|
Recovery sets of subspaces from a simplex code
IEEE Transactions on Information Theory | 2025-01-23 | Paper |
Liouville-type theorems for the 3D stationary MHD equations
Mediterranean Journal of Mathematics | 2024-07-03 | Paper |
Scheduling to reduce close contacts: resolvable grid graph decomposition and packing
Designs, Codes and Cryptography | 2023-11-20 | Paper |
Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes Using Linear Programming
IEEE Transactions on Information Theory | 2021-02-22 | Paper |
Grassmannian Codes With New Distance Measures for Network Coding
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
Decompositions of edge-colored digraphs: a new technique in the construction of constant-weight codes and related families
SIAM Journal on Discrete Mathematics | 2019-01-23 | Paper |
Multiset combinatorial batch codes
Designs, Codes and Cryptography | 2018-10-10 | Paper |
Constructions of Optimal and Near-Optimal Multiply Constant-Weight Codes
IEEE Transactions on Information Theory | 2018-09-19 | Paper |
Optimal codes in the Enomoto-Katona space
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
Optimal Ternary Constant-Weight Codes of Weight Four and Distance Six
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Optimal Ternary Constant-Weight Codes With Weight 4 and Distance 5
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Optimal Quaternary Constant-Weight Codes With Weight Four and Distance Five
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Complexity of Dependences in Bounded Domains, Armstrong Codes, and Generalizations
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses
Designs, Codes and Cryptography | 2015-10-26 | Paper |
Completely reducible super-simple designs with block size five and index two
Designs, Codes and Cryptography | 2015-09-01 | Paper |
Hanani triple packings and optimal \(q\)-ary codes of constant weight three
Designs, Codes and Cryptography | 2015-05-21 | Paper |
Optimal ternary constant-composition codes with weight four and distance six
Discrete Mathematics | 2014-12-19 | Paper |
Optimal constant weight covering codes and nonuniform group divisible 3-designs with block size four
Designs, Codes and Cryptography | 2012-02-15 | Paper |
Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher order
Advances in Mathematics of Communications | 2011-05-17 | Paper |
Completely reducible super-simple designs with block size four and related super-simple packings
Designs, Codes and Cryptography | 2011-04-06 | Paper |
