| Publication | Date of Publication | Type |
|---|
| A deterministic algorithm for computing the weight distribution of polar code | 2024-07-22 | Paper |
| Tropical group testing | 2024-07-19 | Paper |
| Sub-4.7 scaling exponent of polar codes | 2024-07-18 | Paper |
| Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions | 2024-02-02 | Paper |
| On the number of distinct \(k\)-decks: enumeration and bounds | 2023-07-07 | Paper |
| Domination mappings into the Hamming ball: existence, constructions, and algorithms | 2023-06-30 | Paper |
| Polar Codes for the Deletion Channel: Weak and Strong Polarization | 2022-07-13 | Paper |
| Endurance-Limited Memories: Capacity and Codes | 2022-05-30 | Paper |
| Polar Coding for Channels With Deletions | 2022-02-17 | Paper |
| Locally-Constrained de Bruijn Codes: Properties, Enumeration, Code Constructions, and Applications | 2022-02-17 | Paper |
| Improved Schemes for Asymptotically Optimal Repair of MDS Codes | 2021-09-07 | Paper |
| Binary Linear Codes With Optimal Scaling: Polar Codes With Large Kernels | 2021-09-07 | Paper |
| Computing Permanents on a Trellis | 2021-07-15 | 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 |
| Probabilistic existence of large sets of designs | 2020-09-07 | Paper |
| Algebraic List-Decoding in Projective Space: Decoding With Multiplicities and Rank-Metric Codes | 2019-01-28 | Paper |
| Coding for Racetrack Memories | 2018-12-04 | Paper |
| Cooling Codes: Thermal-Management Coding for High-Performance Interconnects | 2018-07-09 | Paper |
| Ordered binary decision diagrams and minimal trellises | 2018-07-09 | Paper |
| Minimum Storage Regenerating Codes for All Parameters | 2018-06-27 | Paper |
| Probabilistic existence of large sets of designs | 2018-03-15 | Paper |
| Error-Correcting Codes in Projective Space | 2017-07-27 | Paper |
| The Re-Encoding Transformation in Algebraic List-Decoding of Reed–Solomon Codes | 2017-07-27 | Paper |
| The Scientific Legacy of Ralf Koetter | 2017-07-27 | Paper |
| Multiple Error-Correcting WOM-Codes | 2017-07-12 | Paper |
| Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes | 2017-07-12 | Paper |
| New Bounds on the Capacity of Multidimensional Run-Length Constraints | 2017-07-12 | Paper |
| Algebraic List-Decoding of Subspace Codes | 2017-06-08 | Paper |
| How to Construct Polar Codes | 2017-06-08 | Paper |
| Coding for the Lee and Manhattan Metrics With Weighing Matrices | 2017-06-08 | Paper |
| Codes for Write-Once Memories | 2017-06-08 | Paper |
| Rewriting Codes for Flash Memories | 2017-06-08 | Paper |
| List Decoding of Polar Codes | 2017-04-28 | Paper |
| Binary Polarization Kernels From Code Decompositions | 2017-04-28 | Paper |
| Generalized Sphere Packing Bound | 2017-04-28 | Paper |
| EXISTENCE OF -ANALOGS OF STEINER SYSTEMS | 2017-04-04 | Paper |
| Maximum-likelihood decoding of Reed-Solomon codes is NP-hard | 2014-10-13 | Paper |
| Nontrivial \(t\)-designs over finite fields exist for all \(t\) | 2014-09-08 | Paper |
| Asymptotic Improvement of the Gilbert-Varshamov Bound on the Size of Permutation Codes | 2013-11-19 | Paper |
| Linearity and complements in projective space | 2013-01-21 | Paper |
| Automorphisms of Codes in the Grassmann Scheme | 2012-10-21 | Paper |
| Semantic Security for the Wiretap Channel | 2012-09-25 | Paper |
| On \(q\)-analogs of Steiner systems and covering designs | 2011-08-10 | Paper |
| $q$-Analogs for Steiner Systems and Covering Designs | 2009-12-08 | Paper |
| Improved Probabilistic Bounds on Stopping Redundancy | 2009-02-24 | Paper |
| Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard | 2008-12-21 | Paper |
| Algebraic soft-decision decoding of reed-solomon codes | 2008-12-21 | Paper |
| Asymptotic Improvement of the Gilbert–Varshamov Bound on the Size of Binary Codes | 2008-12-21 | Paper |
| On the stopping distance and the stopping redundancy of codes | 2008-12-21 | Paper |
| The structure of tail-biting trellises: Minimality and basic principles | 2008-12-21 | Paper |
| Nonlinear dynamics of iterative decoding systems: analysis and applications | 2008-12-21 | Paper |
| Coding for the optical channel: the ghost-pulse constraint | 2008-12-21 | Paper |
| Duality between packings and coverings of the Hamming space | 2007-04-05 | Paper |
| Applied Algebra, Algebraic Algorithms and Error-Correcting Codes | 2007-02-12 | Paper |
| An Application of Ramsey Theory to Coding for the Optical Channel | 2006-06-01 | Paper |
| Optimal tristance anticodes in certain graphs | 2006-03-16 | Paper |
| Closest point search in lattices | 2005-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4665046 | 2005-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4658950 | 2005-03-21 | Paper |
| Resolving the Existence of Full-Rank Tilings of Binary Hamming Spaces | 2005-02-28 | Paper |
| Full-Rank Tilings of $\mathbbF^8_\!2$ Do Not Exist | 2004-01-08 | Paper |
| A table of upper bounds for binary codes | 2002-08-04 | Paper |
| The turbo decoding algorithm and its phase trajectories | 2002-08-04 | Paper |
| Two-dimensional interleaving schemes with repetitions: constructions and bounds | 2002-08-04 | Paper |
| Signal-space characterization of iterative decoding | 2002-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535935 | 2002-06-16 | Paper |
| Upper bounds for constant-weight codes | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526974 | 2001-02-28 | Paper |
| Which codes have cycle-free Tanner graphs? | 2000-09-07 | Paper |
| Generalized minimum distance decoding in Euclidean space: performance analysis | 2000-09-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4954431 | 2000-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4954428 | 2000-06-07 | Paper |
| The Parametrized Complexity of Some Fundamental Problems in Coding Theory | 2000-03-19 | Paper |
| Minimal tail-biting trellises: the Golay code and more | 1999-11-21 | Paper |
| Universal bound on the performance of lattice codes | 1999-11-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4242031 | 1999-10-10 | Paper |
| The intractability of computing the minimum distance of a code | 1998-12-28 | Paper |
| Interleaving schemes for multidimensional cluster errors | 1998-10-27 | Paper |
| Density doubling, double-circulants, and new sphere packings | 1998-10-26 | Paper |
| On Perfect Codes and Tilings: Problems and Solutions | 1998-05-11 | Paper |
| Upper bounds on trellis complexity of lattices | 1998-03-05 | Paper |
| Generalized minimum-distance decoding of Euclidean-space codes and lattices | 1997-12-02 | Paper |
| Joint equalization and coding for intersymbol interference channels | 1997-12-01 | Paper |
| Proof of a conjecture of McEliece regarding the expansion index of the minimal trellis | 1997-07-15 | Paper |
| Lower bounds on trellis complexity of block codes | 1997-04-02 | Paper |
| Optimal sectionalization of a trellis | 1997-03-16 | Paper |
| Conservative arrays: multidimensional modulation codes for holographic recording | 1996-12-01 | Paper |
| Tilings of Binary Spaces | 1996-11-20 | Paper |
| MDS array codes with independent parity symbols | 1996-07-28 | Paper |
| Two new bounds on the size of binary codes with a minimum distance of three | 1996-04-22 | Paper |
| Even more efficient bounded-distance decoding of the hexacode, the Golay code, and the Leech lattice | 1996-04-15 | Paper |
| Asymptotically good codes have infinite trellis complexity | 1995-12-17 | Paper |
| Perfect binary codes: constructions, properties, and enumeration | 1995-11-15 | Paper |
| High-order spectral-null codes-constructions and bounds | 1995-11-09 | Paper |
| A new sphere packing in 20 dimensions | 1995-08-13 | Paper |
| The uniqueness of the Best code | 1995-03-01 | Paper |
| The Nordstrom-Robinson code: representation over GF(4) and efficient decoding | 1995-03-01 | Paper |
| The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions | 1995-03-01 | Paper |
| Maximum-likelihood soft decision decoding of BCH codes | 1994-10-10 | Paper |
| Maximum likelihood decoding of the Leech lattice | 1994-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4279531 | 1994-02-17 | Paper |
| Bit-level soft-decision decoding of Reed-Solomon codes | 1992-06-27 | Paper |
| On the problem of finding zero-concurring codewords | 1991-01-01 | Paper |
| Bounds on the dimension of codes and subcodes with prescribed contraction index | 1990-01-01 | Paper |
