For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
On the Minimum Distance of Binary Concatenated Codes
Toshiyuki KOHNOSU Toshihisa NISHIJIMA Shigeichi HIRASAWA
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1997/05/25
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Information Theory and Coding Theory
concatenated code, minimum distance,
Full Text: PDF(126.3KB)>>
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.