Toshihisa NISHIJIMA


On the Minimum Distance of Concatenated Codes and Decoding Method up to the True Minimum Distance
Toshiyuki KOHNOSU Toshihisa NISHIJIMA Shigeichi HIRASAWA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1997/11/25
Vol. E80-A  No. 11  pp. 2111-2116
Type of Manuscript:  Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Coding Theory
Keyword: 
concatenated codeminimum distancecomplete weight enumeratorReddy-Robinson algorithmdecoding method beyond the BCH bound
 Summary | Full Text:PDF(478.5KB)

On the Minimum Distance of Binary Concatenated Codes
Toshiyuki KOHNOSU Toshihisa NISHIJIMA Shigeichi HIRASAWA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1997/05/25
Vol. E80-A  No. 5  pp. 922-923
Type of Manuscript:  LETTER
Category: Information Theory and Coding Theory
Keyword: 
concatenated codeminimum distance
 Summary | Full Text:PDF(126.3KB)

On Asymptotic Distance Ratios for the Constructive Concatenated Codes with Unequal Error Protection
Toshihisa NISHIJIMA Hiroaki ISHII Hiroshige INAZUMI Shigeichi HIRASAWA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1991/03/25
Vol. E74-A  No. 3  pp. 512-519
Type of Manuscript:  PAPER
Category: Information Theory and Coding Theory
Keyword: 
 Summary | Full Text:PDF(577.9KB)

A Further Improvement of the Performance for the Original Iterated Codes
Toshihisa NISHIJIMA Hiroshige INAZUMI Shigeichi HIRASAWA 
Publication:   IEICE TRANSACTIONS (1976-1990)
Publication Date: 1989/02/25
Vol. E72-E  No. 2  pp. 104-110
Type of Manuscript:  PAPER
Category: Information Theory and Coding Theory
Keyword: 
 Summary | Full Text:PDF(498.7KB)