Two mathematicians have proved that a straightforward question—how hard is it to untie a knot?—has a complicated answer.
Abstract: The Plotkin construction combines two codes to a code of doubled length. It can be applied recursively. The class of Reed-Muller (RM) codes is a particular example. Exploiting a property of ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback