Prefix-free vs. uniquely decodable

rleiva / NescienceBook

The Mathematics of the Unknown

Other

1 stars 0 forks source link

Open rleiva opened 9 months ago

rleiva commented 9 months ago

Clarify the point of why prefix-free codes are required instead of uniquely decodable codes for the definition of Kolmogorov complexity.