Immutable Codes

R. M. Capocelli, L. Gargano and U. Vaccaro
Additional contact information
R. M. Capocelli: Università di Salerno, Dipartimento di Informatica ed Applicazioni
L. Gargano: Università di Salerno, Dipartimento di Informatica ed Applicazioni
U. Vaccaro: Università di Salerno, Dipartimento di Informatica ed Applicazioni

A chapter in Sequences, 1990, pp 467-478 from Springer

Abstract: Abstract Immutable codes have been introduced as a tool to prevent undesirable updatings of information stored on write-once memories. Such codes have the property that data recorded through them cannot be changed. In this paper the basic results about immutable codes are reviewed and an efficient algorithm for testing the immutability of variable length codes is presented.

Keywords: Encode Scheme; Length Code; Huffman Code; Variable Length Code; Deterministic Finite Automaton (search for similar items in EconPapers)
Date: 1990
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-3352-7_37

Ordering information: This item can be ordered from
http://www.springer.com/9781461233527

DOI: 10.1007/978-1-4612-3352-7_37

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().