What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Discrete mathematics
- Algorithm
Tuvi Etzion mainly focuses on Discrete mathematics, Combinatorics, Linear code, Block code and Reed–Muller code.
His study in the field of Coding theory is also linked to topics like Minimum distance.
His work carried out in the field of Combinatorics brings together such families of science as Binary code, Upper and lower bounds and Linear subspace.
His Linear code study integrates concerns from other disciplines, such as Hamming distance and Hamming code.
His work deals with themes such as Unitary perfect number and Perfect power, which intersect with Hamming code.
His Reed–Muller code study which covers Expander code that intersects with Group code and Luby transform code.
His most cited work include:
- Error-Correcting Codes in Projective Space (217 citations)
- Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams (187 citations)
- Which codes have cycle-free Tanner graphs? (138 citations)
What are the main themes of his work throughout his whole career to date?
Discrete mathematics, Combinatorics, Linear code, Block code and Upper and lower bounds are his primary areas of study.
His study looks at the relationship between Discrete mathematics and fields such as Hamming code, as well as how they intersect with chemical problems.
His Combinatorics study frequently draws connections between related disciplines such as Linear subspace.
Tuvi Etzion interconnects Low-density parity-check code and Concatenated error correction code in the investigation of issues within Linear code.
His Block code study frequently draws connections between adjacent fields such as Turbo code.
His work in Expander code covers topics such as Luby transform code which are related to areas like Online codes.
He most often published in these fields:
- Discrete mathematics (57.62%)
- Combinatorics (55.02%)
- Linear code (25.28%)
What were the highlights of his more recent work (between 2017-2021)?
- Combinatorics (55.02%)
- Discrete mathematics (57.62%)
- Disjoint sets (7.06%)
In recent papers he was focusing on the following fields of study:
His primary areas of investigation include Combinatorics, Discrete mathematics, Disjoint sets, Linear subspace and Server.
The various areas that Tuvi Etzion examines in his Combinatorics study include Scheme, Sequence and Set.
His Discrete mathematics research includes elements of Asymptotically optimal algorithm and Multicast.
His Disjoint sets research is multidisciplinary, relying on both Class and Partition.
His biological study spans a wide range of topics, including Node, Structure and Block code.
His research integrates issues of Large numbers and Linear code in his study of Scalar.
Between 2017 and 2021, his most popular works were:
- Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding (27 citations)
- Locality and Availability of Array Codes Constructed From Subspaces (17 citations)
- Bounds on the Length of Functional PIR and Batch Codes (9 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Algebra
- Algorithm
His primary scientific interests are in Discrete mathematics, Combinatorics, Server, Disjoint sets and Linear subspace.
A large part of his Discrete mathematics studies is devoted to Finite field.
His Combinatorics study incorporates themes from Canonical form, Hamming weight and Metric space.
His Server research includes themes of Multiset, Linear independence, Linear combination and Distributed data store.
The Disjoint sets study combines topics in areas such as Dimension, Overhead, Large set, Set and Simple.
His studies deal with areas such as Node, Block code, Hypergraph and Coding theory as well as Linear subspace.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
