| Publication | Date of Publication | Type |
|---|
Combinatorial alphabet-dependent bounds for insdel codes
IEEE Transactions on Information Theory | 2025-07-11 | Paper |
Linearized Reed-Solomon codes with support-constrained generator matrix and applications in multi-source network coding
IEEE Transactions on Information Theory | 2025-02-27 | Paper |
Reconstruction from noisy substrings
IEEE Transactions on Information Theory | 2025-01-23 | Paper |
Multiple-error-correcting codes for analog computing on resistive crossbars
IEEE Transactions on Information Theory | 2025-01-23 | Paper |
Bounds on the minimum field size of network MDS codes
IEEE Transactions on Information Theory | 2024-07-23 | Paper |
Robust network function computation
IEEE Transactions on Information Theory | 2024-07-21 | Paper |
Perfect Codes Correcting a Single Burst of Limited-Magnitude Errors
IEEE Transactions on Information Theory | 2024-03-18 | Paper |
Sequence Reconstruction for Limited-Magnitude Errors
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
On the Generalized Covering Radii of Reed-Muller Codes
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
Nearly Optimal Robust Positioning Patterns
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
Improved Coding Over Sets for DNA-Based Data Storage
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
On tilings of asymmetric limited-magnitude balls
European Journal of Combinatorics | 2022-01-07 | Paper |
On Lattice Packings and Coverings of Asymmetric Limited-Magnitude Balls
IEEE Transactions on Information Theory | 2021-09-07 | Paper |
On the Gap Between Scalar and Vector Solutions of Generalized Combination Networks
IEEE Transactions on Information Theory | 2021-09-07 | Paper |
Low-Power Cooling Codes With Efficient Encoding and Decoding
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
Efficient and Explicit Balanced Primer Codes
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
Robust positioning patterns with low redundancy
SIAM Journal on Computing | 2020-03-25 | Paper |
On Private Information Retrieval Array Codes
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Burst-deletion-correcting codes for permutations and multipermutations
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
| On the Gap between Scalar and Vector Solutions of Generalized Combination Networks | 2020-01-13 | Paper |
Binary robust positioning patterns with low redundancy and efficient locating algorithms
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
| scientific article; zbMATH DE number 6900640 (Why is no real title available?) | 2018-07-09 | Paper |
Group divisible covering designs with block size four
Journal of Combinatorial Designs | 2018-05-22 | Paper |
Directed PBDs with Block Sizes from K Where K
Journal of Combinatorial Designs | 2018-01-05 | Paper |
A strengthened inequality of Alon-Babai-Suzuki's conjecture on set systems with restricted intersections modulo \(p\)
Discrete Mathematics | 2017-10-24 | Paper |
Some more uniformly resolvable designs with block sizes 2 and 4
Discrete Mathematics | 2017-06-23 | Paper |
New Bounds and Constructions for Multiply Constant-Weight Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Generic constructions for partitioned difference families with applications: a unified combinatorial approach
Designs, Codes and Cryptography | 2017-02-17 | Paper |
A new construction of group divisible designs with nonuniform group type
Journal of Combinatorial Designs | 2016-08-30 | Paper |
The existence of well-balanced triple systems
Journal of Combinatorial Designs | 2016-05-24 | Paper |
Optimal Groomings with Grooming Ratios Six and Seven
Journal of Combinatorial Designs | 2016-01-29 | Paper |
Uniformly resolvable designs with block sizes 3 and 4
Discrete Mathematics | 2015-12-17 | Paper |
Completely reducible super-simple designs with block size five and index two
Designs, Codes and Cryptography | 2015-09-01 | Paper |
A Complete Solution to Spectrum Problem for Five‐Vertex Graphs with Application to Traffic Grooming in Optical Networks
Journal of Combinatorial Designs | 2015-06-19 | Paper |
Spectrum of sizes for perfect 2-deletion-correcting codes of length 4
Designs, Codes and Cryptography | 2015-01-23 | Paper |
Group divisible designs with block size four and group type \(g^um^1\)
Designs, Codes and Cryptography | 2015-01-23 | Paper |
Optimal ternary constant-composition codes with weight four and distance six
Discrete Mathematics | 2014-12-19 | Paper |
Some more 5-GDDs, 4-frames and 4-RGDDs
Discrete Mathematics | 2014-09-04 | Paper |
Kirkman frames having hole type \(h^um^1\) for \(h\equiv\mathrm{mod}\,12\)
Designs, Codes and Cryptography | 2014-07-03 | Paper |
Group divisible designs with block sizes from \(K_{1(3)}\) and Kirkman frames of type \(h^u m^1\)
Discrete Mathematics | 2014-06-25 | Paper |
Group divisible designs with block size four and group type \(g^u m^1\) for \(g \equiv 0 \bmod 6\)
Journal of Combinatorial Designs | 2014-04-04 | Paper |
Group divisible designs with block size four and group type \(g^um^1\) for more small \(g\)
Discrete Mathematics | 2014-01-23 | Paper |
Multiple-Error-Correcting Codes for Analog Computing on Resistive Crossbars
(available as arXiv preprint) | N/A | Paper |
