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