1 citations · 1 across the 15 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
math.CO2023
Improving Uniquely Decodable Codes in Binary Adder Channels
József Balogh, The Nguyen, Patric R. J. Ostergard +2
We present a general method to modify existing uniquely decodable codes in the -user binary adder channel. If at least one of the original constituent codes does not have averag…
math.CO2023
Sampling planar tanglegrams and pairs of disjoint triangulations
Alexander E. Black, Kevin Liu, Alex Mcdonough +4
A tanglegram consists of two rooted binary trees and a perfect matching between their leaves, and a planar tanglegram is one that admits a layout with no crossings. We show that th…