| Publication | Date of Publication | Type |
|---|
Recovery sets of subspaces from a simplex code
IEEE Transactions on Information Theory | 2025-01-23 | Paper |
Federated best arm identification with heterogeneous clients
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 |
Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions
Journal of Combinatorial Designs | 2024-02-02 | Paper |
Scheduling to reduce close contacts: resolvable grid graph decomposition and packing
Designs, Codes and Cryptography | 2023-11-20 | Paper |
Domination mappings into the Hamming ball: existence, constructions, and algorithms
Advances in Mathematics of Communications | 2023-06-30 | Paper |
A new framework for deniable secure key exchange
Information and Computation | 2022-06-08 | Paper |
Endurance-Limited Memories: Capacity and Codes
IEEE Transactions on Information Theory | 2022-05-30 | Paper |
Locally-Constrained de Bruijn Codes: Properties, Enumeration, Code Constructions, and Applications
IEEE Transactions on Information Theory | 2022-02-17 | 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 |
Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes Using Linear Programming
IEEE Transactions on Information Theory | 2021-02-22 | Paper |
Access balancing in storage systems by labeling partial Steiner systems
Designs, Codes and Cryptography | 2020-10-21 | 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 |
Burst-deletion-correcting codes for permutations and multipermutations
IEEE Transactions on Information Theory | 2020-01-28 | 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 |
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 |
Cooling Codes: Thermal-Management Coding for High-Performance Interconnects
| 2018-07-09 | Paper |
scientific article; zbMATH DE number 6900640 (Why is no real title available?)
| 2018-07-09 | Paper |
Linear Size Constant-Composition Codes Meeting the Johnson Bound
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Limit on the Addressability of Fault-Tolerant Nanowire Decoders
IEEE Transactions on Computers | 2017-08-08 | Paper |
Linear Size Optimal $q$-ary Constant-Weight Codes and Constant-Composition Codes
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
New Constant-Weight Codes From Propagation Rules
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
On the Security of Index Coding With Side Information
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Cross-Bifix-Free Codes Within a Constant Factor of Optimality
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Upper Bounds on Matching Families in <formula formulatype="inline"> <tex Notation="TeX">$\BBZ_{pq}^{n}$</tex></formula>
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 |
Error Correction for Index Coding With Side Information
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Improved Constructions of Frameproof Codes
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 |
Optimal Index Codes With Near-Extreme Rates
IEEE Transactions on Information Theory | 2017-05-16 | 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 |
Product construction of affine codes
SIAM Journal on Discrete Mathematics | 2015-09-02 | Paper |
Covering and packing for pairs
Journal of Combinatorial Theory. Series A | 2015-06-19 | Paper |
Hanani triple packings and optimal \(q\)-ary codes of constant weight three
Designs, Codes and Cryptography | 2015-05-21 | Paper |
Polynomial time algorithm for min-ranks of graphs with simple tree structures
Algorithmica | 2015-03-02 | Paper |
New Infinite Families of 2-Edge-Balanced Graphs
Journal of Combinatorial Designs | 2014-10-02 | Paper |
Generalized balanced tournament designs with block size four
The Electronic Journal of Combinatorics | 2014-08-14 | Paper |
Sequence covering arrays
SIAM Journal on Discrete Mathematics | 2014-04-10 | Paper |
Query-efficient locally decodable codes of subexponential length
Computational Complexity | 2013-04-11 | Paper |
Communication-efficient distributed oblivious transfer
Journal of Computer and System Sciences | 2012-08-17 | Paper |
On the Bringer-Chabanne EPIR protocol for polynomial evaluation
Journal of Mathematical Cryptology | 2012-03-22 | Paper |
Arboricity: an acyclic hypergraph decomposition problem motivated by database theory
Discrete Applied Mathematics | 2012-03-19 | Paper |
Threshold changeable secret sharing schemes revisited
Theoretical Computer Science | 2012-03-13 | Paper |
Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences
Mathematics of Computation | 2012-02-17 | 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 |
List decodability at small radii
Designs, Codes and Cryptography | 2011-09-27 | Paper |
Oblivious transfer and \(n\)-variate linear function evaluation
Lecture Notes in Computer Science | 2011-08-17 | Paper |
A pair of disjoint 3-gdds of type \(g^{t} u^{1}\)
Designs, Codes and Cryptography | 2011-06-03 | Paper |
Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher order
Advances in Mathematics of Communications | 2011-05-17 | Paper |
Spectrum of sizes for perfect deletion-correcting codes
SIAM Journal on Discrete Mathematics | 2011-03-15 | Paper |
Almost p-Ary Perfect Sequences
Sequences and Their Applications – SETA 2010 | 2010-09-08 | Paper |
The fine intersection problem for Steiner triple systems
Graphs and Combinatorics | 2009-05-08 | Paper |
A New Lower Bound for A(17,6,6)
| 2009-05-06 | Paper |
Scalable Optimal Test Patterns for Crosstalk-induced Faults on Deep Submicron Global Interconnects
Coding and Cryptology | 2009-03-09 | Paper |
Improved Lower Bounds for Constant GC-Content DNA Codes
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
The Sizes of Optimal $q$-Ary Codes of Weight Three and Distance Four: A Complete Solution
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes
Advances in Cryptology - ASIACRYPT 2008 | 2009-02-10 | Paper |
Constructions for $q$-Ary Constant-Weight Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
An enumeration of graphical designs
Journal of Combinatorial Designs | 2008-11-19 | Paper |
On Extremal k-Graphs Without Repeated Copies of 2-Intersecting Edges
SIAM Journal on Discrete Mathematics | 2008-08-13 | Paper |
scientific article; zbMATH DE number 2192000 (Why is no real title available?)
| 2005-08-04 | Paper |
Steiner triple systems intersecting in pairwise disjoint blocks
The Electronic Journal of Combinatorics | 2004-10-13 | Paper |
Uniform group divisible designs with block sizes three and \(n\)
Graphs and Combinatorics | 2003-03-25 | Paper |
Highly symmetric expanders
Finite Fields and their Applications | 2002-09-30 | Paper |
An improved finiteness theorem for graphical \(t\)-designs
Discrete Mathematics | 2002-03-29 | Paper |
scientific article; zbMATH DE number 1465652 (Why is no real title available?)
| 2000-06-26 | Paper |
Combinatorial coverings from geometries over principal ideal rings
| 2000-06-07 | Paper |
Asymptotically optimal erasure-resilient codes for large disk arrays.
Discrete Applied Mathematics | 2000-01-01 | Paper |
A few more large sets oft-designs
| 1999-11-29 | Paper |
Weakly union-free twofold triple systems
Annals of Combinatorics | 1999-01-14 | Paper |
scientific article; zbMATH DE number 1234975 (Why is no real title available?)
| 1999-01-03 | Paper |
scientific article; zbMATH DE number 1203392 (Why is no real title available?)
| 1998-09-28 | Paper |
scientific article; zbMATH DE number 1011073 (Why is no real title available?)
| 1997-05-19 | Paper |
Constructions for difference triangle sets
IEEE Transactions on Information Theory | 1997-01-01 | Paper |
scientific article; zbMATH DE number 874522 (Why is no real title available?)
| 1996-05-06 | Paper |
scientific article; zbMATH DE number 812076 (Why is no real title available?)
| 1995-11-02 | Paper |
scientific article; zbMATH DE number 718671 (Why is no real title available?)
| 1995-06-11 | Paper |
scientific article; zbMATH DE number 554173 (Why is no real title available?)
| 1994-06-14 | Paper |
Projective Covering Designs
Bulletin of the London Mathematical Society | 1994-05-03 | Paper |
Single jog minimum area joining of compacted cells
Information Processing Letters | 1993-11-15 | Paper |
The existence of a simple 3-(28,5,30) design
Discrete Mathematics | 1993-10-17 | Paper |
scientific article; zbMATH DE number 176550 (Why is no real title available?)
| 1993-05-18 | Paper |
Enumeration of small nonisomorphic 1-rotational twofold triple systems
Mathematics of Computation | 1993-04-01 | Paper |
The algorithmic complexity of colour switching
Information Processing Letters | 1993-01-17 | Paper |
On graphical quintuple systems
Journal of Symbolic Computation | 1993-01-16 | Paper |
scientific article; zbMATH DE number 68916 (Why is no real title available?)
| 1992-10-18 | Paper |
The 2-rotational Steiner triple systems of order 25
Discrete Mathematics | 1992-06-28 | Paper |
Graphical \(t\)-designs with block sizes three and four
Discrete Mathematics | 1992-06-28 | Paper |
scientific article; zbMATH DE number 4185614 (Why is no real title available?)
| 1990-01-01 | Paper |
scientific article; zbMATH DE number 4172985 (Why is no real title available?)
| 1990-01-01 | Paper |
On the Asymptotic Nonnegative Rank of Matrices and its Applications in Information Theory
| N/A | Paper |
