Direct- or Fast-Access Decoding Schemes for VF Codes
Summary :
In this paper, we propose two schemes, which enable any VF code to realize direct- or fast-access decoding for any long source sequence. Direct-access decoding means that any source symbol of any position can be directly decoded within constant time, not depending on the length of source sequence N, without decoding the whole codeword sequence. We also evaluate the memory size necessary to realize direct-access decoding or fast-access decoding with decoding delay O(log log N), O(log N), and so on, in the proposed schemes.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E99-A No.12 pp.2291-2295
- Publication Date
- 2016/12/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E99.A.2291
- Type of Manuscript
- Special Section LETTER (Special Section on Information Theory and Its Applications)
- Category
- Source Coding and Data Compression
Authors
Hirosuke YAMAMOTO
The University of Tokyo
Yuka KUWAORI
The University of Tokyo
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Hirosuke YAMAMOTO, Yuka KUWAORI, "Direct- or Fast-Access Decoding Schemes for VF Codes" in IEICE TRANSACTIONS on Fundamentals,
vol. E99-A, no. 12, pp. 2291-2295, December 2016, doi: 10.1587/transfun.E99.A.2291.
Abstract: In this paper, we propose two schemes, which enable any VF code to realize direct- or fast-access decoding for any long source sequence. Direct-access decoding means that any source symbol of any position can be directly decoded within constant time, not depending on the length of source sequence N, without decoding the whole codeword sequence. We also evaluate the memory size necessary to realize direct-access decoding or fast-access decoding with decoding delay O(log log N), O(log N), and so on, in the proposed schemes.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E99.A.2291/_p
Copy
@ARTICLE{e99-a_12_2291,
author={Hirosuke YAMAMOTO, Yuka KUWAORI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Direct- or Fast-Access Decoding Schemes for VF Codes},
year={2016},
volume={E99-A},
number={12},
pages={2291-2295},
abstract={In this paper, we propose two schemes, which enable any VF code to realize direct- or fast-access decoding for any long source sequence. Direct-access decoding means that any source symbol of any position can be directly decoded within constant time, not depending on the length of source sequence N, without decoding the whole codeword sequence. We also evaluate the memory size necessary to realize direct-access decoding or fast-access decoding with decoding delay O(log log N), O(log N), and so on, in the proposed schemes.},
keywords={},
doi={10.1587/transfun.E99.A.2291},
ISSN={1745-1337},
month={December},}
Copy
TY - JOUR
TI - Direct- or Fast-Access Decoding Schemes for VF Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2291
EP - 2295
AU - Hirosuke YAMAMOTO
AU - Yuka KUWAORI
PY - 2016
DO - 10.1587/transfun.E99.A.2291
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E99-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2016
AB - In this paper, we propose two schemes, which enable any VF code to realize direct- or fast-access decoding for any long source sequence. Direct-access decoding means that any source symbol of any position can be directly decoded within constant time, not depending on the length of source sequence N, without decoding the whole codeword sequence. We also evaluate the memory size necessary to realize direct-access decoding or fast-access decoding with decoding delay O(log log N), O(log N), and so on, in the proposed schemes.
ER -
English
