Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yuval Ginosar

dblp:24/2290 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2019
0000-0002-6045-3234ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
algebraic coding theory
0.412019
Crossed Products and Coding Theory · IEEE Trans. Inf. Theory 2019
Coding theory › error-correcting codes › block codes
group codes
0.112019
Crossed Products and Coding Theory · IEEE Trans. Inf. Theory 2019

Methods — techniques the papers use, named apart from their topics

cohomological classification · 0.4
YearPublicationVenuePosition
2019 Crossed Products and Coding Theory
abstract
Families of codes, such as group codes, constacyclic, and skew cyclic codes, which were independently suggested, turn out to be special instances of the general family of crossed product codes. Under this framework, the ambient code spaces are classified here with respect to Hamming-isometry in cohomological terms. This classification is demonstrated by two families of examples. We also determine when crossed products belonging to these families are semisimple and, in particular, when they admit only trivial codes.
Yuval Ginosar, Aviram Rochas Moreno
IEEE Trans. Inf. Theory1