| Publication | Date of Publication | Type |
|---|
Pairs in nested Steiner quadruple systems
Journal of Combinatorial Designs | 2025-03-31 | Paper |
Gilbert-Varshamov bound for codes in L₁ metric using multivariate analytic combinatorics
IEEE Transactions on Information Theory | 2025-02-26 | Paper |
Recovery sets of subspaces from a simplex code
IEEE Transactions on Information Theory | 2025-01-23 | Paper |
Sequence reconstruction problem for deletion channels: a complete asymptotic solution
Journal of Combinatorial Theory. Series A | 2024-12-23 | Paper |
Efficient encoding of binary constant-weight codes: variable-length balancing schemes à la Knuth
IEEE Transactions on Information Theory | 2024-07-23 | Paper |
Explicit low-bandwidth evaluation schemes for weighted sums of Reed-Solomon-coded symbols
IEEE Transactions on Information Theory | 2024-07-23 | Paper |
Two-dimensional RC/SW constrained codes: bounded weight and almost balanced weight
IEEE Transactions on Information Theory | 2024-07-18 | Paper |
| Committed private information retrieval | 2024-06-05 | Paper |
Correcting Deletions With Multiple Reads
IEEE Transactions on Information Theory | 2024-03-14 | Paper |
Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions
Journal of Combinatorial Designs | 2024-02-02 | Paper |
On the number of distinct \(k\)-decks: enumeration and bounds
Advances in Mathematics of Communications | 2023-07-07 | Paper |
Domination mappings into the Hamming ball: existence, constructions, and algorithms
Advances in Mathematics of Communications | 2023-06-30 | Paper |
| Evaluation of the Gilbert-Varshamov Bound using Multivariate Analytic Combinatorics | 2023-05-07 | Paper |
| On the Design of Codes for DNA Computing: Secondary Structure Avoidance Codes | 2023-02-27 | Paper |
| Average Redundancy of Variable-Length Balancing Schemes \`{a} la Knuth | 2022-04-28 | Paper |
Coding for Sequence Reconstruction for Single Edits
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
Repairing Reed-Solomon Codes via Subspace Polynomials
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
Locally-Constrained de Bruijn Codes: Properties, Enumeration, Code Constructions, and Applications
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
| Sequence Reconstruction Problem for Deletion Channels: A Complete Asymptotic Solution | 2021-11-07 | Paper |
Correcting a Single Indel/Edit for DNA-Based Data Storage: Linear-Time Encoders and Order-Optimality
IEEE Transactions on Information Theory | 2021-07-23 | Paper |
| Computing Permanents on a Trellis | 2021-07-15 | Paper |
Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes Using Linear Programming
IEEE Transactions on Information Theory | 2021-02-22 | Paper |
Generalized Sphere-Packing Bound for Subblock-Constrained Codes
IEEE Transactions on Information Theory | 2021-02-22 | Paper |
Explicit and Efficient WOM Codes of Finite Length
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
Low-Power Cooling Codes With Efficient Encoding and Decoding
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
Efficient Encoding/Decoding of GC-Balanced Codes Correcting Tandem Duplications
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 |
Deciding the confusability of words under tandem repeats in linear time
ACM Transactions on Algorithms | 2019-11-25 | 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 |
Capacity-Achieving Codes That Mitigate Intercell Interference and Charge Leakage in Flash Memories
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 |
Coding for Racetrack Memories
IEEE Transactions on Information Theory | 2018-12-04 | Paper |
Constructions of Optimal and Near-Optimal Multiply Constant-Weight Codes
IEEE Transactions on Information Theory | 2018-09-19 | Paper |
Repairing Reed-Solomon Codes With Multiple Erasures
IEEE Transactions on Information Theory | 2018-09-19 | Paper |
Mutually Uncorrelated Primers for DNA-Based Data Storage
IEEE Transactions on Information Theory | 2018-09-19 | Paper |
Bounds on the Size and Asymptotic Rate of Subblock-Constrained Codes
IEEE Transactions on Information Theory | 2018-09-19 | Paper |
Cooling Codes: Thermal-Management Coding for High-Performance Interconnects
(available as arXiv preprint) | 2018-07-09 | Paper |
| scientific article; zbMATH DE number 6900640 (Why is no real title available?) | 2018-07-09 | Paper |
Rates of DNA Sequence Profiles for Practical Values of Read Lengths
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Asymmetric Lee Distance Codes for DNA-Based Storage
IEEE Transactions on Information Theory | 2017-10-19 | Paper |
Optimal codes in the Enomoto-Katona space
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
Switch Codes: Codes for Fully Parallel Reconstruction
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Cross-Bifix-Free Codes Within a Constant Factor of Optimality
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Maximum Distance Separable Codes for Symbol-Pair Read Channels
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Estimates on the Size of Symbol Weight 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 |
Codes for DNA Sequence Profiles
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Product construction of affine codes
SIAM Journal on Discrete Mathematics | 2015-09-02 | Paper |
Product construction of affine codes
SIAM Journal on Discrete Mathematics | 2015-09-02 | Paper |
| Locally Encodable and Decodable Codes for Distributed Storage Systems | 2015-04-19 | Paper |
| Codes for DNA Storage Channels | 2014-10-31 | Paper |
Generalized balanced tournament designs with block size four
The Electronic Journal of Combinatorics | 2014-08-14 | Paper |
Pure asymmetric quantum MDS codes from CSS construction: a complete characterization
International Journal of Quantum Information | 2013-08-28 | Paper |
A note on cyclic codes over \(\mathrm{GR}(p^{2},m)\) of length \(p^{k}\)
Designs, Codes and Cryptography | 2012-03-01 | Paper |
Cyclic codes over \(\text{GR}(p^2,m)\) of length \(p^k\)
Finite Fields and their Applications | 2008-08-27 | Paper |
Gilbert-Varshamov Bound for Codes in $L_1$ Metric using Multivariate Analytic Combinatorics
(available as arXiv preprint) | N/A | Paper |
Evaluating the Gilbert-Varshamov Bound for Constrained Systems
(available as arXiv preprint) | N/A | Paper |
