IEICE Technical Committee Submission System
Conference Schedule		 Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 10 of 10  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
IT, ISEC, WBS 2019-03-07
15:05		 Tokyo University of Electro-Communications Innovations, σ-Fields, and Martingales Associated with Viterbi Decoding of Convolutional Codes
Masato Tajima IT2018-98 ISEC2018-104 WBS2018-99		 In the previous paper, by comparing with the results in the linear filtering theory, we have introduced the notion of in... [more] IT2018-98 ISEC2018-104 WBS2018-99
pp.137-142
ISEC, WBS, IT 2017-03-09
14:25		 Tokyo TOKAI University Trellis Reduction for Tail-Biting Convolutional Codes Using Characteristic Matrices and Cyclically Shifted Code-Subsequences
Masato Tajima IT2016-108 ISEC2016-98 WBS2016-84		 Trellis reduction for tail-biting convolutional codes is investigated. A given tail-biting (TB) convolutional code is re... [more] IT2016-108 ISEC2016-98 WBS2016-84
pp.61-66
IT, ISEC, WBS 2016-03-10
16:20		 Tokyo The University of Electro-Communications Algebraic Construction of KV Trellises for Linear Block Codes
Masato Tajima IT2015-120 ISEC2015-79 WBS2015-103		 In this paper, we present an algebraic construction of Koetter-Vardy (KV) trellises. The proposed method is based on the... [more] IT2015-120 ISEC2015-79 WBS2015-103
pp.119-124
IT 2015-07-13
14:50		 Tokyo Tokyo Institute of Technology Tail-Biting Trellises for a Tail-Biting Convolutional Code
Masato Tajima IT2015-25		 In this paper, we investigate the tail-biting trellis structure and its complexity of a linear block code derived from a... [more] IT2015-25
pp.47-52
IT 2014-07-18
16:50		 Hyogo Kobe University Tail-Biting Code/Error-Trellis Construction for Linear Block Codes
Masato Tajima, Koji Okino, Tatsuto Murayama (Univ. of Toyama) IT2014-39		 In this paper, we present a tail-biting error-trellis construction for linear block codes. The proposed construction is ... [more] IT2014-39
pp.153-158
ISEC, IT, WBS 2014-03-11
16:30		 Aichi Nagoya Univ., Higashiyama Campus Reduction of Error-Trellises for Tail-Biting Convolutional Codes Using Shifted Error-Subsequences
Masato Tajima, Koji Okino, Tatsuto Murayama (Univ. of Toyama) IT2013-92 ISEC2013-121 WBS2013-81		 In this paper, we discuss the reduction of error-trellises for tail-biting convolutional codes. In the case where a spec... [more] IT2013-92 ISEC2013-121 WBS2013-81
pp.241-248
IT, ISEC, WBS 2012-03-01
15:20		 Kanagawa   Error-Trellis Construction for Tailbiting Convolutional Codes
Masato Tajima, Koji Okino, Takashi Miyagoshi (Univ. of Toyama) IT2011-59 ISEC2011-86 WBS2011-60		 In this paper, we present an error-trellis construction for tailbiting convolutional codes. A tailbiting error-trellis i... [more] IT2011-59 ISEC2011-86 WBS2011-60
pp.85-90
ISEC, IT, WBS 2011-03-03
14:00		 Osaka Osaka University [Invited Talk] Code/Error-Trellis Construction for Convolutional Codes Using Shifted Code/Error-Subsequences
Masato Tajima, Koji Okino, Takashi Miyagoshi (Univ. of Toyama) IT2010-73 ISEC2010-77 WBS2010-52		 In this paper, we present a code/error-trellis construction for convolutional codes using shifted code/error-subsequence... [more] IT2010-73 ISEC2010-77 WBS2010-52
pp.37-44
IT, ISEC, WBS 2010-03-04
11:40		 Nagano Nagano-Engineering Campus, Shinshu University 1-State Error-Trellis Decoding of LDPC Convolutional Codes Based on Circulant Matrices
Masato Tajima, Koji Okino, Takashi Miyagoshi (Univ. of Toyama) IT2009-95 ISEC2009-103 WBS2009-74		 We consider the decoding of convolutional codes using an error trellis constructed based on a submatrix of a given check... [more] IT2009-95 ISEC2009-103 WBS2009-74
pp.153-158
WBS, IT, ISEC 2009-03-09
10:50		 Hokkaido Hakodate Mirai Univ. Error-Trellis State Complexity of LDPC Convolutional Codes Based on Circulant Matrices
Masato Tajima, Koji Okino, Takashi Miyagoshi (Univ. of Toyama) IT2008-61 ISEC2008-119 WBS2008-74		 Let H(D) be the parity-check matrix of an LDPC convolutional code corresponding to the parity-check matrix H of a quasi-... [more] IT2008-61 ISEC2008-119 WBS2008-74
pp.109-116
 Results 1 - 10 of 10  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
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]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan