DocumentCode :
1230705
Title :
An efficient algorithm for testing immutability of variable-length codes
Author :
Capocelli, Renato M. ; Gargano, Luisa ; Vaccaro, Ugo
Author_Institution :
Dept. of Math., Rome Univ., Italy
Volume :
35
Issue :
6
fYear :
1989
fDate :
11/1/1989 12:00:00 AM
Firstpage :
1310
Lastpage :
1314
Abstract :
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(L2), where L is the sum of the codeword lengths
Keywords :
codes; codeword lengths; efficient algorithm; fast algorithm; immutable codes; testing; variable-length codes; write-once memories; Change detection algorithms; Error correction; Error correction codes; Fault tolerance; Linear code; Notice of Violation; Packaging; Parity check codes; Testing;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.45290
Filename :
45290
Link To Document :
بازگشت