| Publication | Date of Publication | Type |
|---|
A deterministic algorithm for computing the weight distribution of polar code
IEEE Transactions on Information Theory | 2024-07-22 | Paper |
Tropical group testing
IEEE Transactions on Information Theory | 2024-07-19 | Paper |
Sub-4.7 scaling exponent of polar codes
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 |
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 |
Polar Codes for the Deletion Channel: Weak and Strong Polarization
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
Endurance-Limited Memories: Capacity and Codes
IEEE Transactions on Information Theory | 2022-05-30 | Paper |
Polar Coding for Channels With Deletions
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 |
Improved Schemes for Asymptotically Optimal Repair of MDS Codes
IEEE Transactions on Information Theory | 2021-09-07 | Paper |
Binary Linear Codes With Optimal Scaling: Polar Codes With Large Kernels
IEEE Transactions on Information Theory | 2021-09-07 | Paper |
Computing Permanents on a Trellis
| 2021-07-15 | 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 |
Probabilistic existence of large sets of designs
Journal of Combinatorial Theory. Series A | 2020-09-07 | Paper |
Algebraic List-Decoding in Projective Space: Decoding With Multiplicities and Rank-Metric Codes
IEEE Transactions on Information Theory | 2019-01-28 | Paper |
Coding for Racetrack Memories
IEEE Transactions on Information Theory | 2018-12-04 | Paper |
Cooling Codes: Thermal-Management Coding for High-Performance Interconnects
| 2018-07-09 | Paper |
Ordered binary decision diagrams and minimal trellises
IEEE Transactions on Computers | 2018-07-09 | Paper |
Minimum Storage Regenerating Codes for All Parameters
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Probabilistic existence of large sets of designs
| 2018-03-15 | Paper |
Error-Correcting Codes in Projective Space
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
The Re-Encoding Transformation in Algebraic List-Decoding of Reed–Solomon Codes
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
The Scientific Legacy of Ralf Koetter
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Multiple Error-Correcting WOM-Codes
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
New Bounds on the Capacity of Multidimensional Run-Length Constraints
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Algebraic List-Decoding of Subspace Codes
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
How to Construct Polar Codes
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Coding for the Lee and Manhattan Metrics With Weighing Matrices
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Codes for Write-Once Memories
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Rewriting Codes for Flash Memories
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
List Decoding of Polar Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Binary Polarization Kernels From Code Decompositions
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Generalized Sphere Packing Bound
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Existence of \(q\)-analogs of Steiner systems
Forum of Mathematics, Pi | 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\)
Journal of Combinatorial Theory. Series A | 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
Linear Algebra and its Applications | 2013-01-21 | Paper |
Automorphisms of Codes in the Grassmann Scheme
| 2012-10-21 | Paper |
Semantic security for the wiretap channel
Lecture Notes in Computer Science | 2012-09-25 | Paper |
On \(q\)-analogs of Steiner systems and covering designs
Advances in Mathematics of Communications | 2011-08-10 | Paper |
$q$-Analogs for Steiner Systems and Covering Designs
| 2009-12-08 | Paper |
Improved Probabilistic Bounds on Stopping Redundancy
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Maximum-Likelihood Decoding of Reed–Solomon Codes is NP-Hard
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Algebraic soft-decision decoding of reed-solomon codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Asymptotic Improvement of the Gilbert–Varshamov Bound on the Size of Binary Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
On the stopping distance and the stopping redundancy of codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
The structure of tail-biting trellises: Minimality and basic principles
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Nonlinear dynamics of iterative decoding systems: analysis and applications
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Coding for the optical channel: the ghost-pulse constraint
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Duality between packings and coverings of the Hamming space
Advances in Mathematics of Communications | 2007-04-05 | Paper |
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Lecture Notes in Computer Science | 2007-02-12 | Paper |
An Application of Ramsey Theory to Coding for the Optical Channel
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Optimal tristance anticodes in certain graphs
Journal of Combinatorial Theory. Series A | 2006-03-16 | Paper |
Closest point search in lattices
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
scientific article; zbMATH DE number 2154517 (Why is no real title available?)
| 2005-04-09 | Paper |
scientific article; zbMATH DE number 2147309 (Why is no real title available?)
IMRN. International Mathematics Research Notices | 2005-03-21 | Paper |
Resolving the Existence of Full-Rank Tilings of Binary Hamming Spaces
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
Full-Rank Tilings of $\mathbbF^8_\!2$ Do Not Exist
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
A table of upper bounds for binary codes
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
The turbo decoding algorithm and its phase trajectories
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Two-dimensional interleaving schemes with repetitions: constructions and bounds
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Signal-space characterization of iterative decoding
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
scientific article; zbMATH DE number 1756449 (Why is no real title available?)
| 2002-06-16 | Paper |
Upper bounds for constant-weight codes
IEEE Transactions on Information Theory | 2001-03-19 | Paper |
scientific article; zbMATH DE number 1559526 (Why is no real title available?)
| 2001-02-28 | Paper |
Which codes have cycle-free Tanner graphs?
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
Generalized minimum distance decoding in Euclidean space: performance analysis
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
scientific article; zbMATH DE number 1456831 (Why is no real title available?)
| 2000-06-07 | Paper |
scientific article; zbMATH DE number 1456829 (Why is no real title available?)
| 2000-06-07 | Paper |
The Parametrized Complexity of Some Fundamental Problems in Coding Theory
SIAM Journal on Computing | 2000-03-19 | Paper |
Minimal tail-biting trellises: the Golay code and more
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Universal bound on the performance of lattice codes
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
scientific article; zbMATH DE number 1284437 (Why is no real title available?)
| 1999-10-10 | Paper |
The intractability of computing the minimum distance of a code
IEEE Transactions on Information Theory | 1998-12-28 | Paper |
Interleaving schemes for multidimensional cluster errors
IEEE Transactions on Information Theory | 1998-10-27 | Paper |
Density doubling, double-circulants, and new sphere packings
Transactions of the American Mathematical Society | 1998-10-26 | Paper |
On Perfect Codes and Tilings: Problems and Solutions
SIAM Journal on Discrete Mathematics | 1998-05-11 | Paper |
Upper bounds on trellis complexity of lattices
IEEE Transactions on Information Theory | 1998-03-05 | Paper |
Generalized minimum-distance decoding of Euclidean-space codes and lattices
IEEE Transactions on Information Theory | 1997-12-02 | Paper |
Joint equalization and coding for intersymbol interference channels
IEEE Transactions on Information Theory | 1997-12-01 | Paper |
Proof of a conjecture of McEliece regarding the expansion index of the minimal trellis
IEEE Transactions on Information Theory | 1997-07-15 | Paper |
Lower bounds on trellis complexity of block codes
IEEE Transactions on Information Theory | 1997-04-02 | Paper |
Optimal sectionalization of a trellis
IEEE Transactions on Information Theory | 1997-03-16 | Paper |
Conservative arrays: multidimensional modulation codes for holographic recording
IEEE Transactions on Information Theory | 1996-12-01 | Paper |
Tilings of Binary Spaces
SIAM Journal on Discrete Mathematics | 1996-11-20 | Paper |
MDS array codes with independent parity symbols
IEEE Transactions on Information Theory | 1996-07-28 | Paper |
Two new bounds on the size of binary codes with a minimum distance of three
Designs, Codes and Cryptography | 1996-04-22 | Paper |
Even more efficient bounded-distance decoding of the hexacode, the Golay code, and the Leech lattice
IEEE Transactions on Information Theory | 1996-04-15 | Paper |
Asymptotically good codes have infinite trellis complexity
IEEE Transactions on Information Theory | 1995-12-17 | Paper |
Perfect binary codes: constructions, properties, and enumeration
IEEE Transactions on Information Theory | 1995-11-15 | Paper |
High-order spectral-null codes-constructions and bounds
IEEE Transactions on Information Theory | 1995-11-09 | Paper |
A new sphere packing in 20 dimensions
Inventiones Mathematicae | 1995-08-13 | Paper |
The uniqueness of the Best code
IEEE Transactions on Information Theory | 1995-03-01 | Paper |
The Nordstrom-Robinson code: representation over GF(4) and efficient decoding
IEEE Transactions on Information Theory | 1995-03-01 | Paper |
The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions
IEEE Transactions on Information Theory | 1995-03-01 | Paper |
Maximum-likelihood soft decision decoding of BCH codes
IEEE Transactions on Information Theory | 1994-10-10 | Paper |
Maximum likelihood decoding of the Leech lattice
IEEE Transactions on Information Theory | 1994-10-04 | Paper |
scientific article; zbMATH DE number 503208 (Why is no real title available?)
| 1994-02-17 | Paper |
Bit-level soft-decision decoding of Reed-Solomon codes
IEEE Transactions on Communications | 1992-06-27 | Paper |
On the problem of finding zero-concurring codewords
IEEE Transactions on Information Theory | 1991-01-01 | Paper |
Bounds on the dimension of codes and subcodes with prescribed contraction index
Linear Algebra and its Applications | 1990-01-01 | Paper |
