| Publication | Date of Publication | Type |
|---|
Thermal-aware communication
IEEE Transactions on Information Theory | 2025-07-14 | Paper |
Minimally Modified Balanced Codes
IEEE Transactions on Information Theory | 2024-03-14 | Paper |
A New Detection Method for Noisy Channels With Time-Varying Offset
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
Necessary and sufficient conditions on block codes correcting/detecting errors of various types
IEEE Transactions on Computers | 2018-09-14 | Paper |
Secure Transmission on the Two-Hop Relay Channel With Scaled Compute-and-Forward
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Prefixless $q$ -Ary Balanced Codes With Fast Syndrome-Based Error Correction
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Knuth's Balanced Codes Revisited
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Line and Lattice Networks Under Deterministic Interference Models
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Error-Correcting Balanced Knuth Codes
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Parity-Check Matrices Separating Erasures From Errors
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Minimum Pearson Distance Detection for Multilevel Channels With Gain and/or Offset Mismatch
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Random Access With Physical-Layer Network Coding
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Pearson Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff
Problems of Information Transmission | 2013-04-03 | Paper |
Results on Parity-Check Matrices With Optimal Stopping And/Or Dead-End Set Enumerators
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Complete Enumeration of Stopping Sets of Full-Rank Parity-Check Matrices of Hamming Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Limited-trial chase decoding
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Limited-Trial Chase-Like Algorithms Achieving Bounded-Distance Decoding
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Reduced GMD decoding
IEEE Transactions on Information Theory | 2005-06-01 | Paper |
Constructing efficient DC-free runlength-limited block codes for recording channels
IEEE Transactions on Information Theory | 2002-10-30 | Paper |
Guaranteed error correction rate for a simple concatenated coding scheme with single-trial decoding
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
Codes for multiple localized burst error correction
IEEE Transactions on Information Theory | 1999-11-24 | Paper |
Constrained block codes for class-IV partial-response channels with maximum-likelihood sequence estimation
IEEE Transactions on Information Theory | 1997-11-11 | Paper |
Analysis of coding schemes for modulation and error control
IEEE Transactions on Information Theory | 1996-06-04 | Paper |
Asymptotic results on codes for symmetric, unidirectional, and asymmetric error control
IEEE Transactions on Information Theory | 1995-11-09 | Paper |
Construction and evaluation of trellis-coded quantizers for memoryless sources
IEEE Transactions on Information Theory | 1995-06-21 | Paper |
Cascading runlength-limited sequences
IEEE Transactions on Information Theory | 1995-03-15 | Paper |
Construction of systematic codes for unidirectional error control
IEEE Transactions on Computers | 1995-01-01 | Paper |
| scientific article; zbMATH DE number 515904 (Why is no real title available?) | 1994-03-10 | Paper |
Adaptive channel error protection of subband encoded images
IEEE Transactions on Communications | 1993-12-06 | Paper |
| scientific article; zbMATH DE number 4207992 (Why is no real title available?) | 1991-01-01 | Paper |
Bounds and constructions for codes correcting unidirectional errors
IEEE Transactions on Information Theory | 1989-01-01 | Paper |
Bounds and constructions for binary codes of length less than 24 and asymmetric distance less than 6
IEEE Transactions on Information Theory | 1989-01-01 | Paper |
New upper bounds on the size of codes correcting asymmetric errors (Corresp.)
IEEE Transactions on Information Theory | 1987-01-01 | Paper |
