| Publication | Date of Publication | Type |
|---|
| Competitive advantage of Huffman and Shannon-Fano codes | 2025-01-23 | Paper |
| Hexagonal Run-Length Zero Capacity Region—Part I: Analytical Proofs | 2022-02-17 | Paper |
| Hexagonal Run-Length Zero Capacity Region—Part II: Automated Proofs | 2022-02-17 | Paper |
| Capacity and Achievable Rate Regions for Linear Network Coding Over Ring Alphabets | 2019-01-18 | Paper |
| Linear Network Coding Over Rings – Part I: Scalar Codes and Commutative Alphabets | 2018-06-27 | Paper |
| Linear Network Coding Over Rings – Part II: Vector Codes and Non-Commutative Alphabets | 2018-06-27 | Paper |
| Network Coding for Computing: Cut-Set Bounds | 2017-07-27 | Paper |
| Linear Codes, Target Function Classes, and Network Computing Capacity | 2017-06-08 | Paper |
| A Class of Non-Linearly Solvable Networks | 2017-05-02 | Paper |
| Characteristic-Dependent Linear Rank Inequalities With Applications to Network Coding | 2017-04-28 | Paper |
| Achievable Rate Regions for Network Coding | 2017-04-28 | Paper |
| Network Coding Capacity With a Constrained Number of Coding Nodes | 2009-02-24 | Paper |
| Linear Network Codes and Systems of Polynomial Equations | 2009-02-24 | Paper |
| Linearity and Solvability in Multicast Networks | 2008-12-21 | Paper |
| Suboptimality of the Karhunen–LoÈve Transform for Transform Coding | 2008-12-21 | Paper |
| Networks, Matroids, and Non-Shannon Information Inequalities | 2008-12-21 | Paper |
| Network routing capacity | 2008-12-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3546817 | 2008-12-21 | Paper |
| Insufficiency of Linear Coding in Network Information Flow | 2008-12-21 | Paper |
| Nonreversibility and Equivalent Constructions of Multiple-Unicast Networks | 2008-12-21 | Paper |
| Quantization of Multiple Sources Using Nonnegative Integer Bit Allocation | 2008-12-21 | Paper |
| Almost all complete binary prefix codes have a self-synchronizing string | 2008-12-21 | Paper |
| Quantizers With Uniform Encoders and Channel Optimized Decoders | 2008-12-21 | Paper |
| Quantizers with uniform decoders and channel-optimized encoders | 2008-12-21 | Paper |
| Sufficient Conditions for Existence of Binary Fix-Free Codes | 2008-12-21 | Paper |
| Asymptotic capacity of two-dimensional channels with checkerboard constraints | 2008-12-21 | Paper |
| Bit-Stuffing Algorithms and Analysis for Run-Length Constrained Channels in Two and Three Dimensions | 2008-12-21 | Paper |
| Closest point search in lattices | 2005-05-11 | Paper |
| Gaussian source coding with spherical codes | 2005-05-11 | Paper |
| Progressive source coding for a power constrained Gaussian channel | 2003-03-30 | Paper |
| Capacity bounds for the three-dimensional (0,1) run length limited channel | 2002-12-17 | Paper |
| A table of upper bounds for binary codes | 2002-08-04 | Paper |
| Performance of quantizers on noisy channels using structured families of codes | 2001-03-19 | Paper |
| Upper bounds for constant-weight codes | 2001-03-19 | Paper |
| Source and channel rate allocation for channel codes satisfying the Gilbert-Varshamov or Tsfasman-Vlăduţ-Zink bounds | 2001-03-19 | Paper |
| Partial characterization of the positive capacity region of two-dimensional asymmetric run length constrained channels | 2001-03-19 | Paper |
| On source coding with side-information-dependent distortion measures | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4502632 | 2001-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4505580 | 2000-09-27 | Paper |
| On the rate-distortion function of random vectors and stationary sources with mixed distributions | 2000-09-07 | Paper |
| Zero capacity region of multidimensional run length constraints | 2000-01-16 | Paper |
| On the capacity of two-dimensional run-length constrained channels | 1999-11-21 | Paper |
| High-resolution source coding for non-difference distortion measures: multidimensional companding | 1999-11-21 | Paper |
| Universal bound on the performance of lattice codes | 1999-11-21 | Paper |
| Randomly chosen index assignments are asymptotically bad for uniform sources | 1999-11-21 | Paper |
| Binary lattice vector quantization with linear block codes and affine index assignments | 1999-02-10 | Paper |
| Asymptotically dense spherical codes. I. Wrapped spherical codes | 1999-01-26 | Paper |
| Asymptotically dense spherical codes .II. laminated spherical codes | 1999-01-26 | Paper |
| Existence of optimal prefix codes for infinite source alphabets | 1998-06-08 | Paper |
| Tradeoff between source and channel coding | 1998-04-22 | Paper |
| Improved bounds on maximum size binary radar arrays | 1997-10-28 | Paper |
| Empirical quantizer design in the presence of source noise or channel noise | 1997-06-10 | Paper |
| Concept learning using complexity regularization | 1996-09-01 | Paper |
| On the cost of finite block length in quantizing unbounded memoryless sources | 1996-07-28 | Paper |
| Fixed-rate universal lossy source coding and rates of convergence for memoryless sources | 1996-04-10 | Paper |
| Rates of convergence in the source coding theorem, in empirical quantizer design, and in universal lossy source coding | 1995-12-04 | Paper |
| Asymptotic bounds on optimal noisy channel quantization via random coding | 1995-11-09 | Paper |
| Nonparametric estimation via empirical risk minimization | 1995-08-21 | Paper |
| Number of nearest neighbors in a Euclidean code | 1995-03-01 | Paper |
| Asymptotic entropy-constrained performance of tessellating and universal randomized lattice quantization | 1994-11-28 | Paper |
| Corrected proof of de Buda's theorem (lattice channel codes) | 1994-10-03 | Paper |
| Average number of facets per cell in tree-structured vector quantizer partitions | 1994-02-07 | Paper |
