Abstract
Immutable codes have the property that information recorded with them on write-once memories such as digital optical discs cannot be changed. Write-once memory permits changing a <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</tex> into a <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</tex> , but once a <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</tex> is written it cannot be changed back into a <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</tex> . Most commonly used codes do not have the property of immutability. After a very general definition of immutability is given, algorithms which test a given code for immutability are developed. Algorithms are presented for fixed-length codes as well as for variable-length codes.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
