| Publication | Date of Publication | Type |
|---|
Correcting multiple deletions and insertions in racetrack memory
IEEE Transactions on Information Theory | 2024-07-19 | Paper |
On Optimal k-Deletion Correcting Codes
IEEE Transactions on Information Theory | 2021-07-23 | Paper |
On Coding Over Sliced Information
IEEE Transactions on Information Theory | 2021-07-22 | Paper |
Trace Reconstruction with Bounded Edit Distance
| 2021-02-10 | Paper |
Two Deletion Correcting Codes From Indicator Vectors
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
Evolution of $k$ -Mer Frequencies and Entropy in Duplication and Substitution Mutation Systems
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
The Entropy Rate of Some Pólya String Models
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
On the Uncertainty of Information Retrieval in Associative Memories
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
New techniques for constructing EC/AUED codes
IEEE Transactions on Computers | 2018-09-14 | Paper |
The Capacity of Some P\'olya String Models
| 2018-08-18 | Paper |
Partial-sum queries in OLAP data cubes using covering codes
IEEE Transactions on Computers | 2018-07-09 | Paper |
Capacity and Expressiveness of Genomic Tandem Duplication
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Duplication Distance to the Root for Binary Sequences
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms
IEEE Transactions on Information Theory | 2017-10-19 | Paper |
Cyclic Lowest Density MDS Array Codes
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Rank Modulation for Flash Memories
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Shortening Array Codes and the Perfect $1$-Factorization Conjecture
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Network Coding: A Computational Perspective
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Codes for Asymmetric Limited-Magnitude Errors With Application to Multilevel Flash Memories
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Correcting Charge-Constrained Errors in the Rank-Modulation Scheme
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Rewriting Codes for Joint Information Storage in Flash Memories
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Switch Codes: Codes for Fully Parallel Reconstruction
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
On the Capacity of the Precision-Resolution System
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Constant-Weight Gray Codes for Local Rank Modulation
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
On the Capacity and Programming of Flash Memories
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Efficient Generation of Random Bits From Finite State Markov Chains
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Low-Complexity Array Codes for Random and Clustered 4-Erasures
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Synthesis of Stochastic Flow Networks
IEEE Transactions on Computers | 2017-06-20 | Paper |
Trajectory Codes for Flash Memory
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
On the Average Complexity of Reed–Solomon List Decoders
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Generalized Gray Codes for Local Rank Modulation
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Zigzag Codes: MDS Array Codes With Optimal Rebuilding
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Nonuniform Codes for Correcting Asymmetric Errors in Data Storage
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Optimal Rebuilding of Multiple Erasures in MDS Codes
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Access Versus Bandwidth in Codes for Storage
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Bounds for Permutation Rate-Distortion
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Constructions and Decoding of Cyclic Codes Over <inline-formula> <tex-math notation="LaTeX">$b$ </tex-math> </inline-formula>-Symbol Read Channels
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Codes Correcting Erasures and Deletions for Rank Modulation
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Communication Efficient Secret Sharing
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
The Capacity of String-Duplication Systems
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Rank-Modulation Rewrite Coding for Flash Memories
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Systematic Error-Correcting Codes for Rank Modulation
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Systematic Error-Correcting Codes for Permutations and Multi-Permutations
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Explicit Minimum Storage Regenerating Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Asymmetric Error Correction and Flash-Memory Rewriting Using Polar Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Approximate sorting of data streams with limited storage
Journal of Combinatorial Optimization | 2016-11-29 | Paper |
Approximate sorting of data streams with limited storage
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Distributed broadcasting and mapping protocols in directed anonymous networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
Streaming Algorithms for Optimal Generation of Random Bits
| 2012-09-04 | Paper |
Linear Transformations for Randomness Extraction
| 2012-09-04 | Paper |
Efficiently Extracting Randomness from Imperfect Stochastic Processes
| 2012-09-04 | Paper |
Nonuniform Codes for Correcting Asymmetric Errors in Data Storage
| 2012-09-04 | Paper |
A Universal Scheme for Transforming Binary Algorithms to Generate Random Bits from Loaded Dice
| 2012-09-04 | Paper |
Cyclic Boolean circuits
Discrete Applied Mathematics | 2012-08-10 | Paper |
scientific article; zbMATH DE number 5862919 (Why is no real title available?)
| 2011-03-09 | Paper |
Interleaving schemes on circulant graphs with two offsets
Discrete Mathematics | 2009-12-10 | Paper |
Computation with finite stochastic chemical reaction networks
Natural Computing | 2009-11-04 | Paper |
Constrained Codes as Networks of Relations
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
Optimal Universal Schedules for Discrete Broadcast
IEEE Transactions on Information Theory | 2009-02-24 | Paper |
The encoding complexity of network coding
| 2008-12-21 | Paper |
Multicluster Interleaving on Paths and Cycles
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Optimal Interleaving on Tori
SIAM Journal on Discrete Mathematics | 2007-11-16 | Paper |
Continuum percolation with unreliable and spread-out connections
Journal of Statistical Physics | 2005-05-25 | Paper |
scientific article; zbMATH DE number 2154518 (Why is no real title available?)
| 2005-04-09 | Paper |
Algebraic Techniques for Constructing Minimal Weight Threshold Functions
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
Covering algorithms, continuum percolation and the geometry of wireless networks
The Annals of Applied Probability | 2003-11-17 | Paper |
EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures
IEEE Transactions on Computers | 2003-10-14 | Paper |
Splitting schedules for Internet broadcast communication
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
scientific article; zbMATH DE number 1256708 (Why is no real title available?)
| 2002-01-20 | Paper |
Coding for tolerance and detection of skew in parallel asynchronous communications
IEEE Transactions on Information Theory | 2001-03-19 | Paper |
Low-density MDS codes and factors of complete graphs
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
MDS array codes for correcting a single criss-cross error
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
Depth efficient neural networks for division and related problems
IEEE Transactions on Information Theory | 2000-08-14 | Paper |
X-code: MDS array codes with optimal encoding
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Efficient digital-to-analog encoding
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Interleaving schemes for multidimensional cluster errors
IEEE Transactions on Information Theory | 1998-10-27 | Paper |
Reflections on ``Representations of sets of Boolean functions by commutative rings by Roman Smolensky
Computational Complexity | 1998-02-11 | Paper |
Fault-Tolerant Meshes with Small Degree
SIAM Journal on Computing | 1998-02-10 | Paper |
Fault-tolerant cube graphs and coding theory
IEEE Transactions on Information Theory | 1997-05-12 | Paper |
scientific article; zbMATH DE number 922849 (Why is no real title available?)
| 1996-11-20 | Paper |
MDS array codes with independent parity symbols
IEEE Transactions on Information Theory | 1996-07-28 | Paper |
scientific article; zbMATH DE number 721892 (Why is no real title available?)
| 1995-08-24 | Paper |
Coding for delay-insensitive communication with partial synchronization
IEEE Transactions on Information Theory | 1995-07-12 | Paper |
The IBM external user interface for scalable parallel systems
Parallel Computing | 1995-01-29 | Paper |
Wildcard dimensions, coding theory and fault-tolerant meshes and hypercubes
IEEE Transactions on Computers | 1995-01-01 | Paper |
Delay-insensitive pipelined communication on parallel buses
IEEE Transactions on Computers | 1995-01-01 | Paper |
On optimal broadcasting in faulty hypercubes
Discrete Applied Mathematics | 1994-12-11 | Paper |
Constructions of skew-tolerant and skew-detecting codes
IEEE Transactions on Information Theory | 1994-10-03 | Paper |
scientific article; zbMATH DE number 432792 (Why is no real title available?)
| 1994-09-20 | Paper |
Tolerating faults in a mesh with a row of spare nodes
Theoretical Computer Science | 1994-07-21 | Paper |
Explicit Constructions of Depth-2 Majority Circuits for Comparison and Addition
SIAM Journal on Discrete Mathematics | 1994-05-12 | Paper |
Embedding cube-connected cycles graphs into faulty hypercubes
IEEE Transactions on Computers | 1994-01-01 | Paper |
Coding for skew-tolerant parallel asynchronous communications
IEEE Transactions on Information Theory | 1993-09-16 | Paper |
scientific article; zbMATH DE number 826042 (Why is no real title available?)
| 1993-01-01 | Paper |
Polynomial Threshold Functions, $AC^0 $ Functions, and Spectral Norms
SIAM Journal on Computing | 1992-06-28 | Paper |
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
IEEE Transactions on Information Theory | 1992-06-28 | Paper |
On the Power of Threshold Circuits with Small Weights
SIAM Journal on Discrete Mathematics | 1992-06-26 | Paper |
How to play bowling in parallel on the grid
Journal of Algorithms | 1991-01-01 | Paper |
Harmonic Analysis of Polynomial Threshold Functions
SIAM Journal on Discrete Mathematics | 1990-01-01 | Paper |
The hardness of decoding linear codes with preprocessing
IEEE Transactions on Information Theory | 1990-01-01 | Paper |
On the power of neural networks for solving hard problems
Journal of Complexity | 1990-01-01 | Paper |
On the number of spurious memories in the Hopfield model (neural network)
IEEE Transactions on Information Theory | 1990-01-01 | Paper |
Decoding the Golay code with Venn diagrams
IEEE Transactions on Information Theory | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4132090 (Why is no real title available?)
| 1990-01-01 | Paper |
Neural networks, error-correcting codes, and polynomials over the binary n-cube
IEEE Transactions on Information Theory | 1989-01-01 | Paper |
A generalized convergence theorem for neural networks
IEEE Transactions on Information Theory | 1989-01-01 | Paper |
A study on neural networks
International Journal of Intelligent Systems | 1988-01-01 | Paper |
