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

Samuel H. Florin

dblp:284/0622 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2022
0000-0002-9700-7633ORCID · reported

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

Theory of computation · 1 · 1 first-author · 1 since 2021

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
Information theory · 40% Algorithms and data structures · 40% Coding theory · 20%

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

TopicWeightPapersLastEvidence papers
Coding theory › multiuser coding
binary adder channel
0.612022
On the Binary Adder Channel With Complete Feedback, With an Application to Quantitative Group Testing · IEEE Trans. Inf. Theory 2022
Algorithms and data structures
group testing
0.612022
On the Binary Adder Channel With Complete Feedback, With an Application to Quantitative Group Testing · IEEE Trans. Inf. Theory 2022
Information theory
network information theory
0.612022
On the Binary Adder Channel With Complete Feedback, With an Application to Quantitative Group Testing · IEEE Trans. Inf. Theory 2022
Algorithms and data structures › group testing
quantitative group testing
0.612022
On the Binary Adder Channel With Complete Feedback, With an Application to Quantitative Group Testing · IEEE Trans. Inf. Theory 2022
Information theory › channel capacity
zero-error capacity
0.612022
On the Binary Adder Channel With Complete Feedback, With an Application to Quantitative Group Testing · IEEE Trans. Inf. Theory 2022

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

entropy function analysis · 0.6
YearPublicationVenuePosition
2022 On the Binary Adder Channel With Complete Feedback, With an Application to Quantitative Group Testing
abstract
We determine the exact value of the optimal symmetric rate point$(r, r)$in the Dueck zero-error capacity region of the binary adder channel with complete feedback. We proved that the average zero-error capacity$r = h(1/2-\delta) \approx 0.78974$, where$h(\cdot)$is the binary entropy function and$\delta = 1/(2\log _{2}(2 + \sqrt {3}))$. Our motivation is a problem in quantitative group testing. Given a set of$n$elements two of which are defective, the quantitative group testing problem asks for the identification of these two defectives through a series of tests. Each test gives the number of defectives contained in the tested subset, and the outcomes of previous tests are assumed known at the time of designing the current test. We establish that the minimum number of tests is asymptotic to$(\log _{2} n) / r$as$n \to \infty $.
Samuel H. Florin, Matthew H. Ho, Zilin Jiang
IEEE Trans. Inf. Theory1