Tuvi Etzion

From MaRDI portal
Person:397157

Available identifiers

zbMath Open etzion.tuviWikidataQ102273000 ScholiaQ102273000MaRDI QIDQ397157

List of research outcomes





PublicationDate of PublicationType
Recovery sets of subspaces from a simplex code2025-01-23Paper
Permutations that separate close elements, and rectangle packings in the torus2024-11-09Paper
Sequences and the de Bruijn graph. Properties, constructions, and applications2024-04-08Paper
On the Size of Balls and Anticodes of Small Diameter Under the Fixed-Length Levenshtein Metric2024-03-19Paper
On Hierarchies of Balanced Sequences2024-03-19Paper
Block‐avoiding point sequencings2024-02-02Paper
Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions2024-02-02Paper
An improved recursive construction for disjoint Steiner quadruple systems2024-01-31Paper
Graphs with the unique path property: Structure, cycles, factors, and constructions2024-01-04Paper
Domination mappings into the Hamming ball: existence, constructions, and algorithms2023-06-30Paper
Permutations that separate close elements, and rectangle packings in the torus2023-06-06Paper
Perfect Codes and Related Structures2022-04-04Paper
Non-Binary Diameter Perfect Constant-Weight Codes2022-02-17Paper
Private Proximity Retrieval Codes2022-02-17Paper
Locally-Constrained de Bruijn Codes: Properties, Enumeration, Code Constructions, and Applications2022-02-17Paper
Large sets with multiplicity2021-06-24Paper
Network-Coding Solutions for Minimal Combination Networks and Their Sub-Networks2020-12-04Paper
Bounds on the Length of Functional PIR and Batch Codes2020-09-29Paper
Low-Power Cooling Codes With Efficient Encoding and Decoding2020-09-29Paper
Subspace packings: constructions and bounds2020-09-22Paper
PIR Array Codes With Optimal Virtual Server Rate2020-01-28Paper
PIR Schemes With Small Download Complexity and Low Storage Requirements2020-01-28Paper
Grassmannian Codes With New Distance Measures for Network Coding2019-07-19Paper
Locality and Availability of Array Codes Constructed From Subspaces2019-07-19Paper
Local Rank Modulation for Flash Memories2019-03-28Paper
UPP graphs and UMFA networks-architecture for parallel systems2018-09-14Paper
Regular graphs with forbidden subgraphs of \(K_n\) with \(k\) edges2018-08-24Paper
Cooling Codes: Thermal-Management Coding for High-Performance Interconnects2018-07-09Paper
Metrics Based on Finite Directed Graphs and Coding Invariants2018-06-27Paper
Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding2018-06-27Paper
A new approach for examining \(q\)-Steiner systems2018-05-25Paper
Residual \(q\)-Fano planes and related structures2018-05-25Paper
Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams2017-08-08Paper
Properties of the Error Linear Complexity Spectrum2017-08-08Paper
On Row-by-Row Coding for 2-D Constraints2017-08-08Paper
Error-Correction of Multidimensional Bursts2017-08-08Paper
Error-Correcting Codes in Projective Space2017-07-27Paper
Enumerative Coding for Grassmannian Space2017-07-27Paper
Two-Dimensional Patterns With Distinct Differences—Constructions, Bounds, and Maximal Anticodes2017-07-27Paper
Distinct Difference Configurations: Multihop Paths and Key Predistribution in Sensor Networks2017-07-27Paper
Constructions of High-Rate Minimum Storage Regenerating Codes Over Small Fields2017-07-27Paper
Product Constructions for Perfect Lee Codes2017-07-12Paper
Sequence Folding, Lattice Tiling, and Multidimensional Coding2017-07-12Paper
Simple and Robust Binary Self-Location Patterns2017-07-12Paper
Codes and Designs Related to Lifted MRD Codes2017-06-08Paper
The Asymptotic Behavior of Grassmannian Codes2017-06-08Paper
Coding for the Lee and Manhattan Metrics With Weighing Matrices2017-06-08Paper
Tilings With $n$-Dimensional Chairs and Their Applications to Asymmetric Codes2017-06-08Paper
Errata to “Codes and Designs Related to Lifted MRD Codes” [Feb 13 1004-1017]2017-06-08Paper
Constructions of Snake-in-the-Box Codes for Rank Modulation2017-05-16Paper
Optimal Ferrers Diagram Rank-Metric Codes2017-04-28Paper
Bounds on the Size of Permutation Codes With the Kendall <inline-formula> <tex-math notation="LaTeX">$\tau $ </tex-math></inline-formula>-Metric2017-04-28Paper
Binary Polarization Kernels From Code Decompositions2017-04-28Paper
Subspace Polynomials and Cyclic Subspace Codes2017-04-28Paper
Optimal Fractional Repetition Codes Based on Graphs and Designs2017-04-28Paper
Systematic Error-Correcting Codes for Permutations and Multi-Permutations2017-04-28Paper
EXISTENCE OF -ANALOGS OF STEINER SYSTEMS2017-04-04Paper
On the Structure of the $q$-Fano Plane2015-08-07Paper
Equidistant codes in the Grassmannian2015-05-22Paper
Partial ‐Parallelisms in Finite Projective Spaces2015-04-29Paper
Bounds on the Size of Permutation Codes with the Kendall $\tau$-Metric2014-08-21Paper
The \(q\)-analog of the middle levels problem2014-08-08Paper
Covering of subspaces by subspaces2014-06-27Paper
Tilings by \((0.5,n)\)-crosses and perfect codes2013-09-26Paper
Problems on q-Analogs in Coding Theory2013-05-27Paper
Linearity and complements in projective space2013-01-21Paper
Automorphisms of Codes in the Grassmann Scheme2012-10-21Paper
Some new distance-4 constant weight codes2011-11-03Paper
On \(q\)-analogs of Steiner systems and covering designs2011-08-10Paper
Large constant dimension codes and lexicodes2011-08-10Paper
Perfect Codes for Uniform Chains Poset Metrics2011-07-28Paper
New upper bounds on codes via association schemes and linear programming2011-03-10Paper
Traceability codes2010-09-27Paper
$q$-Analogs for Steiner Systems and Covering Designs2009-12-08Paper
Prolific Codes with the Identifiable Parent Property2009-11-27Paper
Problems on Two-Dimensional Synchronization Patterns2009-07-23Paper
Efficient Key Predistribution for Grid-Based Wireless Sensor Networks2009-01-09Paper
Quasi-Perfect Codes With Small Distance2008-12-21Paper
Perfect Constant-Weight Codes2008-12-21Paper
Two-Dimensional Cluster-Correcting Codes2008-12-21Paper
The Positive Capacity Region of Two-Dimensional Run-Length-Constrained Channels2008-12-21Paper
Zero/Positive Capacities of Two-Dimensional Runlength-Constrained Arrays2008-12-21Paper
On the Stopping Redundancy of Reed–Muller Codes2008-12-21Paper
A bound on the size of separating hash families2008-12-08Paper
Optimal doubly constant weight codes2008-03-20Paper
Single-Track Gray Codes and Sequences2008-03-07Paper
Configuration distribution and designs of codes in the Johnson scheme2007-01-24Paper
Optimal tristance anticodes in certain graphs2006-03-16Paper
On the Optimality of Coloring with a Lattice2005-09-16Paper
Improved upper bounds on sizes of codes2005-05-11Paper
https://portal.mardi4nfdi.de/entity/Q44096842003-12-17Paper
Optimal 2-Dimensional 3-Dispersion Lattices2003-09-16Paper
Two-dimensional interleaving schemes with repetitions: constructions and bounds2002-08-04Paper
Constructions for perfect 2-burst-correcting codes2002-08-04Paper
Codes and anticodes in the Grassman graph2002-07-04Paper
On perfect constant weight codes2002-04-21Paper
On perfect codes in the Johnson scheme2001-09-18Paper
Optimal codes for single-error correction, double-adjacent-error detection2001-03-19Paper
Optimal constant weight codes over \(Z_k\) and generalized designs2001-02-27Paper
The structure of single-track Gray codes2000-09-07Paper
Which codes have cycle-free Tanner graphs?2000-09-07Paper
https://portal.mardi4nfdi.de/entity/Q49544162000-06-07Paper
Linear complexity of de Bruijn sequences-old and new results1999-11-21Paper
Perfect byte-correcting codes1999-11-21Paper
Efficient code constructions for certain two-dimensional constraints1999-11-21Paper
Efficient encoding algorithm for third-order spectral-null codes1999-05-26Paper
On threshold schemes from large sets1999-05-16Paper
Intersection of isomorphic linear codes1999-04-16Paper
Greedy and heuristic algorithms for codes and colorings1998-12-28Paper
On Perfect Codes and Tilings: Problems and Solutions1998-05-11Paper
Permutation polynomials, de Bruijn sequences, and linear complexity1997-10-01Paper
Cascading methods for runlength-limited arrays1997-08-26Paper
The depth distribution-a new characterization for linear codes1997-07-23Paper
Nonequivalent q-Ary Perfect Codes1997-07-13Paper
On the chromatic number, colorings, and codes of the Johnson graph1997-05-20Paper
Near optimal single-track Gray codes1997-03-16Paper
A method for constructing decodable de Bruijn sequences1996-10-22Paper
On the Nonexistence of Perfect Codes in the Johnson Scheme1996-06-30Paper
Large sets of coverings1996-03-11Paper
Perfect binary codes: constructions, properties, and enumeration1995-11-15Paper
Constructions for optimal constant weight cyclically permutable codes and difference families1995-11-06Paper
Bounds on the sizes of constant weight covering codes1995-07-20Paper
Normal and abnormal codes1994-10-04Paper
https://portal.mardi4nfdi.de/entity/Q42881821994-08-10Paper
https://portal.mardi4nfdi.de/entity/Q42795311994-02-17Paper
The last packing number of quadruples, and cyclic SQS1994-01-06Paper
Rotating-table games and derivatives of words1993-05-16Paper
Constructions for perfect mixed codes and other covering codes1993-05-16Paper
An explicit construction of Euler circuits in shuffle nets and related networks1993-01-17Paper
Connections between two cycles --- a new design of dense processor interconnection networks1993-01-16Paper
Optimal codes for correcting single errors and detecting adjacent errors1992-10-11Paper
https://portal.mardi4nfdi.de/entity/Q40007811992-09-26Paper
Optimal partitions for triples1992-06-28Paper
Partitions of triples into optimal packings1992-06-28Paper
New lower bounds for asymmetric and unidirectional codes1992-06-28Paper
Hamiltonian decomposition of \(K^*_ n\), patterns with distinct differences, and Tuscan squares1992-06-28Paper
Combinatorial designs with Costas arrays properties1992-06-28Paper
Towards a Large Set of Steiner Quadruple Systems1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39746911992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q34768231990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33601851990-01-01Paper
Constructions of error-correcting DC-free block codes1990-01-01Paper
Constructions for perfect maps and pseudorandom arrays1989-01-01Paper
Tuscan-K squares1989-01-01Paper
New lower bounds for constant weight codes1989-01-01Paper
Self-dual sequences1987-01-01Paper
An algorithm for generating shift-register cycles1986-01-01Paper
An algorithm for constructing m-ary de Bruijn sequences1986-01-01Paper
An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network1986-01-01Paper
On the distribution of de Bruijn sequences of low complexity1985-01-01Paper
Algorithms for the generation of full-length shift- register sequences1984-01-01Paper
Construction of de Bruijn sequences of minimal complexity1984-01-01Paper
On the distribution of de Bruijn sequences of given complexity1984-01-01Paper
Super-nets and their hierarchy1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36705781983-01-01Paper

Research outcomes over time

This page was built for person: Tuvi Etzion