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 2009-05-29 14:15
Constructing prefix-free codes for finite-state noiseless channels
Takuya Koyama, Ken-ichi Iwata (Univ. of Fukui) IT2009-1
Abstract (in Japanese) (See Japanese page) 
(in English) We consider a problem to build good prefix-free codes for stationary memoryless sources over finite-state noiseless channels with unequal symbol costs. The paper presents a shortest-path procedure in directed acyclic graphs to construct good prefix-free codes for the sources
over the channels.
The algorithm generalizes Golin and Rote's algorithm for constructing good prefix-free codes to the state dependent noiseless channel case by removing an assumption that codewords should begin and end at the same state.
This algorithm runs in polynomial time for the size of the source alphabet when the costs are positive integers for each finite-state, and the state transition function is given.
Keyword (in Japanese) (See Japanese page) 
(in English) constrained prefix-free codes / directed acyclic graphs with costs / shortest path / data storage systems / joint source-channel coding / / /  
Reference Info. IEICE Tech. Rep., vol. 109, no. 66, IT2009-1, pp. 1-6, May 2009.
Paper # IT2009-1 
Date of Issue 2009-05-22 (IT) 
ISSN Print edition: ISSN 0913-5685    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 IT2009-1

Conference Information
Committee IT  
Conference Date 2009-05-29 - 2009-05-29 
Place (in Japanese) (See Japanese page) 
Place (in English) Kikai-Shinko-Kaikan Bldg. 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To IT 
Conference Code 2009-05-IT 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Constructing prefix-free codes for finite-state noiseless channels 
Sub Title (in English)  
Keyword(1) constrained prefix-free codes  
Keyword(2) directed acyclic graphs with costs  
Keyword(3) shortest path  
Keyword(4) data storage systems  
Keyword(5) joint source-channel coding  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Takuya Koyama  
1st Author's Affiliation University of Fukui (Univ. of Fukui)
2nd Author's Name Ken-ichi Iwata  
2nd Author's Affiliation University of Fukui (Univ. of Fukui)
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 2009-05-29 14:15:00 
Presentation Time 25 minutes 
Registration for IT 
Paper # IT2009-1 
Volume (vol) vol.109 
Number (no) no.66 
Page pp.1-6 
#Pages 6 
Date of Issue 2009-05-22 (IT) 

[Return to Top Page]

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