| Publication | Date of Publication | Type |
|---|
Multiple-error-correcting codes for analog computing on resistive crossbars
IEEE Transactions on Information Theory | 2025-01-23 | Paper |
Corrections to “Analog Error-Correcting Codes”
IEEE Transactions on Information Theory | 2024-03-21 | Paper |
Higher-Order MDS Codes
IEEE Transactions on Information Theory | 2024-03-14 | Paper |
Asymptotic Bounds on the Rate of Locally Repairable Codes
IEEE Transactions on Information Theory | 2022-05-30 | Paper |
Variable-Length Constrained Coding and Kraft Conditions: The Parity-Preserving Case
IEEE Transactions on Information Theory | 2021-09-07 | Paper |
On Bi-Modal Constrained Coding
IEEE Transactions on Information Theory | 2021-07-22 | Paper |
On the number of factorizations of polynomials over finite fields
Journal of Combinatorial Theory. Series A | 2021-06-30 | Paper |
Analog Error-Correcting Codes
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
On the Pointwise Threshold Behavior of the Binary Erasure Polarization Subchannels
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
On Spectral Design Methods for Quasi-Cyclic Codes
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
Fault-Tolerant Dot-Product Engines
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
Construction of Sidon spaces with applications to coding
IEEE Transactions on Information Theory | 2018-09-14 | Paper |
On Decoding Rank-Metric Codes Over Large Fields
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
On Row-by-Row Coding for 2-D Constraints
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
List Decoding of Burst Errors
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Single-Exclusion Number and the Stopping Redundancy of MDS Codes
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Bounds on the Rate of 2-D Bit-Stuffing Encoders
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Two-Dimensional Constrained Coding Based on Tiling
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
On the Capacity of Generalized Ising Channels
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Convex Programming Upper Bounds on the Capacity of 2-D Constraints
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Low Complexity Two-Dimensional Weight-Constrained Codes
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Two-Dimensional Maximum-Likelihood Sequence Detection Is NP Hard
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Burst List Decoding of Interleaved Reed–Solomon Codes
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Coding for Combined Block–Symbol Error Correction
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Bounds and Constructions for Granular Media Coding
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Long Cyclic Codes Over GF(4) and GF(8) Better Than BCH Codes in the High-Rate Region
IEEE Transactions on Information Theory | 2017-05-02 | Paper |
New Bounds and Constructions for Granular Media Coding
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Asymptotic enumeration of binary matrices with bounded row and column sums
SIAM Journal on Discrete Mathematics | 2013-04-09 | Paper |
On linear balancing sets
Advances in Mathematics of Communications | 2011-06-03 | Paper |
Probabilistic algorithm for finding roots of linearized polynomials
Designs, Codes and Cryptography | 2009-03-31 | Paper |
On the Hardness of Decoding the Gale–Berlekamp Code
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Lowest density MDS codes over extension alphabets
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Improved Nearly-MDS Expander Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Bounds for Binary Codes With Narrow Distance Distributions
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Improved Bit-Stuffing Bounds on Two-Dimensional Constraints
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Symbol-Intersecting Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
| Introduction to Coding Theory | 2006-03-29 | Paper |
Parallel constrained coding with application to two-dimensional constraints
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
Independent Sets in Regular Hypergraphs and Multidimensional Runlength-Limited Constraints
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
Bounds on the List-Decoding Radius of Reed--Solomon Codes
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
Lossless sliding-block compression of constrained systems
IEEE Transactions on Information Theory | 2002-08-15 | Paper |
Lower bounds on the anticipation of encoders for input-constrained channels
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Efficient coding schemes for the hard-square model
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Nested block decodable runlength-limited codes
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
| scientific article; zbMATH DE number 1284433 (Why is no real title available?) | 2002-01-31 | Paper |
On runlength-limited coding with DC control
IEEE Transactions on Communications | 2001-09-04 | Paper |
Efficient decoding of Reed-Solomon codes beyond half the minimum distance
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
Two-dimensional weight-constrained codes through enumeration bounds
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
Nested input-constrained codes
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
| scientific article; zbMATH DE number 837784 (Why is no real title available?) | 2000-08-03 | Paper |
| scientific article; zbMATH DE number 1456820 (Why is no real title available?) | 2000-06-07 | Paper |
On lowest density MDS codes
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Efficient code constructions for certain two-dimensional constraints
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Hierarchical guessing with a fidelity criterion
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Reduced-redundancy product codes for burst error correction
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Efficient encoding algorithm for third-order spectral-null codes
IEEE Transactions on Information Theory | 1999-05-26 | Paper |
Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
SIAM Journal on Computing | 1998-09-20 | Paper |
Is code equivalence easy to decide?
IEEE Transactions on Information Theory | 1998-04-13 | Paper |
Spectral-null codes and null spaces of Hadamard submatrices
Designs, Codes and Cryptography | 1998-01-22 | Paper |
Probabilistic crisscross error correction
IEEE Transactions on Information Theory | 1998-01-21 | Paper |
Tensor codes for the rank metric
IEEE Transactions on Information Theory | 1997-11-13 | Paper |
On the decoding delay of encoders for input-constrained channels
IEEE Transactions on Information Theory | 1997-08-26 | Paper |
Location-correcting codes
IEEE Transactions on Information Theory | 1997-07-13 | Paper |
| scientific article; zbMATH DE number 1003266 (Why is no real title available?) | 1997-06-01 | Paper |
Constructions of permutation arrays for certain scheduling cost measures
Random Structures & Algorithms | 1996-12-09 | Paper |
Optimal File Sharing in Distributed Networks
SIAM Journal on Computing | 1996-01-02 | Paper |
High-order spectral-null codes-constructions and bounds
IEEE Transactions on Information Theory | 1995-11-09 | Paper |
Construction of encoders with small decoding look-ahead for input-constrained channels
IEEE Transactions on Information Theory | 1995-09-17 | Paper |
Lee-metric BCH codes and their application to constrained and partial-response channels
IEEE Transactions on Information Theory | 1995-03-01 | Paper |
New array codes for multiple phased burst correction
IEEE Transactions on Information Theory | 1993-05-16 | Paper |
\(t\)-sum generators of finite Abelian groups
Discrete Mathematics | 1992-12-06 | Paper |
Improved Gilbert-Varshamov bound for constrained systems
IEEE Transactions on Information Theory | 1992-10-11 | Paper |
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
IEEE Transactions on Information Theory | 1992-06-28 | Paper |
Application of circulant matrices to the construction and decoding of linear codes
IEEE Transactions on Information Theory | 1992-06-27 | Paper |
Maximum-rank array codes and their application to crisscross error correction
IEEE Transactions on Information Theory | 1991-01-01 | Paper |
Interpolation and Approximation of Sparse Multivariate Polynomials over $GF(2)$
SIAM Journal on Computing | 1991-01-01 | Paper |
Bounds on the number of states in encoder graphs for input-constrained channels
IEEE Transactions on Information Theory | 1991-01-01 | Paper |
On MDS codes via Cauchy matrices
IEEE Transactions on Information Theory | 1989-01-01 | Paper |
A construction of non-Reed-Solomon type MDS codes
IEEE Transactions on Information Theory | 1989-01-01 | Paper |
Encoding and decoding of BCH codes using light and short codewords
IEEE Transactions on Information Theory | 1988-01-01 | Paper |
Composition of Reed-Solomon codes and geometric designs
IEEE Transactions on Information Theory | 1988-01-01 | Paper |
On cyclic MDS codes of length q over GF(q) (Corresp.)
IEEE Transactions on Information Theory | 1986-01-01 | Paper |
On MDS extensions of generalized Reed- Solomon codes
IEEE Transactions on Information Theory | 1986-01-01 | Paper |
On generator matrices of MDS codes (Corresp.)
IEEE Transactions on Information Theory | 1985-01-01 | Paper |
Multiple-Error-Correcting Codes for Analog Computing on Resistive Crossbars
(available as arXiv preprint) | N/A | Paper |
