Using T-codes as locally decodable source codes
Author(s)
Speidel, Ulrich; Gulliver, T. Aaron; Medard, Muriel; Makhdoumi Kakhaki, Ali
DownloadMedard_Using t-codes.pdf (247.9Kb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
A locally decodable source code (LDSC) allows the recovery of arbitrary parts of an unencoded message from its encoded version, using only a part of the encoded message as input, a challenge that arises when searching within compressed data sets. Simple source codes such as Huffman codes or Lempel-Ziv compression are not well suited to this task: A decoder starting at an arbitrary point within the compressed sequence generally cannot determine its position with respect to the boundaries between encoded symbols, or requires information found before the starting point in order to be able to decode. In this paper, we propose the use of subsets of self-synchronising variable-length T-codes as source codes and show that local decoding is feasible and practical using subsets of T-codes with bounded synchronisation delay (BSD).
Date issued
2014-11Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
Proceedings of the 2014 IEEE Information Theory Workshop (ITW 2014)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Speidel, Ulrich, T. Aaron Gulliver, Ali Makhdoumi, and Muriel Medard. “Using T-Codes as Locally Decodable Source Codes.” 2014 IEEE Information Theory Workshop (ITW 2014) (November 2014).
Version: Author's final manuscript
ISBN
978-1-4799-5999-0
ISSN
1662-9019