1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.IT2025
Let's Have Both! Optimal List-Recoverability via Alphabet Permutation Codes
Sergey Komech, Jonathan Mosheiff
We introduce alphabet-permutation (AP) codes, a new family of error-correcting codes defined by iteratively applying random coordinate-wise permutations to a fixed initial word. A…
cs.NI2023★ 1 cited
Choosing optimal parameters for a distributed multi-constrained QoS routing
Sergey Komech, Andrey Kupavskii, Alexei Vezolainen
We consider several basic questions on distributed routing in directed graphs with multiple additive costs, or metrics, and multiple constraints. Distributed routing in this sense…