Good concatenated code ensembles for the binary erasure channel
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
Hi-index | 754.84 |
This correspondence presents an upper bound on the minimum distance of serially concatenated codes with interleaver where the inner code is a systematic recursive convolutional encoder and the outer code is any convolutional encoder. The resulting expression shows that the minimum distance of the concatenated code cannot grow more than O(K1-1/df (O)), where K is the information word length, and df (O) is the free distance of the outer code. The obtained upper bound is shown to agree with and, in some cases, improve over previously known results