In this episode, we discuss a mapping that generates codes with the property of having a good minimal distance provided that the block length exceeds the message length by a certain margin. Codewords are obtained by mapping polynomials into Sigma to the n by evaluating them at a properly chosen evaluation set. We then explain how the distance d helps design a protocol that detects interpolating polynomials with probability 1 and catches false counterfeit tables with high probability.

==== 📡 Socials ====
Website: lambdaclass.com
Twitter: @Class_Lambda
TikTok: @classlambda
YouTube: @lambdaclass
Linkedin: Lambdaclass
Telegram: t.me/classlambda

свернуть