IEEE Fellow 2004, "For contributions to error-correcting codes and digital sequences.".
2024
Graphs with the unique path property: Structure, cycles, factors, and constructions.
J. Graph Theory, January, 2024
Representing Information on DNA using Patterns Induced by Enzymatic Labeling.
CoRR, 2024
Repairing Reed-Solomon Codes with Side Information.
CoRR, 2024
Repairing with Zero Skip Cost.
CoRR, 2024
Nearly Perfect Covering Codes.
CoRR, 2024
On de Bruijn Covering Sequences and Arrays.
CoRR, 2024
Recovery Sets of Subspaces from a Simplex Code.
CoRR, 2024
Maximum Length RLL Sequences in de Bruijn Graph.
CoRR, 2024
The Capacity of the Weighted Read Channel.
CoRR, 2024
2023
On Hierarchies of Balanced Sequences.
IEEE Trans. Inf. Theory, May, 2023
On the Size of Balls and Anticodes of Small Diameter Under the Fixed-Length Levenshtein Metric.
IEEE Trans. Inf. Theory, April, 2023
Dimensions of Channel Coding: From Theory to Algorithms to Applications.
IEEE J. Sel. Areas Inf. Theory, 2023
Pseduo-Random and de Bruijn Array Codes.
CoRR, 2023
Domination mappings into the hamming ball: Existence, constructions, and algorithms.
Adv. Math. Commun., 2023
Thermal-Aware Channel Capacity.
Proceedings of the IEEE International Symposium on Information Theory, 2023
Coding for IBLTs with Listing Guarantees.
Proceedings of the IEEE International Symposium on Information Theory, 2023
2022
Non-Binary Diameter Perfect Constant-Weight Codes.
IEEE Trans. Inf. Theory, 2022
Covering Sequences for ℓ-Tuples.
Proceedings of the IEEE International Symposium on Information Theory, 2022
Perfect Codes and Related Structures
WorldScientific, ISBN: 9789811255892, 2022
2021
Private Proximity Retrieval Codes.
IEEE Trans. Inf. Theory, 2021
Locally-Constrained de Bruijn Codes: Properties, Enumeration, Code Constructions, and Applications.
IEEE Trans. Inf. Theory, 2021
Large sets with multiplicity.
Des. Codes Cryptogr., 2021
Deep DNA Storage: Scalable and Robust DNA Storage via Coding Theory and Deep Learning.
CoRR, 2021
On the Size of Levenshtein Balls.
CoRR, 2021
Balanced de Bruijn Sequences.
Proceedings of the IEEE International Symposium on Information Theory, 2021
Regular Multiset Combinatorial Batch Codes over Vector Spaces.
Proceedings of the IEEE International Symposium on Information Theory, 2021
On Levenshtein Balls with Radius One.
Proceedings of the IEEE International Symposium on Information Theory, 2021
2020
Bounds on the Length of Functional PIR and Batch Codes.
IEEE Trans. Inf. Theory, 2020
Low-Power Cooling Codes With Efficient Encoding and Decoding.
IEEE Trans. Inf. Theory, 2020
Network-Coding Solutions for Minimal Combination Networks and Their Sub-Networks.
IEEE Trans. Inf. Theory, 2020
PIR Schemes With Small Download Complexity and Low Storage Requirements.
IEEE Trans. Inf. Theory, 2020
Subspace packings: constructions and bounds.
Des. Codes Cryptogr., 2020
Constrained de Bruijn Codes: Properties, Enumeration, Constructions, and Applications.
CoRR, 2020
Recovery Sets for Subspaces from a Vector Space.
Proceedings of the IEEE International Symposium on Information Theory, 2020
Efficient Algorithm for the Linear Complexity of Sequences and Some Related Consequences.
Proceedings of the IEEE International Symposium on Information Theory, 2020
2019
Locality and Availability of Array Codes Constructed From Subspaces.
IEEE Trans. Inf. Theory, 2019
Local Rank Modulation for Flash Memories.
IEEE Trans. Inf. Theory, 2019
Grassmannian Codes With New Distance Measures for Network Coding.
IEEE Trans. Inf. Theory, 2019
PIR Array Codes With Optimal Virtual Server Rate.
IEEE Trans. Inf. Theory, 2019
On the Access Complexity of PIR Schemes.
Proceedings of the IEEE International Symposium on Information Theory, 2019
Private Proximity Retrieval.
Proceedings of the IEEE International Symposium on Information Theory, 2019
Constrained de Bruijn Codes and their Applications.
Proceedings of the IEEE International Symposium on Information Theory, 2019
Network Coding Solutions for the Combination Network and its Subgraphs.
Proceedings of the IEEE International Symposium on Information Theory, 2019
2018
Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding.
IEEE Trans. Inf. Theory, 2018
Metrics Based on Finite Directed Graphs and Coding Invariants.
IEEE Trans. Inf. Theory, 2018
Cooling Codes: Thermal-Management Coding for High-Performance Interconnects.
IEEE Trans. Inf. Theory, 2018
Residual q-Fano Planes and Related Structures.
Electron. J. Comb., 2018
A New Approach for Examining q-Steiner Systems.
Electron. J. Comb., 2018
2017
Constructions of High-Rate Minimum Storage Regenerating Codes Over Small Fields.
IEEE Trans. Inf. Theory, 2017
Regular graphs with forbidden subgraphs of K<sub>n</sub> with k edges.
Int. J. Inf. Coding Theory, 2017
PIR array codes with optimal PIR rates.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017
2016
Optimal Ferrers Diagram Rank-Metric Codes.
IEEE Trans. Inf. Theory, 2016
Systematic Error-Correcting Codes for Permutations and Multi-Permutations.
IEEE Trans. Inf. Theory, 2016
Subspace Polynomials and Cyclic Subspace Codes.
IEEE Trans. Inf. Theory, 2016
Galois geometries and coding theory.
Des. Codes Cryptogr., 2016
PIR Array Codes with Optimal PIR Rate.
CoRR, 2016
Metrics based on finite directed graphs.
Proceedings of the IEEE International Symposium on Information Theory, 2016
2015
Optimal Fractional Repetition Codes Based on Graphs and Designs.
IEEE Trans. Inf. Theory, 2015
Binary Polarization Kernels From Code Decompositions.
IEEE Trans. Inf. Theory, 2015
Bounds on the Size of Permutation Codes With the Kendall τ-Metric.
IEEE Trans. Inf. Theory, 2015
Equidistant codes in the Grassmannian.
Discret. Appl. Math., 2015
Access-optimal MSR Codes with Optimal Sub-packetization over Small Fields.
CoRR, 2015
Optimal fractional repetition codes and fractional repetition batch codes.
Proceedings of the IEEE International Symposium on Information Theory, 2015
Distributed storage systems based on intersecting subspace codes.
Proceedings of the IEEE International Symposium on Information Theory, 2015
2014
Constructions of Snake-in-the-Box Codes for Rank Modulation.
IEEE Trans. Inf. Theory, 2014
The q-analog of the middle levels problem.
Discret. Math., 2014
Covering of subspaces by subspaces.
Des. Codes Cryptogr., 2014
Optimal Ferrers Diagram Rank-Metric Codes.
CoRR, 2014
Optimal Fractional Repetition Codes.
CoRR, 2014
Distributed Storage Systems based on Equidistant Subspace Codes.
CoRR, 2014
Local Rank Modulation for Flash Memories II.
CoRR, 2014
Optimal Permutation Codes and the Kendall's $τ$-Metric.
CoRR, 2014
A new construction for constant weight codes.
Proceedings of the International Symposium on Information Theory and its Applications, 2014
Systematic codes for rank modulation.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014
Perfect permutation codes with the Kendall's τ-metric.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014
2013
Coding for the Lee and Manhattan Metrics With Weighing Matrices.
IEEE Trans. Inf. Theory, 2013
Errata to "Codes and Designs Related to Lifted MRD Codes".
IEEE Trans. Inf. Theory, 2013
Codes and Designs Related to Lifted MRD Codes.
IEEE Trans. Inf. Theory, 2013
Tilings With $n$ -Dimensional Chairs and Their Applications to Asymmetric Codes.
IEEE Trans. Inf. Theory, 2013
Tilings by (0.5, n)-Crosses and Perfect Codes.
SIAM J. Discret. Math., 2013
Problems on q-Analogs in Coding Theory
CoRR, 2013
Perfect Permutations Codes with the Kendall's $τ$-Metric.
CoRR, 2013
Error-correcting codes for multipermutations.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013
2012
Simple and Robust Binary Self-Location Patterns.
IEEE Trans. Inf. Theory, 2012
The Asymptotic Behavior of Grassmannian Codes.
IEEE Trans. Inf. Theory, 2012
Tilings with $n$-Dimensional Chairs and their Applications to WOM Codes
CoRR, 2012
2011
Enumerative Coding for Grassmannian Space.
IEEE Trans. Inf. Theory, 2011
Error-Correcting Codes in Projective Space.
IEEE Trans. Inf. Theory, 2011
Product Constructions for Perfect Lee Codes.
IEEE Trans. Inf. Theory, 2011
Sequence Folding, Lattice Tiling, and Multidimensional Coding.
IEEE Trans. Inf. Theory, 2011
On the Existence of Perfect Codes for Asymmetric Limited-Magnitude Errors
CoRR, 2011
Perfect Codes for Uniform Chains Poset Metrics
CoRR, 2011
Linearity and Complements in Projective Space
CoRR, 2011
Large constant dimension codes and lexicodes.
Adv. Math. Commun., 2011
On q-analogs of Steiner systems and covering designs.
Adv. Math. Commun., 2011
Some new distance-4 constant weight codes.
Adv. Math. Commun., 2011
Sidon sequences and doubly periodic two-dimensional synchronization patterns.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011
2010
Distinct difference configurations: multihop paths and key predistribution in sensor networks.
IEEE Trans. Inf. Theory, 2010
Two-dimensional patterns with distinct differences: constructions, bounds, and maximal anticodes.
IEEE Trans. Inf. Theory, 2010
On Perfect Codes in the Johnson Graph
CoRR, 2010
Dense error-correcting codes in the Lee metric.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010
High dimensional error-correcting codes.
Proceedings of the IEEE International Symposium on Information Theory, 2010
2009
On row-by-row coding for 2-D constraints.
IEEE Trans. Inf. Theory, 2009
Error-Correction of Multidimensional Bursts.
IEEE Trans. Inf. Theory, 2009
Error-correcting codes in projective spaces via rank-metric codes and Ferrers diagrams.
IEEE Trans. Inf. Theory, 2009
Properties of the error linear complexity spectrum.
IEEE Trans. Inf. Theory, 2009
IACR Cryptol. ePrint Arch., 2009
Key Predistribution Techniques for Grid-Based Wireless Sensor Networks.
IACR Cryptol. ePrint Arch., 2009
Representation of Subspaces and Enumerative Encoding of the Grassmannian Space
CoRR, 2009
Folding, Tiling, and Multidimensional Coding
CoRR, 2009
Enumerative Encoding in the Grassmannian Space
CoRR, 2009
Problems on Two-Dimensional Synchronization Patterns.
Proceedings of the Coding and Cryptology, Second International Workshop, 2009
2008
Prolific Codes with the Identifiable Parent Property.
SIAM J. Discret. Math., 2008
Construction of Error-Correcting Codes for Random Network Coding
CoRR, 2008
Coding Theory in Projective Space
CoRR, 2008
On the error linear complexity profiles of binary sequences of period 2<sup>n</sup>.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008
Efficient Key Predistribution for Grid-Based Wireless Sensor Networks.
Proceedings of the Information Theoretic Security, Third International Conference, 2008
2007
A Bound on the Size of Separating Hash Families.
IACR Cryptol. ePrint Arch., 2007
New upper bounds on codes via association schemes and linear programming.
Adv. Math. Commun., 2007
Single-Track Gray Codes and Sequences.
Proceedings of the Sequences, Subsequences, and Consequences, International Workshop, 2007
2006
On the Stopping Redundancy of Reed-Muller Codes.
IEEE Trans. Inf. Theory, 2006
The Positive Capacity Region of Two-Dimensional Run-Length-Constrained Channels.
IEEE Trans. Inf. Theory, 2006
Optimal tristance anticodes in certain graphs.
J. Comb. Theory A, 2006
Perfect Codes in the Johnson Schemes.
Proceedings of the 2006 IEEE Information Theory Workshop, 2006
2005
Two-dimensional cluster-correcting codes.
IEEE Trans. Inf. Theory, 2005
Zero/Positive Capacities of Two-Dimensional Runlength-Constrained Arrays.
IEEE Trans. Inf. Theory, 2005
Quasi-perfect codes with small distance.
IEEE Trans. Inf. Theory, 2005
On the Optimality of Coloring with a Lattice.
SIAM J. Discret. Math., 2005
New upper bounds on A(n, d).
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005
2004
Perfect Constant-Weight Codes.
IEEE Trans. Inf. Theory, 2004
On the optimality of coloring with a lattice.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004
Quasiperfect codes with small distance.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004
Two-dimensional burst-correcting codes.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004
2003
Optimal 2-Dimensional 3-Dispersion Lattices.
Proceedings of the Applied Algebra, 2003
2002
Improved upper bounds on sizes of codes.
IEEE Trans. Inf. Theory, 2002
Two-dimensional interleaving schemes with repetitions: Constructions and bounds.
IEEE Trans. Inf. Theory, 2002
Codes and Anticodes in the Grassman Graph.
J. Comb. Theory A, 2002
2001
Constructions for perfect 2-burst-correcting codes.
IEEE Trans. Inf. Theory, 2001
2000
Optimal codes for single-error correction, double-adjacent-error detection.
IEEE Trans. Inf. Theory, 2000
1999
Efficient Code Construction for Certain Two-Dimensional Constraints.
IEEE Trans. Inf. Theory, 1999
The structure of single-track Gray codes.
IEEE Trans. Inf. Theory, 1999
Which codes have cycle-free Tanner graphs?
IEEE Trans. Inf. Theory, 1999
Linear Complexity of de Brujin Sequences - Old and New Results.
IEEE Trans. Inf. Theory, 1999
On perfect constant weight codes.
Proceedings of the Codes and Association Schemes, 1999
On perfect codes in the Johnson scheme.
Proceedings of the Codes and Association Schemes, 1999
1998
Efficient Encoding Algorithm for Third-Order Spectral-Null Codes.
IEEE Trans. Inf. Theory, 1998
Greedy and Heuristic Algorithms for Codes and Colorings.
IEEE Trans. Inf. Theory, 1998
Perfect Byte-Correcting Codes.
IEEE Trans. Inf. Theory, 1998
On Perfect Codes and Tilings: Problems and Solutions.
SIAM J. Discret. Math., 1998
1997
The depth distribution-a new characterization for linear codes.
IEEE Trans. Inf. Theory, 1997
Cascading methods for runlength-limited arrays.
IEEE Trans. Inf. Theory, 1997
Intersection of Isomorphic Linear Codes.
J. Comb. Theory A, 1997
Optimal constant weight codes over Z<sub>k</sub> and generalized designs.
Discret. Math., 1997
1996
A method for constructing decodable de Bruijn sequences.
IEEE Trans. Inf. Theory, 1996
Near optimal single-track Gray codes.
IEEE Trans. Inf. Theory, 1996
On the Nonexistence of Perfect Codes in the Johnson Scheme.
SIAM J. Discret. Math., 1996
Nonequivalent <i>q</i>-ary Perfect Codes.
SIAM J. Discret. Math., 1996
Permutation Polynomials, de Bruijn Sequences, and Linear Complexity.
J. Comb. Theory A, 1996
On the Chromatic Number, Colorings, and Codes of the Johnson Graph.
Discret. Appl. Math., 1996
1995
Constructions for optimal constant weight cyclically permutable codes and difference families.
IEEE Trans. Inf. Theory, 1995
Bounds on the Sizes of Constant Weight Covering Codes.
Des. Codes Cryptogr., 1995
1994
Perfect binary codes: constructions, properties, and enumeration.
IEEE Trans. Inf. Theory, 1994
1993
Normal and abnormal codes.
IEEE Trans. Inf. Theory, 1993
Constructions for perfect mixed codes and other covering codes.
IEEE Trans. Inf. Theory, 1993
Rotating-Table Games and Derivatives of Words.
Theor. Comput. Sci., 1993
The Last Packing Number of Quadruples, and Cyclic SQS.
Des. Codes Cryptogr., 1993
On Constructions for Optimal Optical Orthogonal Codes.
Proceedings of the Algebraic Coding, 1993
Some Constructions of Perfect Binary Codes.
Proceedings of the Applied Algebra, 1993
1992
Optimal codes for correcting single errors and detecting adjacent errors.
IEEE Trans. Inf. Theory, 1992
Correction to 'New lower bounds for asymmetric and unidirectional codes' (Nov 91 1696-1704).
IEEE Trans. Inf. Theory, 1992
UPP Graphs and UMFA Networks-Architecture for Parallel Systems.
IEEE Trans. Computers, 1992
An explicit construction of Euler circuits in shuffle nets and related networks.
Networks, 1992
Partitions of Triples into Optimal Packings.
J. Comb. Theory A, 1992
Optimal Partitions for Triples.
J. Comb. Theory A, 1992
Connections Between two Cycles - a New Design of Dense Processor Interconnection Networks.
Discret. Appl. Math., 1992
1991
New lower bounds for asymmetric and unidirectional codes.
IEEE Trans. Inf. Theory, 1991
Towards a Large Set of Steiner Quadruple Systems.
SIAM J. Discret. Math., 1991
Combinatorial designs with Costas arrays properties.
Discret. Math., 1991
1990
Constructions of error-correcting DC-free block codes.
IEEE Trans. Inf. Theory, 1990
Hamiltonian decomposition of K<sup>*</sup><sub>n</sub>, patterns with distinct differences, and Tuscan squares.
Discret. Math., 1990
1989
New lower bounds for constant weight codes.
IEEE Trans. Inf. Theory, 1989
1988
Constructions for perfect maps and pseudorandom arrays.
IEEE Trans. Inf. Theory, 1988
1987
1986
On the distribution of de Bruijn CR-sequences.
IEEE Trans. Inf. Theory, 1986
An Algorithm for Generating Shift-Register Cycles.
Theor. Comput. Sci., 1986
An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network.
SIAM J. Comput., 1986
An Algorithm for Constructing m-ary de Bruijn Sequences.
J. Algorithms, 1986
1985
On the Distribution of de Bruijn Sequences of Low Complexity.
J. Comb. Theory A, 1985
1984
Construction of de Bruijn sequences of minimal complexity.
IEEE Trans. Inf. Theory, 1984
On the distribution of de Bruijn sequences of given complexity.
IEEE Trans. Inf. Theory, 1984
Algorithms for the generation of full-length shift-register sequences.
IEEE Trans. Inf. Theory, 1984
1983
Super-Nets and their Hierarchy.
Theor. Comput. Sci., 1983
1982
Behavioral Equivalence of Concurrent Systems.
Proceedings of the Applications and Theory of Petri Nets, 1982