Eq of le unique Decoding Radius
Code.eq_of_le_uniqueDecodingRadius
Plain-language statement
A stronger version of distFromCode_eq_of_lt_half_dist: If two codewords v and w are both within the uniqueDecodingRadius of u (i.e. 2 * Īā(u, v) < āCāā and 2 * Īā(u, w) < āCāā), then they must be equal.
Source project: ArkLib
Person-level attribution pending.