===============================================
Technical Committee on Information Theory (IT)
Chair: Tomohiko Uematsu (Tokyo Inst. of Tech.) Vice Chair: Hiroshi Kamabe (Gifu Univ.)
Secretary: Hidenori Kuwakado (Kobe Univ.), Hiroki Koga (Univ. of Tsukuba)
Assistant: Masazumi Kurihara (Univ. of Electro-Comm.)
DATE:
Tue, Jan 18, 2011 10:40 - 16:40
PLACE:
(KAJI Yuichi)
TOPICS:
----------------------------------------
Tue, Jan 18 AM (10:40 - 12:00)
----------------------------------------
(1) 10:40 - 11:00
Index-Less Flash Codes with Reduced Block Size with Little Overhead
Yuichi Kaji (NAIST)
(2) 11:00 - 11:20
Disk Allocation Methods for Cartesian Product Files by using Unequal Error Protection Codes
Tomohiko Saito, Hiroshige Inazumi (Aoyama Gakuin Univ.), Toshiyasu Matsushima (Waseda Univ.), Shigeichi Hirasawa (Cyber Univ.)
(3) 11:20 - 11:40
On regenerating codes and secret sharing for distributed storage
Masazumi Kurihara (UEC), Hidenori Kuwakado (Kobe Univ.)
(4) 11:40 - 12:00
Lower bounds on the memory size of entities for a ramp key distribution scheme and an optimal construction
Takahiro Yoshida, Hajime Jinushi (Aoyama Gakuin Univ.), Toshiyasu Matsushima (Waseda Univ.)
----- lunch ( 60 min. ) -----
----------------------------------------
Tue, Jan 18 PM (13:00 - 14:20)
----------------------------------------
(5) 13:00 - 13:20
A construction of approximate polar codes with linear time of codeword length
Yusuke Susuki, Ken-ichi Iwata (Univ. of Fukui)
(6) 13:20 - 13:40
Reliability functions of fixed-length source coding with list decoder
Kenyu Shimono, Tomohiko Uyematsu, Ryutaroh Matsumoto (Tokyo Tech.)
(7) 13:40 - 14:00
Four Limits in Probability and Coding of a General Source
Hiroki Koga (Univ. Tsukuba)
(8) 14:00 - 14:20
A general formula for the capacity region of multiple-access channels with feedback
Tetsunao Matsuta, Tomohiko Uyematsu (Tokyo Inst. of Tech.)
----- Break ( 10 min. ) -----
----------------------------------------
Tue, Jan 18 PM (14:30 - 16:40)
----------------------------------------
(9) 14:30 - 14:50
Linearly Constrained Permutations
Tadashi Wadayama (Nagoya Inst. of Tech.)
(10) 14:50 - 15:10
A Note on the Inference Algorithm on the Factor Graph based on the Linear Programming
Shunsuke Horii, Toshiyasu Matsushima (Waseda Univ.), Shigeichi Hirasawa (Waseda Univ./Cyber Univ.)
(11) 15:10 - 15:30
An improved bit flipping decoding algorithm based on messages of binary sequence
Yuki Taniguchi, Gou Hosoya, Masayuki Goto (Waseda Univ.), Shigeichi Hirasawa (Waseda Univ./Cyber Univ.)
----- Break ( 10 min. ) -----
(12) 15:40 - 16:00
Iterative Decoding of LDPC Codes with Convex Optimization and Min-Sum Decoding
Tomoaki Oiki, Ryutaroh Matsumoto, Tomohiko Uyematsu (Tokyo Tech)
(13) 16:00 - 16:20
An Improvement of Layered BP Decoding Algorithm for Rate-Compatible Punctured LDPC Codes
Gou Hosoya (Waseda Univ.), Hideki Yagi (Univ. of Electo-Comm.), Manabu Kobayashi (Shonan Inst. of Tech.)
(14) 16:20 - 16:40
Efficient encoding of Generalized LDPC Codes
Kenichi Teramoto, Gou Hosoya, Masayuki Goto (Waseda Univ.), Shigeichi Hirasawa (Waseda Univ./Cyber Univ.)
# Information for speakers
General Talk will have 15 minutes for presentation and 5 minutes for discussion.
# CONFERENCE SPONSORS:
- This conference is co-sponsored by IEEE IT Society Japan Chapter.
=== Technical Committee on Information Theory (IT) ===
# FUTURE SCHEDULE:
Thu, Mar 3, 2011 - Fri, Mar 4, 2011: Osaka University [Fri, Jan 14]
# SECRETARY:
E-mail:it-c(to IT Secretaries)
.
Hidenori Kuwakado(Kobe University)
Hiroki Koga(University of Tsukuba)
Last modified: 2011-01-11 11:21:43
|
Notification: Mail addresses are partially hidden against SPAM.
|