| Publication | Date of Publication | Type |
|---|
Maximum size \(t\)-intersecting families and anticodes
The Electronic Journal of Combinatorics | 2026-02-04 | Paper |
Constructions of covering sequences and 2D-sequences
Designs, Codes and Cryptography | 2025-12-02 | Paper |
Recovery sets of subspaces from a simplex code
IEEE Transactions on Information Theory | 2025-01-23 | Paper |
Permutations that separate close elements, and rectangle packings in the torus
The Electronic Journal of Combinatorics | 2024-11-09 | Paper |
| Sequences and the de Bruijn graph. Properties, constructions, and applications | 2024-04-08 | Paper |
On the Size of Balls and Anticodes of Small Diameter Under the Fixed-Length Levenshtein Metric
IEEE Transactions on Information Theory | 2024-03-19 | Paper |
On Hierarchies of Balanced Sequences
IEEE Transactions on Information Theory | 2024-03-19 | Paper |
Block‐avoiding point sequencings
Journal of Combinatorial Designs | 2024-02-02 | Paper |
Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions
Journal of Combinatorial Designs | 2024-02-02 | Paper |
An improved recursive construction for disjoint Steiner quadruple systems
Journal of Combinatorial Designs | 2024-01-31 | Paper |
Graphs with the unique path property: Structure, cycles, factors, and constructions
Journal of Graph Theory | 2024-01-04 | Paper |
Domination mappings into the Hamming ball: existence, constructions, and algorithms
Advances in Mathematics of Communications | 2023-06-30 | Paper |
| Permutations that separate close elements, and rectangle packings in the torus | 2023-06-06 | Paper |
| Perfect codes and related structures | 2022-04-04 | Paper |
Non-Binary Diameter Perfect Constant-Weight Codes
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
Private Proximity Retrieval Codes
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
Locally-Constrained de Bruijn Codes: Properties, Enumeration, Code Constructions, and Applications
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
Large sets with multiplicity
Designs, Codes and Cryptography | 2021-06-24 | Paper |
Network-Coding Solutions for Minimal Combination Networks and Their Sub-Networks
IEEE Transactions on Information Theory | 2020-12-04 | Paper |
Bounds on the Length of Functional PIR and Batch Codes
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
Low-Power Cooling Codes With Efficient Encoding and Decoding
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
Subspace packings: constructions and bounds
Designs, Codes and Cryptography | 2020-09-22 | Paper |
Subspace packings: constructions and bounds
Designs, Codes and Cryptography | 2020-09-22 | Paper |
PIR Array Codes With Optimal Virtual Server Rate
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
PIR Schemes With Small Download Complexity and Low Storage Requirements
IEEE Transactions on Information Theory | 2020-01-28 | Paper |
Grassmannian Codes With New Distance Measures for Network Coding
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
Locality and Availability of Array Codes Constructed From Subspaces
IEEE Transactions on Information Theory | 2019-07-19 | Paper |
Local Rank Modulation for Flash Memories
IEEE Transactions on Information Theory | 2019-03-28 | Paper |
UPP graphs and UMFA networks-architecture for parallel systems
IEEE Transactions on Computers | 2018-09-14 | Paper |
Regular graphs with forbidden subgraphs of \(K_n\) with \(k\) edges
International Journal of Information and Coding Theory | 2018-08-24 | Paper |
Cooling Codes: Thermal-Management Coding for High-Performance Interconnects
(available as arXiv preprint) | 2018-07-09 | Paper |
Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Metrics Based on Finite Directed Graphs and Coding Invariants
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Residual \(q\)-Fano planes and related structures
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
Residual \(q\)-Fano planes and related structures
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
A new approach for examining \(q\)-Steiner systems
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
A new approach for examining \(q\)-Steiner systems
The Electronic Journal of Combinatorics | 2018-05-25 | Paper |
Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Properties of the Error Linear Complexity Spectrum
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
On Row-by-Row Coding for 2-D Constraints
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Error-Correction of Multidimensional Bursts
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Distinct Difference Configurations: Multihop Paths and Key Predistribution in Sensor Networks
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Constructions of High-Rate Minimum Storage Regenerating Codes Over Small Fields
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Error-Correcting Codes in Projective Space
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Enumerative Coding for Grassmannian Space
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Two-Dimensional Patterns With Distinct Differences—Constructions, Bounds, and Maximal Anticodes
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Product Constructions for Perfect Lee Codes
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Sequence Folding, Lattice Tiling, and Multidimensional Coding
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Simple and Robust Binary Self-Location Patterns
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Tilings With $n$-Dimensional Chairs and Their Applications to Asymmetric Codes
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Errata to “Codes and Designs Related to Lifted MRD Codes” [Feb 13 1004-1017]
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Codes and Designs Related to Lifted MRD Codes
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
The Asymptotic Behavior of Grassmannian Codes
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Coding for the Lee and Manhattan Metrics With Weighing Matrices
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Constructions of Snake-in-the-Box Codes for Rank Modulation
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Optimal fractional repetition codes based on graphs and designs
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 |
Optimal Ferrers Diagram Rank-Metric Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Bounds on the Size of Permutation Codes With the Kendall <inline-formula> <tex-math notation="LaTeX">$\tau $ </tex-math></inline-formula>-Metric
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Binary Polarization Kernels From Code Decompositions
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Subspace Polynomials and Cyclic Subspace Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Existence of \(q\)-analogs of Steiner systems
Forum of Mathematics, Pi | 2017-04-04 | Paper |
| On the Structure of the $q$-Fano Plane | 2015-08-07 | Paper |
Equidistant codes in the Grassmannian
Discrete Applied Mathematics | 2015-05-22 | Paper |
Partial \(k\)-parallelisms in finite projective spaces
Journal of Combinatorial Designs | 2015-04-29 | Paper |
Bounds on the Size of Permutation Codes with the Kendall $\tau$-Metric
(available as arXiv preprint) | 2014-08-21 | Paper |
The \(q\)-analog of the middle levels problem
Discrete Mathematics | 2014-08-08 | Paper |
Covering of subspaces by subspaces
Designs, Codes and Cryptography | 2014-06-27 | Paper |
Tilings by \((0.5,n)\)-crosses and perfect codes
SIAM Journal on Discrete Mathematics | 2013-09-26 | Paper |
| Problems on q-Analogs in Coding Theory | 2013-05-27 | Paper |
Linearity and complements in projective space
Linear Algebra and its Applications | 2013-01-21 | Paper |
| Automorphisms of Codes in the Grassmann Scheme | 2012-10-21 | Paper |
Some new distance-4 constant weight codes
Advances in Mathematics of Communications | 2011-11-03 | Paper |
On \(q\)-analogs of Steiner systems and covering designs
Advances in Mathematics of Communications | 2011-08-10 | Paper |
Large constant dimension codes and lexicodes
Advances in Mathematics of Communications | 2011-08-10 | Paper |
| Perfect Codes for Uniform Chains Poset Metrics | 2011-07-28 | Paper |
New upper bounds on codes via association schemes and linear programming
Advances in Mathematics of Communications | 2011-03-10 | Paper |
Traceability codes
Journal of Combinatorial Theory. Series A | 2010-09-27 | Paper |
| $q$-Analogs for Steiner Systems and Covering Designs | 2009-12-08 | Paper |
Prolific Codes with the Identifiable Parent Property
SIAM Journal on Discrete Mathematics | 2009-11-27 | Paper |
Problems on Two-Dimensional Synchronization Patterns
Lecture Notes in Computer Science | 2009-07-23 | Paper |
Efficient Key Predistribution for Grid-Based Wireless Sensor Networks
Lecture Notes in Computer Science | 2009-01-09 | Paper |
The Positive Capacity Region of Two-Dimensional Run-Length-Constrained Channels
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Zero/Positive Capacities of Two-Dimensional Runlength-Constrained Arrays
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
On the Stopping Redundancy of Reed–Muller Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Quasi-Perfect Codes With Small Distance
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Perfect Constant-Weight Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Two-Dimensional Cluster-Correcting Codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
A bound on the size of separating hash families
Journal of Combinatorial Theory. Series A | 2008-12-08 | Paper |
Optimal doubly constant weight codes
Journal of Combinatorial Designs | 2008-03-20 | Paper |
Single-Track Gray Codes and Sequences
Lecture Notes in Computer Science | 2008-03-07 | Paper |
Configuration distribution and designs of codes in the Johnson scheme
Journal of Combinatorial Designs | 2007-01-24 | Paper |
Optimal tristance anticodes in certain graphs
Journal of Combinatorial Theory. Series A | 2006-03-16 | Paper |
On the Optimality of Coloring with a Lattice
SIAM Journal on Discrete Mathematics | 2005-09-16 | Paper |
Improved upper bounds on sizes of codes
IEEE Transactions on Information Theory | 2005-05-11 | Paper |
| scientific article; zbMATH DE number 1943109 (Why is no real title available?) | 2003-12-17 | Paper |
Optimal 2-Dimensional 3-Dispersion Lattices
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes | 2003-09-16 | Paper |
Constructions for perfect 2-burst-correcting codes
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Two-dimensional interleaving schemes with repetitions: constructions and bounds
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Codes and anticodes in the Grassman graph
Journal of Combinatorial Theory. Series A | 2002-07-04 | Paper |
| On perfect constant weight codes | 2002-04-21 | Paper |
| On perfect codes in the Johnson scheme | 2001-09-18 | Paper |
Optimal codes for single-error correction, double-adjacent-error detection
IEEE Transactions on Information Theory | 2001-03-19 | Paper |
Optimal constant weight codes over \(Z_k\) and generalized designs
Discrete Mathematics | 2001-02-27 | Paper |
The structure of single-track Gray codes
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
Which codes have cycle-free Tanner graphs?
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
| scientific article; zbMATH DE number 1456818 (Why is no real title available?) | 2000-06-07 | Paper |
Efficient code constructions for certain two-dimensional constraints
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Linear complexity of de Bruijn sequences-old and new results
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
Perfect byte-correcting codes
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 |
| On threshold schemes from large sets | 1999-05-16 | Paper |
Intersection of isomorphic linear codes
Journal of Combinatorial Theory. Series A | 1999-04-16 | Paper |
Greedy and heuristic algorithms for codes and colorings
IEEE Transactions on Information Theory | 1998-12-28 | Paper |
On Perfect Codes and Tilings: Problems and Solutions
SIAM Journal on Discrete Mathematics | 1998-05-11 | Paper |
Permutation polynomials, de Bruijn sequences, and linear complexity
Journal of Combinatorial Theory. Series A | 1997-10-01 | Paper |
Cascading methods for runlength-limited arrays
IEEE Transactions on Information Theory | 1997-08-26 | Paper |
The depth distribution-a new characterization for linear codes
IEEE Transactions on Information Theory | 1997-07-23 | Paper |
Nonequivalent q-Ary Perfect Codes
SIAM Journal on Discrete Mathematics | 1997-07-13 | Paper |
On the chromatic number, colorings, and codes of the Johnson graph
Discrete Applied Mathematics | 1997-05-20 | Paper |
Near optimal single-track Gray codes
IEEE Transactions on Information Theory | 1997-03-16 | Paper |
A method for constructing decodable de Bruijn sequences
IEEE Transactions on Information Theory | 1996-10-22 | Paper |
On the Nonexistence of Perfect Codes in the Johnson Scheme
SIAM Journal on Discrete Mathematics | 1996-06-30 | Paper |
Large sets of coverings
Journal of Combinatorial Designs | 1996-03-11 | Paper |
Perfect binary codes: constructions, properties, and enumeration
IEEE Transactions on Information Theory | 1995-11-15 | Paper |
Constructions for optimal constant weight cyclically permutable codes and difference families
IEEE Transactions on Information Theory | 1995-11-06 | Paper |
Bounds on the sizes of constant weight covering codes
Designs, Codes and Cryptography | 1995-07-20 | Paper |
Normal and abnormal codes
IEEE Transactions on Information Theory | 1994-10-04 | Paper |
| scientific article; zbMATH DE number 554186 (Why is no real title available?) | 1994-08-10 | Paper |
| scientific article; zbMATH DE number 503208 (Why is no real title available?) | 1994-02-17 | Paper |
The last packing number of quadruples, and cyclic SQS
Designs, Codes and Cryptography | 1994-01-06 | Paper |
Rotating-table games and derivatives of words
Theoretical Computer Science | 1993-05-16 | Paper |
Constructions for perfect mixed codes and other covering codes
IEEE Transactions on Information Theory | 1993-05-16 | Paper |
An explicit construction of Euler circuits in shuffle nets and related networks
Networks | 1993-01-17 | Paper |
Connections between two cycles --- a new design of dense processor interconnection networks
Discrete Applied Mathematics | 1993-01-16 | Paper |
Optimal codes for correcting single errors and detecting adjacent errors
IEEE Transactions on Information Theory | 1992-10-11 | Paper |
| scientific article; zbMATH DE number 54789 (Why is no real title available?) | 1992-09-26 | Paper |
Optimal partitions for triples
Journal of Combinatorial Theory. Series A | 1992-06-28 | Paper |
Partitions of triples into optimal packings
Journal of Combinatorial Theory. Series A | 1992-06-28 | Paper |
New lower bounds for asymmetric and unidirectional codes
IEEE Transactions on Information Theory | 1992-06-28 | Paper |
Hamiltonian decomposition of \(K^*_ n\), patterns with distinct differences, and Tuscan squares
Discrete Mathematics | 1992-06-28 | Paper |
Combinatorial designs with Costas arrays properties
Discrete Mathematics | 1992-06-28 | Paper |
Towards a Large Set of Steiner Quadruple Systems
SIAM Journal on Discrete Mathematics | 1992-06-25 | Paper |
| scientific article; zbMATH DE number 11982 (Why is no real title available?) | 1992-06-25 | Paper |
Constructions of error-correcting DC-free block codes
IEEE Transactions on Information Theory | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4145919 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4212051 (Why is no real title available?) | 1990-01-01 | Paper |
Constructions for perfect maps and pseudorandom arrays
IEEE Transactions on Information Theory | 1989-01-01 | Paper |
Tuscan-K squares
Advances in Applied Mathematics | 1989-01-01 | Paper |
New lower bounds for constant weight codes
IEEE Transactions on Information Theory | 1989-01-01 | Paper |
Self-dual sequences
Journal of Combinatorial Theory. Series A | 1987-01-01 | Paper |
An algorithm for generating shift-register cycles
Theoretical Computer Science | 1986-01-01 | Paper |
An algorithm for constructing m-ary de Bruijn sequences
Journal of Algorithms | 1986-01-01 | Paper |
An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network
SIAM Journal on Computing | 1986-01-01 | Paper |
On the distribution of de Bruijn sequences of low complexity
Journal of Combinatorial Theory. Series A | 1985-01-01 | Paper |
Algorithms for the generation of full-length shift- register sequences
IEEE Transactions on Information Theory | 1984-01-01 | Paper |
Construction of de Bruijn sequences of minimal complexity
IEEE Transactions on Information Theory | 1984-01-01 | Paper |
On the distribution of de Bruijn sequences of given complexity
IEEE Transactions on Information Theory | 1984-01-01 | Paper |
Super-nets and their hierarchy
Theoretical Computer Science | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3825185 (Why is no real title available?) | 1983-01-01 | Paper |
