| 大会名称 |
| 2016年 ソサイエティ大会 |
| 大会コ－ド |
| 2016S |
| 開催年 |
|
2016
|
| 発行日 |
|
2016-09-06
|
| セッション番号 |
|
A-2
|
| セッション名 |
|
情報理論
|
| 講演日 |
|
2016/9/22
|
| 講演場所(会議室等) |
|
工学部 N棟 N304
|
| 講演番号 |
|
A-2-1
|
| タイトル |
|
A General Formula of the Achievable Rate Region for the Successive Refinement Problem
|
| 著者名 |
|
◎Tetsunao Matsuta, Tomohiko Uyematsu,
|
| キーワード |
|
source coding, successive refinement problem, information spectrum
|
| 抄録 |
|
In the successive refinement problem, a fixed-length source sequence is encoded to two codewords by two encoders in order to give two reconstructions of the sequence. One of two reconstructions is given by one of two codewords by using one of two decoders, and the other reconstruction is given by all two codewords by using the other decoder. In this paper, we give the achievable rate region of this coding problem for general sources, where the achievable rate region is the set of rate pairs of two encoders such that each distortion between the source sequence and a reconstruction is less than a given distortion level.
|
| 本文pdf |
|
PDF download
|
