Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
IEICE Technical Committee Submission System
Conference Paper's Information		 Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2022-01-21 13:30
Slepian-Wolf Coding Theorems Considering Costs for Codewords
Naoki Ueda, Tomohiko Uyematsu (Tokyo Tech) IT2021-81 SIP2021-89 RCS2021-249
Abstract (in Japanese) (See Japanese page) 
(in English) Many codes used for source coding assume that the costs for transmitting and recording each symbol are uniform, and codes are designed to minimize the average length of codewords for a given source. However, in the transmission and recording of information, it seems to be natural that each symbol has a different cost, and codes that minimize the costs of codewords are required. In this paper, we deal with two types of costs for codewords: regular costs and finite state costs. We consider the Slepian-Wolf coding problem for stationary memoryless sources, and clarify the achievable rate region of the maximum cost rates, which are defined by the maximum value of the costs for codewords per symbols. Furthermore, we also clarify the achievable rate region for the average cost rates, which are defined by the average value of the costs for codewords per symbols. Further, in the case of stationary memoryless sources, we show that these two achievable rate regions are identical.
Keyword (in Japanese) (See Japanese page) 
(in English) Slepian-Wolf coding / cost rate / achievable rate region / stationary memoryless source / cost for codeword / / /  
Reference Info. IEICE Tech. Rep., vol. 121, no. 327, IT2021-81, pp. 295-300, Jan. 2022.
Paper # IT2021-81 
Date of Issue 2022-01-13 (IT, SIP, RCS) 
ISSN Online edition: ISSN 2432-6380
Copyright
and
reproduction		 All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF IT2021-81 SIP2021-89 RCS2021-249

Conference Information
Committee RCS SIP IT  
Conference Date 2022-01-20 - 2022-01-21 
Place (in Japanese) (See Japanese page) 
Place (in English) Online 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To IT 
Conference Code 2022-01-RCS-SIP-IT 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Slepian-Wolf Coding Theorems Considering Costs for Codewords 
Sub Title (in English)  
Keyword(1) Slepian-Wolf coding  
Keyword(2) cost rate  
Keyword(3) achievable rate region  
Keyword(4) stationary memoryless source  
Keyword(5) cost for codeword  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Naoki Ueda  
1st Author's Affiliation Tokyo Institute of Technology (Tokyo Tech)
2nd Author's Name Tomohiko Uyematsu  
2nd Author's Affiliation Tokyo Institute of Technology (Tokyo Tech)
3rd Author's Name  
3rd Author's Affiliation ()
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2022-01-21 13:30:00 
Presentation Time 25 minutes 
Registration for IT 
Paper # IT2021-81, SIP2021-89, RCS2021-249 
Volume (vol) vol.121 
Number (no) no.327(IT), no.328(SIP), no.329(RCS) 
Page pp.295-300 
#Pages 6 
Date of Issue 2022-01-13 (IT, SIP, RCS) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan