| Publication | Date of Publication | Type |
|---|
Exploring quantum weight enumerators from the n-qubit parallelized SWAP test
IEEE Transactions on Information Theory | 2026-03-18 | Paper |
Optimal redundancy of function-correcting codes
IEEE Transactions on Information Theory | 2026-03-18 | Paper |
Improvements on permutation reconstruction from minors
Advances in Mathematics of Communications | 2026-02-26 | Paper |
Improved bounds for codes over trees
Designs, Codes and Cryptography | 2026-01-28 | Paper |
On supersaturation for oddtown and eventown
SIAM Journal on Discrete Mathematics | 2025-12-09 | Paper |
On low-power error-correcting cooling codes with large distances
IEEE Transactions on Information Theory | 2025-07-14 | Paper |
Separating hash families with large universe
Journal of Combinatorial Theory. Series A | 2025-06-25 | Paper |
Improved upper bounds for wide-sense frameproof codes
IEEE Transactions on Information Theory | 2025-01-23 | Paper |
Almost all even-particle pure states are determined by their half-body marginals
Journal of Physics A: Mathematical and Theoretical | 2024-12-06 | Paper |
Reconstruction of hypermatrices from subhypermatrices
Journal of Combinatorial Theory. Series A | 2024-11-13 | Paper |
Swap-robust and almost supermagic complete graphs for dynamical distributed storage
IEEE Transactions on Information Theory | 2024-07-23 | Paper |
Reconstruction of sequences distorted by two insertions
IEEE Transactions on Information Theory | 2024-07-18 | Paper |
Balanced reconstruction codes for single edits
Designs, Codes and Cryptography | 2024-06-28 | Paper |
Corrigendum: Super‐simple resolvable balanced incomplete block designs with block size 4 and index 2
Journal of Combinatorial Designs | 2024-02-02 | Paper |
Short k‐radius sequences, k‐difference sequences and universal cycles
Journal of Combinatorial Designs | 2024-01-31 | Paper |
| Swap-Robust and Almost Supermagic Complete Graphs for Dynamical Distributed Storage | 2023-10-30 | Paper |
| Separating hash families with large universe | 2023-10-30 | Paper |
Unextendible product operator basis
Journal of Mathematical Physics | 2023-03-29 | Paper |
| Reconstruction of Sequences Distorted by Two Insertions | 2023-02-20 | Paper |
Bounds on the number of mutually unbiased entangled bases
Quantum Information Processing | 2023-02-16 | Paper |
| On supersaturation for oddtown and eventown | 2023-02-10 | Paper |
Constructions of unextendible entangled bases
Quantum Information Processing | 2022-12-08 | Paper |
Strong quantum nonlocality for unextendible product bases in heterogeneous systems
Journal of Physics A: Mathematical and Theoretical | 2022-11-11 | Paper |
Sparse and Balanced MDS Codes Over Small Fields
IEEE Transactions on Information Theory | 2022-08-19 | Paper |
<i>k</i>-Uniform States in Heterogeneous Systems
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
Optimal Ternary Codes With Weight <i>w</i> and Distance 2<i>w</i> - 2 in ℓ<sub>1</sub>-Metric
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
New Results on Self-Dual Generalized Reed-Solomon Codes
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
Bollobás-type theorems for hemi-bundled two families
European Journal of Combinatorics | 2022-01-07 | Paper |
Optimal Codes With Small Constant Weight in <i>ℓ</i>₁-Metric
IEEE Transactions on Information Theory | 2021-07-23 | Paper |
Optimal Fraction Repetition Codes for Access-Balancing in Distributed Storage
IEEE Transactions on Information Theory | 2021-07-22 | Paper |
New optimal error-correcting codes for crosstalk avoidance in on-chip data buses
Advances in Mathematics of Communications | 2021-05-12 | Paper |
Some New Results on Splitter Sets
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
Covering radius of permutation groups with infinity-norm
Discrete Mathematics | 2020-02-20 | Paper |
Burst-deletion-correcting codes for permutations and multipermutations
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Suitable sets of permutations, packings of triples, and Ramsey's theorem
European Journal of Combinatorics | 2019-11-28 | Paper |
Constructions of unextendible entangled bases
(available as arXiv preprint) | 2019-06-25 | Paper |
| Repairing Generalized Reed-Muller Codes | 2019-06-24 | 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 |
Constructions of Optimal and Near-Optimal Multiply Constant-Weight Codes
IEEE Transactions on Information Theory | 2018-09-19 | Paper |
Optimal <inline-formula> <tex-math notation="LaTeX">$q$ </tex-math> </inline-formula>-Ary Error Correcting/All Unidirectional Error Detecting Codes
IEEE Transactions on Information Theory | 2018-09-19 | Paper |
Splitter Sets and $k$ -Radius Sequences
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Linear Size Constant-Composition Codes Meeting the Johnson Bound
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Optimal codes in the Enomoto-Katona space
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
Optimal Ternary Constant-Weight Codes With Weight 4 and Distance 5
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Improved Constructions of Frameproof Codes
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Multiply Constant-Weight Codes and the Reliability of Loop Physically Unclonable Functions
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
On the List-Decodability of Random Self-Orthogonal Codes
IEEE Transactions on Information Theory | 2017-04-28 | 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 |
The Order of Automorphisms of Quasigroups
Journal of Combinatorial Designs | 2015-08-11 | Paper |
Hanani triple packings and optimal \(q\)-ary codes of constant weight three
Designs, Codes and Cryptography | 2015-05-21 | Paper |
Transversals of Latin squares and covering radius of sets of permutations
European Journal of Combinatorics | 2014-07-29 | Paper |
On the existence of retransmission permutation arrays
Discrete Applied Mathematics | 2014-04-10 | Paper |
A new existence proof for Steiner quadruple systems
Designs, Codes and Cryptography | 2013-07-26 | Paper |
Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences
Mathematics of Computation | 2012-02-17 | Paper |
Optimal constant weight covering codes and nonuniform group divisible 3-designs with block size four
Designs, Codes and Cryptography | 2012-02-15 | Paper |
Strongly regular graphs constructed from \(p\)-ary bent functions
Journal of Algebraic Combinatorics | 2011-11-07 | Paper |
The \(\alpha \)-arboricity of complete uniform hypergraphs
SIAM Journal on Discrete Mathematics | 2011-10-27 | Paper |
Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher order
Advances in Mathematics of Communications | 2011-05-17 | Paper |
H-designs with the properties of resolvability or (1, 2)-resolvability
Designs, Codes and Cryptography | 2010-10-13 | Paper |
Maximal resolvable packings and minimal resolvable coverings of triples by quadruples
Journal of Combinatorial Designs | 2010-08-03 | Paper |
On block sequences of Steiner quadruple systems with error correcting consecutive unions
SIAM Journal on Discrete Mathematics | 2010-06-01 | Paper |
Combinatorial constructions of fault-tolerant routings with levelled minimum optical indices
Discrete Applied Mathematics | 2010-05-25 | Paper |
Existence of resolvable H-designs with group sizes 2, 3, 4 and 6
Designs, Codes and Cryptography | 2010-03-26 | Paper |
On the existence of partitionable skew Room frames
Discrete Mathematics | 2007-11-27 | Paper |
Existence of \(Z\)-cyclic 3PDTWh(\(p\)) for prime \(p \equiv 1\pmod4\)
Designs, Codes and Cryptography | 2007-09-20 | Paper |
Super‐simple resolvable balanced incomplete block designs with block size 4 and index 2
Journal of Combinatorial Designs | 2007-07-30 | Paper |
Reconstruction of hypermatrices from subhypermatrices
(available as arXiv preprint) | N/A | Paper |
Improved upper bounds for wide-sense frameproof codes
(available as arXiv preprint) | N/A | Paper |
On set systems with strongly restricted intersections
(available as arXiv preprint) | N/A | Paper |
