It is well known that time-varying convolutional codes can achieve the capacity of a discrete memoryless channel . The time varying assumption is needed in the proof to assure pairwise independency between the codewords. In this work we provide a relatively simple proof that indeed time-invariant convolutional codes can achieve the capacity without any restriction (albeit, the error exponent achieved by our proof may not be the optimal).
|Number of pages||1|
|State||Published - 1995|
|Event||Proceedings of the 1995 IEEE International Symposium on Information Theory - Whistler, BC, Can|
Duration: 17 Sep 1995 → 22 Sep 1995
|Conference||Proceedings of the 1995 IEEE International Symposium on Information Theory|
|City||Whistler, BC, Can|
|Period||17/09/95 → 22/09/95|