Is there an efficient algorithm to verify that a finite binary code is uniquely decodeable?
Let's say we have an alphabet of symbols A and some encoding of those symbols C. How do we check quickly that there are no distinct strings s1 and s2 made up of symbols in A that have the same encoding in C?