1.1 Coding for Storage
Dec. 10. Wed 10:20〜11:40 Hō Left: ROOM 1

1.1.1  An Application of WOM Codes to Flash Memories
 
○Tetsuya Kobayashi (The University of Electro-Communications),
Hiroyoshi Morita (The University of Electro-Communications),
Akiko Manada (The University of Electro-Communications)
1.1.2  On Writing Capacity of Memory Devises with Restricted State Transitions
 
○Tadashi Wadayama (Nagoya Institute of Technology),
Taisuke Izumi (Nagoya Institute of Technology)
1.1.3  Two-Dimensional Magnetic Recording Codes for Multitrack Recording Channels
 
○Hidetoshi Saito (Kogakuin University), Hirotaka Fukawa (Kogakuin University),
Naoaki Harada (Kogakuin University)
1.1.4  Block Codes for Two Dimensional Magnetic Recording
 
○Hiroshi Kamabe (Gifu University)
   
1.2 Source Coding I - Bayes Codes -
Dec. 10. Wed 10:20〜11:40 Hō Right: ROOM 2

1.2.1  Evaluation of the Minimum Overflow Threshold of Bayes Codes for Non-Stationary Sources
 
◎Takashi Moriya (Waseda University), Shota Saito (Waseda University),
Nozomi Miya (Waseda University), Toshiyasu Matsushima (Waseda University)
1.2.2  Asymptotic Normality and LIL of the Codeword Length of Bayes Codes for Stationary Ergodic Markov Sources
 
◎Shota Saito (Waseda University), Nozomi Miya (Waseda University),
Toshiyasu Matsushima (Waseda University)
1.2.3  Universal Coding and Universal Histogram Sequences
 
○Joe Suzuki (Osaka University)
1.2.4  A Bayes Prediction Algorithm for the Model Class Conditioned by the Cumulative Number of Appearance of Symbol
 
◎Hiromu Auchi (Waseda University), Kenta Mikawa (Waseda University),
Gendo Kumoi (Waseda University), Masayuki Goto (Waseda University)
   
1.3 Signal Processing
Dec. 10. Wed 10:20〜11:20 Nihonkai West: ROOM 3

1.3.1  Construction of Graph Signal Processing Based on Category Theory
 
○Yoshinao Shiraki (Toho University)
1.3.2  A Note on No-Reference Scheme of Measuring the Blocking Effects via Power Cepstrum
 
◎Shumpei Kawano (The University of Electro-Communications),
Hiromu Koda (The University of Electro-Communications)
1.3.3  Theory of the Optimum Approximation in a Filterbank Based on Complex Frequency Analysis, and its Application
 
Yuichi Kida (Ohu University), ○Takuro Kida (Tokyo Institute of Technology)
   
1.4 Cryptography
Dec. 10. Wed 10:20〜11:40 Hanamushiro: ROOM 4

1.4.1  Proposal of Hybrid-Type Inter-Organizational Cryptosystems and the Scheme Using ElGamal Cryptosystem
 
○Yasuyuki Murakami (Osaka Electro-Communication University),
Masao Kasahara (Waseda University, Chuo University)
1.4.2  A Threshold Construction of Authenticated Key Retrieval
 
○SeongHan Shin (AIST), Kazukuni Kobara (AIST)
1.4.3  Ordered Mulsitignatures Made Shorter
 
◎Naoto Yanai (Osaka University), Masahiro Mambo (Kanazawa University),
Eiji Okamoto (University of Tsukuba)
1.4.4  The Ciphertext Integrity of the Length-Preserving CBC Mode
 
○Hidenori Kuwakado (Kansai University)
   
2.1 Coding Theory I - Algebraic Codes -
Dec. 10. Wed 13:00〜14:20 Hō Left: ROOM 1

2.1.1  On Generator Matrices of Codes over a Class of Euclidean Domains
 
○Hajime Matsui (Toyota Technological Institute)
2.1.2  Correction of Errors for Projective RM Codes by Decomposing Projective Space into Affine Spaces
 
◎Norihiro Nakashima (Toyota Technological Institute), Hajime Matsui (Toyota Technological Institute)
2.1.3  A Note on Constant-Weight Codes over Extension Fields and Their Properties
 
○Takayasu Kaida (Kinki University), Junru Zheng (Kyushu Women's University),
Keiichi Takahashi (Kinki University)
2.1.4  On the Calculation Method of Rank Bounded Distance with Conjugate Elements for Cyclic Codes
 
○Junru Zheng (Kyushu Women's University), Takayasu Kaida (Kinki University)
   
2.2 Source Coding II - Random Number Generation and Variable-to-Fixed Length Codes -
Dec. 10. Wed 13:00〜14:20 Hō Right: ROOM 2

2.2.1  Asymptotic Analysis of Random Number Conversion via Restricted Storage
 
○Wataru Kumagai (Kanagawa University),
Masahito Hayashi (Nagoya University/National University of Singapore)
2.2.2  Almost Sure Convergence Coding Theorem of Multishot Tunstall Code for Stationary Memoryless Sources
 
○Mitsuharu Arimura (Shonan Institute of Technology)
2.2.3  A Variable-to-Fixed Length Source Code Attaining the Optimum Average Pointwise Coding Rate
 
○Mitsuharu Arimura (Shonan Institute of Technology)
2.2.4  A Comparison between an Average-Optimal VF Code and Tunstall Code
 
○Mitsuharu Arimura (Shonan Institute of Technology)
   
2.3 Compressed Sensing
Dec. 10. Wed 13:00〜14:20 Nihonkai West: ROOM 3

2.3.1  Image Inpainting Based on Several Autoregressive Models by L1 Norm Minimization
 
◎Masaki Nakanishi (Tokyo University of Science), Tomohiro Takahashi (Tokyo University of Science),
Kazunori Uruma (Tokyo University of Science), Toshihiro Furukawa (Tokyo University of Science)
2.3.2  On Behavior of AMP Algorithm for Super-Resolution by Compressed Sensing
 
◎Misato Takaki (Kyushu University), Kazushi Mimura (Hiroshima City University),
Masanori Kawakita (Kyushu University), Jun'ichi Takeuchi (Kyushu University)
2.3.3  Sparse Representation in Feature Space by a Statistical Mechanical Algorithm
 
○Ayaka Sakata (RIKEN), Yoshiyuki Kabashima (Tokyo Institute of Technology)
2.3.4  Statistical Mechanical Analysis of Overcomplete Basis Compression
 
◎Yoshinori Nakanishi-Ohno (The University of Tokyo,Japan Society for the Promotion of Science),
Tomoyuki Obuchi (Tokyo Institute of Technology), Masato Okada (The University of Tokyo),
Yoshiyuki Kabashima (Tokyo Institute of Technology)
   
2.4 Quantum Information Theory I - Classical-Quantum Channel Coding -
Dec. 10. Wed 13:00〜14:00 Hanamushiro: ROOM 4

2.4.1  Simplification of Formula of Mutual Information for Quantum Signals Coded by a Multi-ary Equidistant Code
 
◎Naoki Iwata (Aichi Prefectural University), Tsuyoshi Sasaki Usuda (Aichi Prefectural University)
2.4.2  Asymptotic Property of Infinite Number of Feedback in Quantum Receiver for M-ary Signals
 
◎Takashi Kondo (Aichi Prefectural University), Kenji Nakahira (Hitachi),
Tsuyoshi Sasaki Usuda (Aichi Prefectural University)
2.4.3  Strong Converse Exponent for Classical-Quantum Channel Coding
 
Milan Mosonyi (Budapest University of Technology and Economics),
○Tomohiro Ogawa (The University of Electro-Communications)
   
3.1 Coding Theory II - Performance Analysis -
Dec. 10. Wed 14:40〜16:00 Hō Left: ROOM 1

3.1.1  Performance Bounds on Asymmetric Slepian-Wolf Coding for Ordered Random Variables
 
◎Kana Deguchi (Kwansei Gakuin University), Yuta Sugimoto (Kwansei Gakuin University),
Motohiko Isaka (Kwansei Gakuin University)
3.1.2  Error Performance and Plotkin Bound of Nonbinary Convolutional Codes for a Trellis Coded MQAM
 
○Tatsumi Konishi (Aichi Institute of Technology), Kazuhiro Sato (Aichi Institute of Technology),
Koichiro Hayashi (Aichi Institute of Technology), Yuki Mizutani (Aichi Institute of Technology)
3.1.3  Error Probability Analyses of Maximum a Posteriori Probability Decoding in Rayleigh Fading Channels
 
◎Daiki Hato (Osaka City University), Yu Morishima (Suzuka College of Technology),
Ikuo Oka (Osaka City University), Shingo Ata (Osaka City University)
3.1.4  A Single Error Correcting Code for a Hexagonal Signal Constellation
 
○Hiroyoshi Morita (The University of Electro-Communications)
   
3.2 Rate Distortion Theory
Dec. 10. Wed 14:40〜16:00 Hō Right: ROOM 2

3.2.1  New Non-Asymptotic Achievability and Converse Bounds for Fixed-Length Lossy Compression
 
◎Tetsunao Matsuta (Tokyo Institute of Technology),
Tomohiko Uyematsu (Tokyo Institute of Technology)
3.2.2  Variable-length Lossy Source Code Using a Constrained-Random-Number Generator Represented by a Sparse Matrix
 
○Jun Muramatsu (NTT Communication Science Laboratories, NTT Corporation)
3.2.3  Source Coding Theorem with a Fidelity Criterion Allowing Some Probability of Union of Overflow and Excess Distortion
 
○Ryo Nomura (Senshu University), Hideki Yagi (The University of Electro-Communications)
3.2.4  Optimistic Coding with an Epsilon-Fidelity Criterion and Strong Converse Theorem
 
○Hideki Yagi (The University of Electro-Communications), Ryo Nomura (Senshu University)
   
3.3 Pattern Recognition and Learning I - Classification and Latent Class Model -
Dec. 10. Wed 14:40〜16:00 Nihonkai West: ROOM 3

3.3.1  A Study of Implementing Weight to Training Data in Large Margin Nearest Neighbor Method for Classification Problems
 
◎Fumihiro Yamazaki (Waseda University), Kenta Mikawa (Waseda University),
Masayuki Goto (Waseda University)
3.3.2  Multi-Topic Document Classification Using The Label Selection Method Based on The Similarity
 
◎Ryutaro Akiyama (Waseda University), Gendo Kumoi (Waseda University),
Kenta Mikawa (Waseda University), Masayuki Goto (Waseda University)
3.3.3  A New Latent Class Model Expressing Both Browsing and Purchasing Behaviors and Its Learning Algorithm
 
◎Naohiro Fujiwara (Waseda University), Kenta Mikawa (Waseda University),
Masayuki Goto (Waseda University)
3.3.4  A Study of Recommender System on Internet Portal Sites for Job Hunting Using Latent Class Model
 
◎Ryo Furuyama (Waseda University), Kenta Mikawa (Waseda University),
Masayuki Goto (Waseda University), Haruaki Yatabe (Recruit Career)
   
3.4 Quantum Information Theory II - Quantum State Estimation and Detection -
Dec. 10. Wed 14:40〜15:40 Hanamushiro: ROOM 4

3.4.1  Parameter Estimation of Quantum Two-Dimensional System with Unknown Phase
 
○Jun Suzuki (The University of Electro-Communications)
3.4.2  Toward Analytical Solution of Channel Matrix for Coded Quantum Signals by Arbitrary Classical Linear Codes over Fq
 
◎Minami Tanaka (Aichi Prefectural University), Tomohiro Sogabe (Aichi Prefectural University),
Keisuke Shiromoto (Kumamoto University), Tsuyoshi Sasaki Usuda (Aichi Prefectural University)
3.4.3  Quantum Gain with Error Probability Criterion for Multi-mode Quantum-state Signals
 
◎Akihito Kadoya (Aichi Prefectural University), Naoki Iwata (Aichi Prefectural University),
Tsuyoshi Sasaki Usuda (Aichi Prefectural University)
   
4.1 Coding Theory III - LDPC Codes (1) -
Dec. 10. Wed 16:20〜17:20 Hō Left: ROOM 1

4.1.1  Computational Complexity of Encoding via Block-Diagonalization for LDPC Codes
 
○Takayuki Nozaki (Kanagawa University)
4.1.2  A Probabilistic Method for Computing the Weight Distribution of Non-Binary LDPC Codes (III)
 
○Masanori Hirotomo (Saga University), Jun'ichi Tsurumi (Kobe University),
Masakatu Morii (Kobe University)
4.1.3  Nonbinary Parallel Concatenated Code for Large MIMO Systems
 
◎Takuya Ishida (Doshisha University), Guanghui Song (Doshisha University),
Masakazu Yoshida (Doshisha University), Jun Cheng (Doshisha University)
   
4.2 Multiterminal Information Theory I - Source Coding -
Dec. 10. Wed 16:20〜17:20 Hō Right: ROOM 2

4.2.1  Revisiting Wyner Source Coding System: A Direct Approach
 
○Tomohiko Uyematsu (Tokyo Institute of Technology),
Tetsunao Matsuta (Tokyo Institute of Technology)
4.2.2  An Information Spectral Approach to a Dichotomy of Functions in Distributed Coding
 
○Shigeaki Kuzuoka (Wakayama University), Shun Watanabe (University of Tokushima)
4.2.3  Source Coding for Markov Sources with Partial Memoryless Side Information at the Decoder
 
○Yasutada Oohama (The University of Electro-Communications)
   
4.3 Pattern Recognition and Learning II - Prediction -
Dec. 10. Wed 16:20〜17:20 Nihonkai West: ROOM 3

4.3.1  A Note on the Effectiveness of Unlabeled Data for Prediction Error in Semi-Supervised Learning
 
◎Ayumu Owada (Waseda University), Goki Yasuda (Waseda University),
Toshiyasu Matsushima (Waseda University)
4.3.2  The Optimal Prediction under Bayes Criterion for Linear Regression Models with Latent Variables
 
◎Ryoma Tsuzuki (Waseda University), Toshiyasu Matsushima (Waseda University)
4.3.3  A Privacy-Preserving Method for Distributed Regularized Least Squares
 
◎Tota Suko (Waseda University), Shunsuke Horii (Waseda University),
Manabu Kobayashi (Shonan Institute of Technology)
   
4.4 Information Network
Dec. 10. Wed 16:20〜17:20 Hanamushiro: ROOM 4

4.4.1  Failure Detection Using Network Coding for Complete Multipartite Graphs
 
◎Yasuki Yoshikawa (The University of Electro-Communications),
Tomohiro Ogawa (The University of Electro-Communications)
4.4.2  A Study on Modeling and Simulation of Cloud Computing
 
◎Yutaro Kuriyama (Tokai University), Hiroshi Yamamoto (Tokai University)
4.4.3  A Note on Virtual Currency Analysis Based on Modern Control Theory
 
○Toru Inoue (Hiroshima Shudo University)
   
5.1 Coding Theory IV - Spatial Coupling (1) -
Dec. 11. Thu 10:20〜11:40 Hō Left: ROOM 1

5.1.1  Universality of Spatially Coupled Punctured LDPC Codes for Decode-and-Forward in Erasure Relay Channels
 
◎Yuta Nakahara (Waseda University), Shota Saito (Waseda University),
Akira Kamatsuka (Waseda University), Toshiyasu Matsushima (Waseda University)
5.1.2  An Algorithmic Proof of Capacity Achievability of Spatially-Coupled MacKay-Neal Codes
 
◎Takuya Okazaki (Tokyo Institute of Technology), Kenta Kasai (Tokyo Institute of Technology)
5.1.3  Rate Compatible Spatially Coupled Codes over Memory Channels
 
○Kenta Kasai (Tokyo Institute of Technology)
5.1.4  Improving Performance of Spatially Coupled Codes for Burst Erasure by Column Permutation of Base Matrix
 
◎Hiroki Mori (Nagoya Institute of Technology), Tadashi Wadayama (Nagoya Institute of Technology)
   
5.2 Source Coding III - Lossless Compression -
Dec. 11. Thu 10:20〜11:40 Hō Right: ROOM 2

5.2.1  How to Construct Direct-Access Decodable VF Codes
 
◎Yuka Kuwaori (The University of Tokyo), Hirosuke Yamamoto (The University of Tokyo)
5.2.2  A Construction of a Two-Dimensional Antidictionary Using Trees
 
○Takahiro Ota (Nagano Prefectural Institute of Technology),
Hiroyoshi Morita (The University of Electro-Communications)
5.2.3  Improving Compression via Substring Enumeration for Degenerated Markov Sources
 
◎Takaichi Akiyama (The University of Electro-Communications),
Tsutomu Kawabata (The University of Electro-Communications)
5.2.4  A Study on ECG Lossless Compression and Power Consumption of Wearable Sensing Device
 
○Takashi Sudo (Toshiba Corporation), Shingo Suzuki (Toshiba Corporation),
Hirokazu Tanaka (Toshiba Corporation), Ryuji Kohno (Yokohama National University)
   
5.3 Communication Systems I - MIMO and Estimation -
Dec. 11. Thu 10:20〜11:40 Nihonkai West: ROOM 3

5.3.1  A Study on Weight Optimization Method for Inter-User Interference Cancellation Precoding using the Gram-Schmidt Orthonormalization for MU-MIMO
 
◎Tadatomo Sato (Tokyo City University), Yuma Kimura (Tokyo City University)
5.3.2  MIMO Detection for High-Order QAM Constellations Based on the FOBOS Algorithm
 
◎Yo Hashimoto (Tokyo University of Science), Katsumi Konishi (Kogakuin University),
Tomohiro Takahashi (Tokyo University of Science), Kazunori Uruma (Tokyo University of Science),
Toshihiro Furukawa (Tokyo University of Science)
5.3.3  A Consideration on Pulse Compression for MIMO Radars Based on Space-Time Coded Complementary Codes
 
◎Daisuke Nose (Kyoto Institute of Technology), Daisuke Umehara (Kyoto Institute of Technology),
Koichiro Wakasugi (Kyoto Institute of Technology)
5.3.4  Experimental Study on Outdoor Positioning in 920MHz Wireless Networks
 
○Tetsuo Tsujioka (Osaka City University), Mai Furusato (Osaka City University),
Kohei Tezuka (Osaka City University), Shigeyoshi Nakajima (Osaka City University),
Hiroyuki Kotani (Vital Information), Yasuhiro Takahashi (Vital Information)
   
5.4 Fundamentals of Information Theory
Dec. 11. Thu 10:20〜11:20 Hanamushiro: ROOM 4

5.4.1  An Operational Characterization of the Notion of Probability by Algorithmic Randomness
 
○Kohtaro Tadaki (Chuo University)
5.4.2  Combinatorial Inequalities for Submodular Functions and Their Applications to Information Theory
 
Yuta Kishi (Tokyo University of Science), ○Nozomu Ochiumi (Shonan Institute of Technology),
Masahiro Yanagida (Tokyo University of Science)
5.4.3  Calculation on Markov Basis by Eliminating the Variable of Polynomials
 
◎Taiki Osawa (Shizuoka Institute of Science and Technology),
Kousuke Otani (Shizuoka Institute of Science and Technology),
Takeshi Matsuda (Shizuoka Institute of Science and Technology)
   
6.1 Coding Theory V - LDPC Codes (2) -
Dec. 11. Thu 13:00〜14:00 Hō Left: ROOM 1

6.1.1  Box-Plus BP-Based Algorithm by Linear Approximation
 
◎Gou Hosoya (Tokyo University of Science), Hiroyuki Yashima (Tokyo University of Science)
6.1.2  Low Complexity 3-bit LDPC-LUT Decoding Algorithm
 
◎Francisco Javier Cuadros Romero (Japan Advanced Institute of Science and Technology),
Brian Kurkoski (Japan Advanced Institute of Science and Technology)
6.1.3  Construction of Array LDLC Lattices
 
◎Ricardo Antonio Parrao Hernandez (Japan Advanced Institute of Science and Technology),
Brian Kurkoski (Japan Advanced Institute of Science and Technology)
   
6.2 Multiterminal Information Theory II - Security and Reliability -
Dec. 11. Thu 13:00〜14:00 Hō Right: ROOM 2

6.2.1  Numerical Calculations of Reliability and Secrecy Functions of the Wiretap Channels under Cost Constraint
 
◎Hiroyuki Endo (National Institute of Information and Communications Technology, Waseda University),
Te Sun Han (National Institute of Information and Communications Technology),
Masahide Sasaki (National Institute of Information and Communications Technology)
6.2.2  Secure Analysis of Common Key Cryptosystem with Security Criterion of Average Distortion
 
◎Hiroshi Ito (The University of Electro-Communications),
Yasutada Oohama (The University of Electro-Communications)
6.2.3  The Error Exponent of Zero-Rate Multiterminal Hypothesis Testing: Examples of Sources Not Satisfying the Positivity Condition
 
◎Makoto Ueda (Wakayama University), Shigeaki Kuzuoka (Wakayama University)
   
6.3 Sequences
Dec. 11. Thu 13:00〜14:00 Nihonkai West: ROOM 3

6.3.1  An Algorithm for Generating All CR Sequences in the de Bruijn Sequences of Length 2n where n is Any Odd Number
 
○Hiroshi Fujisaki (Kanazawa University)
6.3.2  A Geometric Sequence Generated by Primitive Polynomial and Power Residue Property over Odd Characteristic Field
 
◎Keisuke Tebe (Okayama University), Yasuyuki Nogami (Okayama University),
Satoshi Uehara (The University of Kitakyushu)
6.3.3  A ZCZ Sequence Pair Set Using Extended Complementary Codes for MIMO Radar
 
◎Takuma Nishiyama (Kyoto Institute of Technology), Daisuke Umehara (Kyoto Institute of Technology), Koichiro Wakasugi (Kyoto Institute of Technology)
   
6.4 Quantum Information Theory III - Quantum Error Correction -
Dec. 11. Thu 13:00〜14:00 Hanamushiro: ROOM 4

6.4.1  Reduction of the Number of Measurements of Non-destructive Collective Decoding by Using Idea of Quantum Error-Correcting Codes
 
◎Kazuki Sato (Meijo University), Shogo Usami (Meijo University),
Tsuyoshi Sasaki Usuda (Aichi Prefectural University)
6.4.2  Evaluation of Entanglement Distillation Protocols using Exponential Lower Bounds on the Fidelity
 
◎Daichi Sasaki (Aichi Prefectural University),
Tsuyoshi Sasaki Usuda (Aichi Prefectural University)
6.4.3  Quantum Error-Correcting Codes Using Solutions to the Mean King's Problem
 
◎Takaaki Masuhara (Doshisha University), Yusuke Miyagoshi (Doshisha University),
Masakazu Yoshida (Doshisha University),
Gen Kimura (Shibaura Institute of Technology), Jun Cheng (Doshisha University)
   
7.1 Coding Theory VI - Spatial Coupling (2) -
Dec. 11. Thu 14:20〜15:20 Hō Left: ROOM 1

7.1.1  Rate-Compatible Spatially Coupled Repeat-Accumulate Codes
 
◎Akiyoshi Kimura (Doshisha University), Wei Hou (Doshisha University),
Masakazu Yoshida (Doshisha University), Jun Cheng (Doshisha University)
7.1.2  Concatenated Codes by Spatial Coupling
 
◎Wei Hou (Doshisha University), Shan Lu (Doshisha University), Jun Cheng (Doshisha University)
7.1.3  EXIT Chart Analysis of Spatially Coupled BICM with 8 PSK
 
○Keigo Takeuchi (The University of Electro-Communications)
   
7.2 Source Coding IV - Variable Length Codes -
Dec. 11. Thu 14:20〜15:20 Hō Right: ROOM 2

7.2.1  On Improvement of Formalization of the Variable-Length Source Coding Theorem
 
○Manabu Hagiwara (Chiba University), Ryosuke Obi (Chiba University)
7.2.2  Formalization of the Variable-Length Source Coding Theorem: Converse Part
 
◎Ryosuke Obi (Chiba University), Manabu Hagiwara (Chiba University),
Mitsuharu Yamamoto (Chiba University)
7.2.3  The Minimum Number of Partitions for Encoding Tasks and the Rényi Entropy
 
○Hiroki Koga (University of Tsukuba)
   
7.3 Pattern Recognition and Learning III - Optimization and Model Evaluation -
Dec. 11. Thu 14:20〜15:20 Nihonkai West: ROOM 3

7.3.1  A Note on the Linear Bandit Problem with Multiple Parameters
 
◎Shunsuke Horii (Waseda University), Toshiyasu Matsushima (Waseda University),
Shigeichi Hirasawa (Waseda University)
7.3.2  A Study of Distance Metric Learning by Considering the Distances between Category Centroids
 
◎Kenta Mikawa (Waseda University), Manabu Kobayashi (Shonan Institute of Technology),
Masayuki Goto (Waseda University), Shigeichi Hirasawa (Waseda University)
7.3.3  On MDL Principle for Non-negative Matrix Factorization
 
◎Yuki Kawamura (Kyushu University), Masanori Kawakita (Kyushu University),
Noboru Murata (Waseda University), Jun'ichi Takeuchi (Kyushu University)
   
7.4 Computation of Channel Capacities
Dec. 11. Thu 14:20〜15:20 Hanamushiro: ROOM 4

7.4.1  Acceleration of an Arimoto-Blahut-type Algorithm for Channels with Memories
 
◎Naoki Tominaga (The University of Electro-Communications),
Hiroshi Nagaoka (The University of Electro-Communications)
7.4.2  On the Input Symbols that Achieve the Channel Capacity
 
○Kenji Nakagawa (Nagaoka University of Technology), Kohei Watabe (Nagaoka University of Technology)
7.4.3  An Algorithm for Capacity Region of Degraded Broadcast Channels
 
◎Atsushi Arai (The University of Electro-Communications),
Yasutada Ohama (The University of Electro-Communications)
   
8.1 Coding Theory VII - Construction and Decoding -
Dec. 12. Fri 9:00〜10:20 Hō Left: ROOM 1

8.1.1  Quantizer Design for Outputs of Binary-input Discrete Memoryless Channels by Using Dual Processor
 
◎Takumi Nagahara (University of Fukui), Ken-ichi Iwata (University of Fukui)
8.1.2  Distance Distribution of Nonlinear Codes Defined by a Dense Matrix and a Nonlinear Function
 
○Kazushi Mimura (Hiroshima City University)
8.1.3  Computer Searches for High Rate Punctured Convolutional Codes by Using Dual Codes
 
◎Kana Kikuchi (Kinki University), Sen Moriya (Kinki University), Hiroshi Sasano (Kinki University)
8.1.4  On Decoding Method of Symbol-Pair Codes Constructed from Cyclic Codes
 
◎Makoto Takita (Kobe University), Masanori Hirotomo (Saga University),
Masakatu Morii (Kobe University)
   
8.2 Multiterminal Information Theory III - Channel Coding -
Dec. 12. Fri 9:00〜10:00 Hō Right: ROOM 2

8.2.1  The Capacity Region of General Multiple Access Channel with Partially Cooperating Encoders
 
◎Ayato Murakoshi (The University of Electro-Communications),
Hideki Yagi (The University of Electro-Communications)
8.2.2  Some Remarks on Lower Bounds on the Error Probability for Classical and Quantum Multiple Access Channels
 
◎Takuya Kubo (The University of Electro-Communications),
Hiroshi Nagaoka (The University of Electro-Communications)
8.2.3  Applying Write Once Memory Codes to Asymmetric Multiple Access Channel with Errors
 
◎Ryota Sekiya (Japan Advanced Institute of Science and Technology),
Erick Christian Garcia Alvarez (Japan Advanced Institute of Science and Technology),
Brian Kurkoski (Japan Advanced Institute of Science and Technology),
Hideki Yagi (The University of Electro-Communications)
   
8.3 Communication Systems II - UWB and Error Control -
Dec. 12. Fri 9:00〜10:20 Nihonkai West: ROOM 3

8.3.1  A Selective-Repeat ARQ Scheme with Finite Buffer Selecting the Retransmission Protocol According to the Number of Error Frames
 
◎Munesato Wada (Kanagawa Institute of Technology),
Makoto Nakamura (Kanagawa Institute of Technology),
Hideyuki Torii (Kanagawa Institute of Technology)
8.3.2  Study on Transmitting Pulses for Breast Cancer Detection UWB Radar considering Propagation Characteristics
 
◎Yuta Okuyama (Yokohama National University), Pham Thanh Hiep (Yokohama National University),
Kotaro Yamasue (Yokohama National University, Yokohana City University),
Chika Sugimoto (Yokohama National University), Ryuji Kohno (Yokohama National University)
8.3.3  Study of Error Control Scheme Considering Various QoS in Multi-WBAN Environment
 
◎Kento Takabayashi (Yokohama National University),
Hirokazu Tanaka (Yokohama National University,
Universit of Oulu Research Institute Japan - CWC-Nippon),
Chika Sugimoto (Yokohama National University),
Ryuji Kohno (Yokohama National University, University of Oulu Research Institute Japan - CWC-Nippon)
8.3.4  Interference Mitigation for UWB-WBAN on Inter User and Inter System Interference Channel
 
◎Takumi Kobayashi (Yokohama National University), Chika Sugimoto (Yokohama National University), Ryuji Kohno (Yokohama National University)
   
8.4 Graphs and Integers
Dec. 12. Fri 9:00〜10:20 Hanamushiro: ROOM 4

8.4.1  Probability Distributions of the Distance Between the Rumor Source and Its Estimation on Regular Trees
 
◎Tetsunao Matsuta (Tokyo Institute of Technology), Tomohiko Uyematsu (Tokyo Institute of Technology)
8.4.2  On the Diameters of Distributed Line Plus Graphs
 
◎Akiko Manada (The University of Electro-Communications),
Hiroyoshi Morita (The University of Electro-Communications)
8.4.3  Numerical Results for Moat Problems over Imaginary Quadratic Fields
 
◎Shinji Kinoshita (Toyota Technological Institute), Hajime Matsui (Toyota Technological Institute)
8.4.4  A Convolution Theorem and Fast Multiplication for a Class of Multi-Valued Logic Polynomials
 
◎Yusuke Tanikawa (Toyota Technological Institute), Hajime Matsui (Toyota Technological Institute),
Daiki Kimura (Toyota Technological Institute)
   
9.1 Coding Theory VIII - Channel Coding -
Dec. 12. Fri 10:40〜12:00 Hō Left: ROOM 1

9.1.1  Performance Analysis on Broadcast ARQ Scheme Based on Index Coding
 
◎Takahiro Oshima (Nagoya Institute of Technology),
Tadashi Wadayama (Nagoya Institute of Technology)
9.1.2  Performance of Write-Once Memory Codes Applied to Asymmetric Multiple Access Channel
 
◎Erick Christian Garcia Alvarez (Japan Advanced Institute of Science and Technology),
Brian Kurkoski (Japan Advanced Institute of Science and Technology),
Ryota Sekiya (Japan Advanced Institute of Science and Technology)
9.1.3  Approaching Multiple-Access Channel Capacity by Repetition-Aided Irregular Repeat-Accumulate Code
 
◎Guanghui Song (Doshisha University), Haifeng Han (Doshisha University),
Jun Cheng (Doshisha University)
9.1.4  A Family of T-User Codes for Noisy Multiple-Access Adder Channel
 
◎Shan Lu (Doshisha University), Wei Hou (Doshisha University), Jun Cheng (Doshisha University)
   
9.2 Reliability Function
Dec. 12. Fri 10:40〜11:40 Hō Right: ROOM 2

9.2.1 Asymptotic Behavior of Error Probabilities for Continuous-Time Gaussian Channels with Feedback
 
○Shunsuke Ihara (Nagoya University)
9.2.2  Range of Reliability Functions among Ternary-Input Memoryless and Symmetric Channels with Same Capacity
 
◎Yuta Sakai (University of Fukui), Ken-ichi Iwata (University of Fukui)
9.2.3An Asymptotically Matching Evaluation of Random Coding Error Probability
○Junya Honda (The University of Tokyo)
   
9.4 Quantum Information Theory IV - Quantum Entropy and Quantum Computation -
Dec. 12. Fri 10:40〜11:40 Hanamushiro: ROOM 4

9.4.1  Study on Non-Existence of Solutions to Mean King's Problem with Shannon Entropy
 
◎Toru Kuriyama (Doshisha University), Takaaki Masuhara (Doshisha University),
Masakazu Yoshida (Doshisha University), Jun Cheng (Doshisha University)
9.4.2  Non-Hermitian Type Uncertainty Relation and its Application
 
○Kenjiro Yanagi (Yamaguchi University)
9.4.3  Problem and Solution in Computing Linear Equations with Quantum Algorithm
 
◎Souichi Takahira (Aichi Prefectural University), Daichi Sasaki (Aichi Prefectural University),
Tomohiro Sogabe (Aichi Prefectural University), Tsuyoshi Sasaki Usuda (Aichi Prefectural University)


◎:The presentation for SITA encouragement award, ○:A regular presentation