3 papers
cs.IT2026
Exact Joint MAP Decoding for Unknown Load and Message Counts in Orthogonal Unsourced Random Access
Mohammad Kazemi, Mert Ozates
We study joint recovery of the load (the number of active users) and message-count vector in type-based unsourced random access with very short messages. Each user's -bit messag…
cs.CC2026
Strong NP-Completeness of Unrestricted Balanced Mobiles
Andrei Popa, Alexandru Popa
A mobile is a rooted full binary tree whose leaves carry positive integer weights. The imbalance of an internal node is the absolute difference between the total weights of its two…
cs.DS2026
Complexity and Algorithms for Unary Translocation Distance
Maria Constantin, Adrian Miclăuş, Alexandru Popa +1
Given a finite set of integers , a \emph{unary translocation} produces a new set , where and are nonnegative integers satisfying for some…