| Publication | Date of Publication | Type |
|---|
| Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions | 2024-02-02 | Paper |
| Scheduling to reduce close contacts: resolvable grid graph decomposition and packing | 2023-11-20 | Paper |
| Domination mappings into the Hamming ball: existence, constructions, and algorithms | 2023-06-30 | Paper |
| A new framework for deniable secure key exchange | 2022-06-08 | Paper |
| Endurance-Limited Memories: Capacity and Codes | 2022-05-30 | Paper |
| Locally-Constrained de Bruijn Codes: Properties, Enumeration, Code Constructions, and Applications | 2022-02-17 | Paper |
| Correcting a Single Indel/Edit for DNA-Based Data Storage: Linear-Time Encoders and Order-Optimality | 2021-07-23 | Paper |
| Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes Using Linear Programming | 2021-02-22 | Paper |
| Access balancing in storage systems by labeling partial Steiner systems | 2020-10-21 | Paper |
| Explicit and Efficient WOM Codes of Finite Length | 2020-09-29 | Paper |
| Low-Power Cooling Codes With Efficient Encoding and Decoding | 2020-09-29 | Paper |
| Efficient Encoding/Decoding of GC-Balanced Codes Correcting Tandem Duplications | 2020-09-29 | Paper |
| Efficient and Explicit Balanced Primer Codes | 2020-09-29 | Paper |
| Robust Positioning Patterns with Low Redundancy | 2020-03-25 | Paper |
| Burst-Deletion-Correcting Codes for Permutations and Multipermutations | 2020-01-28 | Paper |
| Deciding the Confusability of Words under Tandem Repeats in Linear Time | 2019-11-25 | Paper |
| Binary Robust Positioning Patterns with Low Redundancy and Efficient Locating Algorithms | 2019-10-15 | Paper |
| Capacity-Achieving Codes That Mitigate Intercell Interference and Charge Leakage in Flash Memories | 2019-07-19 | Paper |
| Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families | 2019-01-23 | Paper |
| Coding for Racetrack Memories | 2018-12-04 | Paper |
| Optimal <inline-formula> <tex-math notation="LaTeX">$q$ </tex-math> </inline-formula>-Ary Error Correcting/All Unidirectional Error Detecting Codes | 2018-09-19 | Paper |
| Constructions of Optimal and Near-Optimal Multiply Constant-Weight Codes | 2018-09-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4570855 | 2018-07-09 | Paper |
| Cooling Codes: Thermal-Management Coding for High-Performance Interconnects | 2018-07-09 | Paper |
| Linear Size Constant-Composition Codes Meeting the Johnson Bound | 2018-06-27 | Paper |
| Limit on the Addressability of Fault-Tolerant Nanowire Decoders | 2017-08-08 | Paper |
| Linear Size Optimal $q$-ary Constant-Weight Codes and Constant-Composition Codes | 2017-07-27 | Paper |
| Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization | 2017-07-27 | Paper |
| New Constant-Weight Codes From Propagation Rules | 2017-07-27 | Paper |
| On the Security of Index Coding With Side Information | 2017-07-12 | Paper |
| Error Correction for Index Coding With Side Information | 2017-06-08 | Paper |
| Estimates on the Size of Symbol Weight Codes | 2017-06-08 | Paper |
| Improved Constructions of Frameproof Codes | 2017-06-08 | Paper |
| Maximum Distance Separable Codes for Symbol-Pair Read Channels | 2017-06-08 | Paper |
| Upper Bounds on Matching Families in <formula formulatype="inline"> <tex Notation="TeX">$\BBZ_{pq}^{n}$</tex></formula> | 2017-06-08 | Paper |
| Cross-Bifix-Free Codes Within a Constant Factor of Optimality | 2017-06-08 | Paper |
| Multiply Constant-Weight Codes and the Reliability of Loop Physically Unclonable Functions | 2017-05-16 | Paper |
| Optimal Index Codes With Near-Extreme Rates | 2017-05-16 | Paper |
| Complexity of Dependences in Bounded Domains, Armstrong Codes, and Generalizations | 2017-04-28 | Paper |
| Optimal low-power coding for error correction and crosstalk avoidance in on-chip data buses | 2015-10-26 | Paper |
| Product Construction of Affine Codes | 2015-09-02 | Paper |
| Covering and packing for pairs | 2015-06-19 | Paper |
| Hanani triple packings and optimal \(q\)-ary codes of constant weight three | 2015-05-21 | Paper |
| Polynomial time algorithm for min-ranks of graphs with simple tree structures | 2015-03-02 | Paper |
| New Infinite Families of 2-Edge-Balanced Graphs | 2014-10-02 | Paper |
| Generalized balanced tournament designs with block size four | 2014-08-14 | Paper |
| Sequence Covering Arrays | 2014-04-10 | Paper |
| Query-efficient locally decodable codes of subexponential length | 2013-04-11 | Paper |
| Communication-efficient distributed oblivious transfer | 2012-08-17 | Paper |
| On the Bringer–Chabanne EPIR protocol for polynomial evaluation | 2012-03-22 | Paper |
| Arboricity: an acyclic hypergraph decomposition problem motivated by database theory | 2012-03-19 | Paper |
| Threshold changeable secret sharing schemes revisited | 2012-03-13 | Paper |
| Universal cycles for minimum coverings of pairs by triples, with application to 2-radius sequences | 2012-02-17 | Paper |
| Strongly regular graphs constructed from \(p\)-ary bent functions | 2011-11-07 | Paper |
| The α-Arboricity of Complete Uniform Hypergraphs | 2011-10-27 | Paper |
| List decodability at small radii | 2011-09-27 | Paper |
| Oblivious Transfer and n-Variate Linear Function Evaluation | 2011-08-17 | Paper |
| A pair of disjoint 3-gdds of type \(g^{t} u^{1}\) | 2011-06-03 | Paper |
| Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher order | 2011-05-17 | Paper |
| Spectrum of Sizes for Perfect Deletion-Correcting Codes | 2011-03-15 | Paper |
| Almost p-Ary Perfect Sequences | 2010-09-08 | Paper |
| The fine intersection problem for Steiner triple systems | 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 | 2009-03-09 | Paper |
| Improved Lower Bounds for Constant GC-Content DNA Codes | 2009-02-24 | Paper |
| The Sizes of Optimal $q$-Ary Codes of Weight Three and Distance Four: A Complete Solution | 2009-02-24 | Paper |
| Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three | 2009-02-24 | Paper |
| Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes | 2009-02-10 | Paper |
| Constructions for $q$-Ary Constant-Weight Codes | 2008-12-21 | Paper |
| An enumeration of graphical designs | 2008-11-19 | Paper |
| On Extremal k-Graphs Without Repeated Copies of 2-Intersecting Edges | 2008-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5463363 | 2005-08-04 | Paper |
| Steiner triple systems intersecting in pairwise disjoint blocks | 2004-10-13 | Paper |
| Uniform group divisible designs with block sizes three and \(n\) | 2003-03-25 | Paper |
| Highly symmetric expanders | 2002-09-30 | Paper |
| An improved finiteness theorem for graphical \(t\)-designs | 2002-03-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4486236 | 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. | 2000-01-01 | Paper |
| A few more large sets oft-designs | 1999-11-29 | Paper |
| Weakly union-free twofold triple systems | 1999-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4221641 | 1999-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4209618 | 1998-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4337355 | 1997-05-19 | Paper |
| Constructions for difference triangle sets | 1997-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4876960 | 1996-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4853750 | 1995-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4320683 | 1995-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4288167 | 1994-06-14 | Paper |
| Projective Covering Designs | 1994-05-03 | Paper |
| Single jog minimum area joining of compacted cells | 1993-11-15 | Paper |
| The existence of a simple 3-(28,5,30) design | 1993-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035719 | 1993-05-18 | Paper |
| Enumeration of small nonisomorphic 1-rotational twofold triple systems | 1993-04-01 | Paper |
| The algorithmic complexity of colour switching | 1993-01-17 | Paper |
| On graphical quintuple systems | 1993-01-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4014625 | 1992-10-18 | Paper |
| Graphical \(t\)-designs with block sizes three and four | 1992-06-28 | Paper |
| The 2-rotational Steiner triple systems of order 25 | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3197830 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5750865 | 1990-01-01 | Paper |
