Using T-codes as locally decodable source codes
Name
Medard_Using t-codes.pdf
Size
247.97 KB
Format
Adobe PDF
Checksum (MD5)
60c0bc5681a8524f22b01473616f4f47
Author(s)
Speidel, Ulrich
Gulliver, T. Aaron
Medard, Muriel
Makhdoumi Kakhaki, Ali
Date Issued
November 2014
Journal
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
Abstract
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).
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ITW.2014.6970824
