|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
RCS, SIP, IT |
2022-01-21 13:30 |
Online |
Online |
Slepian-Wolf Coding Theorems Considering Costs for Codewords Naoki Ueda, Tomohiko Uyematsu (Tokyo Tech) IT2021-81 SIP2021-89 RCS2021-249 |
Many codes used for source coding assume that the costs for transmitting and recording each symbol are uniform, and code... [more] |
IT2021-81 SIP2021-89 RCS2021-249 pp.295-300 |
IT |
2018-07-19 15:55 |
Nara |
Yamato Kaigishitsu |
On the Minimum Cost of Information Erasure for Stationary Memoryless Sources Naruaki Amada, Hideki Yagi (Univ. of Electro-Comm.) IT2018-17 |
In order to erase data including confidential information stored in the storage device, overwriting an unrelated and ran... [more] |
IT2018-17 pp.25-29 |
IT |
2015-07-13 11:15 |
Tokyo |
Tokyo Institute of Technology |
An Improvement on the Almost Sure Convergence Coding Theorems of One-shot and Multi-shot Tunstall Codes Mitsuharu Arimura (Shonan Inst. Tech.) IT2015-20 |
Almost sure convergence coding theorem have been proved for one-shot and multi-shot Tunstall codes. In the theorems, it ... [more] |
IT2015-20 pp.17-22 |
IBISML |
2012-06-20 14:50 |
Kyoto |
Campus plaza Kyoto |
An MDL-based Change-Detection Algorithm for Piecewise Stationay Memoryless Sources with Multi-dimensional Parameter Hiroki Kanazawa, Kenji Yamanishi (Univ. of Tokyo) IBISML2012-9 |
Kleinberg has proposed an algorithm for detecting bursts from a data sequence, which has turned out to be effective in t... [more] |
IBISML2012-9 pp.57-64 |
ISEC, IT, WBS |
2008-02-29 10:20 |
Tokyo |
|
A Construction of Channel Code, Joint Source-Channel Code, and Universal Code for Arbitrary Stationary Memoryless Channels using Sparse Matrices Shigeki Miyake, Jun Muramatsu (NTT) IT2007-53 ISEC2007-150 WBS2007-84 |
A channel code is constructed using sparse matrices for stationary memoryless
channels that do not necessarily have a s... [more] |
IT2007-53 ISEC2007-150 WBS2007-84 pp.29-36 |
|
|
|
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]
|