The following pages link to Tuvi Etzion (Q397157):
Displaying 50 items.
- The \(q\)-analog of the middle levels problem (Q397158) (← links)
- New upper bounds on codes via association schemes and linear programming (Q629753) (← links)
- Some new distance-4 constant weight codes (Q644316) (← links)
- Optimal tristance anticodes in certain graphs (Q817597) (← links)
- A bound on the size of separating hash families (Q958729) (← links)
- Super-nets and their hierarchy (Q1050114) (← links)
- On the distribution of de Bruijn sequences of low complexity (Q1069308) (← links)
- An algorithm for generating shift-register cycles (Q1081585) (← links)
- Tuscan-K squares (Q1121893) (← links)
- Hamiltonian decomposition of \(K^*_ n\), patterns with distinct differences, and Tuscan squares (Q1182863) (← links)
- Combinatorial designs with Costas arrays properties (Q1182887) (← links)
- Optimal partitions for triples (Q1185896) (← links)
- Partitions of triples into optimal packings (Q1185904) (← links)
- Connections between two cycles --- a new design of dense processor interconnection networks (Q1199411) (← links)
- Rotating-table games and derivatives of words (Q1208719) (← links)
- The last packing number of quadruples, and cyclic SQS (Q1309825) (← links)
- Optimal constant weight codes over \(Z_k\) and generalized designs (Q1357723) (← links)
- Intersection of isomorphic linear codes (Q1374187) (← links)
- Codes and anticodes in the Grassman graph (Q1604569) (← links)
- Regular graphs with forbidden subgraphs of \(K_n\) with \(k\) edges (Q1664085) (← links)
- Residual \(q\)-Fano planes and related structures (Q1753097) (← links)
- A new approach for examining \(q\)-Steiner systems (Q1753104) (← links)
- Bounds on the sizes of constant weight covering codes (Q1804978) (← links)
- Self-dual sequences (Q1821784) (← links)
- On the chromatic number, colorings, and codes of the Johnson graph (Q1923589) (← links)
- Permutation polynomials, de Bruijn sequences, and linear complexity (Q1924236) (← links)
- Linearity and complements in projective space (Q1932582) (← links)
- Traceability codes (Q1957960) (← links)
- Large sets with multiplicity (Q2035460) (← links)
- Subspace packings: constructions and bounds (Q2200513) (← links)
- Covering of subspaces by subspaces (Q2248651) (← links)
- On \(q\)-analogs of Steiner systems and covering designs (Q2275870) (← links)
- Large constant dimension codes and lexicodes (Q2275871) (← links)
- Equidistant codes in the Grassmannian (Q2345600) (← links)
- Optimal codes for single-error correction, double-adjacent-error detection (Q2705942) (← links)
- (Q2717200) (← links)
- (Q2717201) (← links)
- Tilings by $(0.5,n)$-Crosses and Perfect Codes (Q2848555) (← links)
- EXISTENCE OF -ANALOGS OF STEINER SYSTEMS (Q2971026) (← links)
- Systematic Error-Correcting Codes for Permutations and Multi-Permutations (Q2976760) (← links)
- Optimal Ferrers Diagram Rank-Metric Codes (Q2976884) (← links)
- Subspace Polynomials and Cyclic Subspace Codes (Q2976951) (← links)
- Optimal Fractional Repetition Codes Based on Graphs and Designs (Q2977323) (← links)
- Bounds on the Size of Permutation Codes With the Kendall <inline-formula> <tex-math notation="LaTeX">$\tau $ </tex-math></inline-formula>-Metric (Q2977425) (← links)
- Binary Polarization Kernels From Code Decompositions (Q2978599) (← links)
- Constructions of Snake-in-the-Box Codes for Rank Modulation (Q2983344) (← links)
- Tilings With $n$-Dimensional Chairs and Their Applications to Asymmetric Codes (Q2989367) (← links)
- Codes and Designs Related to Lifted MRD Codes (Q2989420) (← links)
- The Asymptotic Behavior of Grassmannian Codes (Q2989750) (← links)
- Algorithms for the generation of full-length shift- register sequences (Q3336716) (← links)
