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
Demo Data from EDBT 2026 / reviewers in the wild / expert

Hila Rabii

dblp:204/8072 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2019
—ORCID · unresolved

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

Security and privacy · 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%
Network and information security
1 paper
Hardware security and side channels · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
error detection		 0.412019
High Rate Robust Codes with Low Implementation Complexity · IEEE Trans. Dependable Secur. Comput. 2019
Coding theory › error protection
robust coding		 0.412019
High Rate Robust Codes with Low Implementation Complexity · IEEE Trans. Dependable Secur. Comput. 2019
Hardware security and side channels › fault attack countermeasure
fault injection detection		 0.112019
High Rate Robust Codes with Low Implementation Complexity · IEEE Trans. Dependable Secur. Comput. 2019

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

nonlinear code construction · 0.8
YearPublicationVenuePosition
2019 High Rate Robust Codes with Low Implementation Complexity
abstract
Robust codes C(n, k)qare nonlinear q-ary codes of dimension k and length n ≤ 2k. Robust codes can detect any error with nonzero probability; hence, they can effectively detect fault injection attacks. Most high rate robust codes are either restricted to certain ratios between n and k, or have relatively high hardware complexity. This paper presents new constructions for optimum or close to optimum low complexity high rate robust codes. These codes exist for any k and n. The hardware complexity of each construction is discussed, and a method to choose the one with the smallest implementation cost is presented.
Hila Rabii, Yaara Neumeier, Osnat Keren
 IEEE Trans. Dependable Secur. Comput.1