|
|
Technical Committee on Information Theory (IT) (Searched in: 2016)
|
|
Search Results: Keywords 'from:2016-09-02 to:2016-09-02'
|
[Go to Official IT Homepage (Japanese)] |
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Ascending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
IT |
2016-09-02 09:35 |
Saga |
New Heartpia |
Constellation Shaping with Pilot Bit for Bit-interleaved Coded Modulation Yuki Taniguchi, Gou Hosoya, Hiroyuki Yashima (TUS) IT2016-34 |
We propose a novel constellation shaping scheme for BICM using pilot bit.
Our proposed scheme does not need iteration b... [more] |
IT2016-34 pp.1-6 |
IT |
2016-09-02 10:00 |
Saga |
New Heartpia |
On Error Correction Capability of Irregular LDPC Codes under the Bit-Flipping Decoding Algorithm Hiroto Tamiya (Kobe Univ.), Masanori Hirotomo (Saga Univ.), Masakatu Morii (Kobe Univ.) IT2016-35 |
The error-correction capability of LDPC codes for iterative decoding algorithms have been investigated. However, it is d... [more] |
IT2016-35 pp.7-12 |
IT |
2016-09-02 10:25 |
Saga |
New Heartpia |
Construction, Encoding, and Decoding of Polar Codes with Multilevel Polarization for $q$-Ary Input Generalized Erasure Channels Tomoyuki Kiuchi, Yuta Sakai, Ken-ichi Iwata (Univ. of Fukui) IT2016-36 |
On polar codes, the size of the alphabet to be considered grows double-exponentially with the number of polar transforma... [more] |
IT2016-36 pp.13-18 |
IT |
2016-09-02 11:00 |
Saga |
New Heartpia |
Construction and Properties of Multigraph Codes from Complete M-partite Graphs Yoshiyuki Sakamaki, Yuta Kumano (Toshiba) IT2016-37 |
Graph code is constructed by a simple undirected graph and component codes which defined on any vertices of the graph. V... [more] |
IT2016-37 pp.19-24 |
IT |
2016-09-02 11:25 |
Saga |
New Heartpia |
Consideration of continuous elements pattern for Roos bound on cyclic codes Junru Zheng (Kyushu Women's Univ.), Takayasu Kaida (Kinndai Univ.) IT2016-38 |
For cyclic codes, many lower bounds are suggested.
The Roos bound is one of the well-known lower bounds for the minimu... [more] |
IT2016-38 pp.25-28 |
IT |
2016-09-02 13:10 |
Saga |
New Heartpia |
[Invited Talk]
BICM-ID using Soft Interference Cancellar for NOFDM Transmission Tadatomo Sato (Tokyo City Univ.) IT2016-39 |
[more] |
IT2016-39 pp.29-34 |
IT |
2016-09-02 14:10 |
Saga |
New Heartpia |
Speed-Up Method for Optimal Quantizations of Binary-Input Discrete Memoryless Channels with Monge Property Yuta Sakai, Ken-ichi Iwata (Univ. of Fukui) IT2016-40 |
This study examines quantizations for outputs of binary-input discrete memoryless channels (B-DMCs) by concatenating a D... [more] |
IT2016-40 pp.35-40 |
IT |
2016-09-02 14:35 |
Saga |
New Heartpia |
Channel Resolvability over Single and Compound Channels Hideki Yagi (UEC) IT2016-41 |
In the problem of channel resolvability, where a given output probability distribution via a channel is approximated by ... [more] |
IT2016-41 pp.41-46 |
|
|
|
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)
|
[Return to Top Page]
[Return to IEICE Web Page]
|