An efficient algorithm for testing immutability of variable-length codes
Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro · IEEE Transactions on Information Theory · 1989
Immutable codes, which have recently been introduced as a tool for preventing undesirable changes of data recorded over write-once memories, are considered. The have the property that any change of recorded information over such memories can be detected. A fast algorithm for testing whether a variable-length code is immutable is presented. The complexity of the algorithm is O(L/sup 2/), where L is the sum of the codeword lengths.>