| Publication | Date of Publication | Type |
|---|
| On the Size of Balls and Anticodes of Small Diameter Under the Fixed-Length Levenshtein Metric | 2024-03-19 | Paper |
| On Hierarchies of Balanced Sequences | 2024-03-19 | Paper |
| Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions | 2024-02-02 | Paper |
| Block‐avoiding point sequencings | 2024-02-02 | Paper |
| An improved recursive construction for disjoint Steiner quadruple systems | 2024-01-31 | Paper |
| Graphs with the unique path property: Structure, cycles, factors, and constructions | 2024-01-04 | Paper |
| Domination mappings into the Hamming ball: existence, constructions, and algorithms | 2023-06-30 | Paper |
| Permutations that separate close elements, and rectangle packings in the torus | 2023-06-06 | Paper |
| Perfect Codes and Related Structures | 2022-04-04 | Paper |
| Non-Binary Diameter Perfect Constant-Weight Codes | 2022-02-17 | Paper |
| Private Proximity Retrieval Codes | 2022-02-17 | Paper |
| Locally-Constrained de Bruijn Codes: Properties, Enumeration, Code Constructions, and Applications | 2022-02-17 | Paper |
| Large sets with multiplicity | 2021-06-24 | Paper |
| Network-Coding Solutions for Minimal Combination Networks and Their Sub-Networks | 2020-12-04 | Paper |
| Low-Power Cooling Codes With Efficient Encoding and Decoding | 2020-09-29 | Paper |
| Bounds on the Length of Functional PIR and Batch Codes | 2020-09-29 | Paper |
| Subspace packings: constructions and bounds | 2020-09-22 | Paper |
| PIR Array Codes With Optimal Virtual Server Rate | 2020-01-28 | Paper |
| PIR Schemes With Small Download Complexity and Low Storage Requirements | 2020-01-28 | Paper |
| Locality and Availability of Array Codes Constructed From Subspaces | 2019-07-19 | Paper |
| Grassmannian Codes With New Distance Measures for Network Coding | 2019-07-19 | Paper |
| Local Rank Modulation for Flash Memories | 2019-03-28 | Paper |
| UPP graphs and UMFA networks-architecture for parallel systems | 2018-09-14 | Paper |
| Regular graphs with forbidden subgraphs of \(K_n\) with \(k\) edges | 2018-08-24 | Paper |
| Cooling Codes: Thermal-Management Coding for High-Performance Interconnects | 2018-07-09 | Paper |
| Metrics Based on Finite Directed Graphs and Coding Invariants | 2018-06-27 | Paper |
| Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding | 2018-06-27 | Paper |
| Residual \(q\)-Fano planes and related structures | 2018-05-25 | Paper |
| A new approach for examining \(q\)-Steiner systems | 2018-05-25 | Paper |
| Properties of the Error Linear Complexity Spectrum | 2017-08-08 | Paper |
| Error-Correction of Multidimensional Bursts | 2017-08-08 | Paper |
| Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams | 2017-08-08 | Paper |
| On Row-by-Row Coding for 2-D Constraints | 2017-08-08 | Paper |
| Constructions of High-Rate Minimum Storage Regenerating Codes Over Small Fields | 2017-07-27 | Paper |
| Error-Correcting Codes in Projective Space | 2017-07-27 | Paper |
| Enumerative Coding for Grassmannian Space | 2017-07-27 | Paper |
| Distinct Difference Configurations: Multihop Paths and Key Predistribution in Sensor Networks | 2017-07-27 | Paper |
| Two-Dimensional Patterns With Distinct Differences—Constructions, Bounds, and Maximal Anticodes | 2017-07-27 | Paper |
| Simple and Robust Binary Self-Location Patterns | 2017-07-12 | Paper |
| Product Constructions for Perfect Lee Codes | 2017-07-12 | Paper |
| Sequence Folding, Lattice Tiling, and Multidimensional Coding | 2017-07-12 | Paper |
| Tilings With $n$-Dimensional Chairs and Their Applications to Asymmetric Codes | 2017-06-08 | Paper |
| Codes and Designs Related to Lifted MRD Codes | 2017-06-08 | Paper |
| The Asymptotic Behavior of Grassmannian Codes | 2017-06-08 | Paper |
| Coding for the Lee and Manhattan Metrics With Weighing Matrices | 2017-06-08 | Paper |
| Errata to “Codes and Designs Related to Lifted MRD Codes” [Feb 13 1004-1017] | 2017-06-08 | Paper |
| Constructions of Snake-in-the-Box Codes for Rank Modulation | 2017-05-16 | Paper |
| Systematic Error-Correcting Codes for Permutations and Multi-Permutations | 2017-04-28 | Paper |
| Optimal Ferrers Diagram Rank-Metric Codes | 2017-04-28 | Paper |
| Subspace Polynomials and Cyclic Subspace Codes | 2017-04-28 | Paper |
| Optimal Fractional Repetition Codes Based on Graphs and Designs | 2017-04-28 | Paper |
| Bounds on the Size of Permutation Codes With the Kendall <inline-formula> <tex-math notation="LaTeX">$\tau $ </tex-math></inline-formula>-Metric | 2017-04-28 | Paper |
| Binary Polarization Kernels From Code Decompositions | 2017-04-28 | Paper |
| EXISTENCE OF -ANALOGS OF STEINER SYSTEMS | 2017-04-04 | Paper |
| On the Structure of the $q$-Fano Plane | 2015-08-07 | Paper |
| Equidistant codes in the Grassmannian | 2015-05-22 | Paper |
| Partial ‐Parallelisms in Finite Projective Spaces | 2015-04-29 | Paper |
| Bounds on the Size of Permutation Codes with the Kendall $\tau$-Metric | 2014-08-21 | Paper |
| The \(q\)-analog of the middle levels problem | 2014-08-08 | Paper |
| Covering of subspaces by subspaces | 2014-06-27 | Paper |
| Tilings by $(0.5,n)$-Crosses and Perfect Codes | 2013-09-26 | Paper |
| Problems on q-Analogs in Coding Theory | 2013-05-27 | Paper |
| Linearity and complements in projective space | 2013-01-21 | Paper |
| Automorphisms of Codes in the Grassmann Scheme | 2012-10-21 | Paper |
| Some new distance-4 constant weight codes | 2011-11-03 | Paper |
| On \(q\)-analogs of Steiner systems and covering designs | 2011-08-10 | Paper |
| Large constant dimension codes and lexicodes | 2011-08-10 | Paper |
| Perfect Codes for Uniform Chains Poset Metrics | 2011-07-28 | Paper |
| New upper bounds on codes via association schemes and linear programming | 2011-03-10 | Paper |
| Traceability codes | 2010-09-27 | Paper |
| $q$-Analogs for Steiner Systems and Covering Designs | 2009-12-08 | Paper |
| Prolific Codes with the Identifiable Parent Property | 2009-11-27 | Paper |
| Problems on Two-Dimensional Synchronization Patterns | 2009-07-23 | Paper |
| Efficient Key Predistribution for Grid-Based Wireless Sensor Networks | 2009-01-09 | Paper |
| Quasi-Perfect Codes With Small Distance | 2008-12-21 | Paper |
| Zero/Positive Capacities of Two-Dimensional Runlength-Constrained Arrays | 2008-12-21 | Paper |
| Perfect Constant-Weight Codes | 2008-12-21 | Paper |
| Two-Dimensional Cluster-Correcting Codes | 2008-12-21 | Paper |
| The Positive Capacity Region of Two-Dimensional Run-Length-Constrained Channels | 2008-12-21 | Paper |
| On the Stopping Redundancy of Reed–Muller Codes | 2008-12-21 | Paper |
| A bound on the size of separating hash families | 2008-12-08 | Paper |
| Optimal doubly constant weight codes | 2008-03-20 | Paper |
| Single-Track Gray Codes and Sequences | 2008-03-07 | Paper |
| Configuration distribution and designs of codes in the Johnson scheme | 2007-01-24 | Paper |
| Optimal tristance anticodes in certain graphs | 2006-03-16 | Paper |
| On the Optimality of Coloring with a Lattice | 2005-09-16 | Paper |
| Improved upper bounds on sizes of codes | 2005-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4409684 | 2003-12-17 | Paper |
| Optimal 2-Dimensional 3-Dispersion Lattices | 2003-09-16 | Paper |
| Constructions for perfect 2-burst-correcting codes | 2002-08-04 | Paper |
| Two-dimensional interleaving schemes with repetitions: constructions and bounds | 2002-08-04 | Paper |
| Codes and anticodes in the Grassman graph | 2002-07-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2717201 | 2002-04-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2717200 | 2001-09-18 | Paper |
| Optimal codes for single-error correction, double-adjacent-error detection | 2001-03-19 | Paper |
| Optimal constant weight codes over \(Z_k\) and generalized designs | 2001-02-27 | Paper |
| Which codes have cycle-free Tanner graphs? | 2000-09-07 | Paper |
| The structure of single-track Gray codes | 2000-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4954416 | 2000-06-07 | Paper |
| Perfect byte-correcting codes | 1999-11-21 | Paper |
| Linear complexity of de Bruijn sequences-old and new results | 1999-11-21 | Paper |
| Efficient code constructions for certain two-dimensional constraints | 1999-11-21 | Paper |
| Efficient encoding algorithm for third-order spectral-null codes | 1999-05-26 | Paper |
| On threshold schemes from large sets | 1999-05-16 | Paper |
| Intersection of isomorphic linear codes | 1999-04-16 | Paper |
| Greedy and heuristic algorithms for codes and colorings | 1998-12-28 | Paper |
| On Perfect Codes and Tilings: Problems and Solutions | 1998-05-11 | Paper |
| Permutation polynomials, de Bruijn sequences, and linear complexity | 1997-10-01 | Paper |
| Cascading methods for runlength-limited arrays | 1997-08-26 | Paper |
| The depth distribution-a new characterization for linear codes | 1997-07-23 | Paper |
| Nonequivalent q-Ary Perfect Codes | 1997-07-13 | Paper |
| On the chromatic number, colorings, and codes of the Johnson graph | 1997-05-20 | Paper |
| Near optimal single-track Gray codes | 1997-03-16 | Paper |
| A method for constructing decodable de Bruijn sequences | 1996-10-22 | Paper |
| On the Nonexistence of Perfect Codes in the Johnson Scheme | 1996-06-30 | Paper |
| Large sets of coverings | 1996-03-11 | Paper |
| Perfect binary codes: constructions, properties, and enumeration | 1995-11-15 | Paper |
| Constructions for optimal constant weight cyclically permutable codes and difference families | 1995-11-06 | Paper |
| Bounds on the sizes of constant weight covering codes | 1995-07-20 | Paper |
| Normal and abnormal codes | 1994-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4288182 | 1994-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4279531 | 1994-02-17 | Paper |
| The last packing number of quadruples, and cyclic SQS | 1994-01-06 | Paper |
| Rotating-table games and derivatives of words | 1993-05-16 | Paper |
| Constructions for perfect mixed codes and other covering codes | 1993-05-16 | Paper |
| An explicit construction of Euler circuits in shuffle nets and related networks | 1993-01-17 | Paper |
| Connections between two cycles --- a new design of dense processor interconnection networks | 1993-01-16 | Paper |
| Optimal codes for correcting single errors and detecting adjacent errors | 1992-10-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4000781 | 1992-09-26 | Paper |
| Hamiltonian decomposition of \(K^*_ n\), patterns with distinct differences, and Tuscan squares | 1992-06-28 | Paper |
| Combinatorial designs with Costas arrays properties | 1992-06-28 | Paper |
| Optimal partitions for triples | 1992-06-28 | Paper |
| Partitions of triples into optimal packings | 1992-06-28 | Paper |
| New lower bounds for asymmetric and unidirectional codes | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974691 | 1992-06-25 | Paper |
| Towards a Large Set of Steiner Quadruple Systems | 1992-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3360185 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3476823 | 1990-01-01 | Paper |
| Constructions of error-correcting DC-free block codes | 1990-01-01 | Paper |
| Tuscan-K squares | 1989-01-01 | Paper |
| New lower bounds for constant weight codes | 1989-01-01 | Paper |
| Constructions for perfect maps and pseudorandom arrays | 1989-01-01 | Paper |
| Self-dual sequences | 1987-01-01 | Paper |
| An algorithm for generating shift-register cycles | 1986-01-01 | Paper |
| An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network | 1986-01-01 | Paper |
| An algorithm for constructing m-ary de Bruijn sequences | 1986-01-01 | Paper |
| On the distribution of de Bruijn sequences of low complexity | 1985-01-01 | Paper |
| Algorithms for the generation of full-length shift- register sequences | 1984-01-01 | Paper |
| On the distribution of de Bruijn sequences of given complexity | 1984-01-01 | Paper |
| Construction of de Bruijn sequences of minimal complexity | 1984-01-01 | Paper |
| Super-nets and their hierarchy | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3670578 | 1983-01-01 | Paper |
