Proximity Gaps for Gabidulin Codes and Applications
Researchers prove proximity-gap bounds for rank-metric and Gabidulin codes, enabling the first polynomial commitment scheme framework based on rank-metric error-correcting codes.
1 stories, newest first · one card per story
Researchers prove proximity-gap bounds for rank-metric and Gabidulin codes, enabling the first polynomial commitment scheme framework based on rank-metric error-correcting codes.
Today 1.6K readers · 2.5K views · 779 reads · all time 189K views