| Publication | Date of Publication | Type |
|---|
| Symplectically self-orthogonal additive codes and their applications to quantum stabilizer codes | 2025-10-15 | Paper |
Degree-\(M\) Bethe and Sinkhorn permanent based bounds on the permanent of a non-negative matrix
IEEE Transactions on Information Theory | 2024-07-23 | Paper |
Coding schemes based on Reed-Muller codes for \((d,\infty)\)-RLL input-constrained channels
IEEE Transactions on Information Theory | 2024-07-21 | Paper |
Secret key agreement via secure omniscience
IEEE Transactions on Information Theory | 2024-07-21 | Paper |
The secure storage capacity of a DNA wiretap channel model
IEEE Transactions on Information Theory | 2024-07-19 | Paper |
How many modes can a mixture of Gaussians with uniformly bounded means have?
Information and Inference: A Journal of the IMA | 2022-08-05 | Paper |
Computable Upper Bounds on the Capacity of Finite-State Channels
IEEE Transactions on Information Theory | 2021-09-07 | Paper |
| An Analysis of Probabilistic Forwarding of Coded Packets on Random Geometric Graphs | 2021-05-18 | Paper |
How Many Modes Can a Mixture of Gaussians with Uniformly Bounded Means Have?
(available as arXiv preprint) | 2020-05-04 | Paper |
| The Lattice Structure of Linear Subspace Codes | 2019-11-02 | Paper |
Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
Feedback capacity and coding for the BIBO channel with a no-repeated-ones input constraint
(available as arXiv preprint) | 2018-09-19 | Paper |
| Feedback capacity and coding for the BIBO channel with a no-repeated-ones input constraint | 2018-09-19 | Paper |
On the Optimality of Secret Key Agreement via Omniscience
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Some ``good'' properties of LDA lattices
Problems of Information Transmission | 2018-05-24 | Paper |
Data Synchronization With Timing: The Variable-Rate Case
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
On Minimal Tree Realizations of Linear Codes
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Coding for High-Density Recording on a 1-D Granular Magnetic Medium
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
The Treewidth of MDS and Reed–Muller Codes
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Phase transitions for the uniform distribution in the pattern maximum likelihood problem and its Bethe approximation
SIAM Journal on Discrete Mathematics | 2017-05-24 | Paper |
Upper Bounds on the Size of Grain-Correcting Codes
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Secure Compute-and-Forward in a Bidirectional Relay
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
The Feedback Capacity of the Binary Erasure Channel With a No-Consecutive-Ones Input Constraint
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
On the Public Communication Needed to Achieve SK Capacity in the Multiterminal Source Model
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
A comparative study of periods in a periodic-finite-type shift
SIAM Journal on Discrete Mathematics | 2010-08-27 | Paper |
A comparative study of periods in a periodic-finite-type shift
SIAM Journal on Discrete Mathematics | 2010-08-27 | Paper |
The effect of malformed tiles on tile assemblies within kTAM
Lecture Notes in Computer Science | 2010-01-07 | Paper |
Matroid Pathwidth and Code Trellis Complexity
SIAM Journal on Discrete Mathematics | 2009-03-16 | Paper |
A Decomposition Theory for Binary Linear Codes
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Sliding-Block Decodable Encoders Between<tex>$(d,k)$</tex>Runlength-Limited Constraints of Equal Capacity
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 |
Periodic prefix-synchronized codes: A generating function approach
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
| scientific article; zbMATH DE number 5268840 (Why is no real title available?) | 2008-04-29 | Paper |
The “Art of Trellis Decoding” Is NP-Hard
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes | 2008-04-17 | Paper |
An Application of Ramsey Theory to Coding for the Optical Channel
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Maximizing the Shannon Capacity of Constrained Systems with Two Constraints
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
Equalities among Capacities of (<i>d</i>,<i>k</i>)-Constrained Systems
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
Data synchronization with timing
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
On quantization with the Weaire-Phelan partition
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Degree-$M$ Bethe and Sinkhorn Permanent Based Bounds on the Permanent of a Non-negative Matrix
(available as arXiv preprint) | N/A | Paper |
