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   Vol.E80-A   No.5   pp.922-923
Publication Date: 1997/05/25
Online ISSN: 
DOI: 
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Information Theory and Coding Theory
Keyword: 
concatenated code,  minimum distance,  

Full Text: PDF(126.3KB)>>
Buy this Article




Summary: 
Concatenated codes have many remarkable properties from both the theoretical and practical viewpoints. The minimum distance of a concatenated code is at least the product of the minimum distances of an outer code and an inner code. In this paper, we shall study on a condition that the minimum distance of concatenated codes is beyond the lower bound.