EDBT 2026 Demo / reviewers in the wild / expert
M. Mattas
dblp:43/4064
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2005
—ORCID · none
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 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › multiuser coding
binary adder channel |
0.1 | 1 | 2005 | A New Bound for the Zero-Error Capacity Region of the Two-User Binary Adder Channel · IEEE Trans. Inf. Theory 2005 |
Coding theory
multiuser coding |
0.1 | 1 | 2005 | A New Bound for the Zero-Error Capacity Region of the Two-User Binary Adder Channel · IEEE Trans. Inf. Theory 2005 |
Coding theory › error-correcting codes
uniquely decodable codes |
0.0 | 1 | 2005 | A New Bound for the Zero-Error Capacity Region of the Two-User Binary Adder Channel · IEEE Trans. Inf. Theory 2005 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2005 | A New Bound for the Zero-Error Capacity Region of the Two-User Binary Adder ChannelabstractA new uniquely decodable (UD) code pair for the two-user binary adder channel (BAC) is presented. This code pair leads to an improved bound for the zero-error capacity region of such a channel. The highest known rate for a UD code pair for the two-user BAC is thereby improved to (log/sub 2/240)/6/spl ap/1.3178. It is also demonstrated that the problem of finding UD code pairs for the closely related binary XOR channel is in one-to-one correspondence with a certain construction of binary one-error-correcting codes. M. Mattas, Patric R. J. Östergård |
IEEE Trans. Inf. Theory | 1 |