Rajan, B. S. (1993) On cyclic product codes In: Proceedings of the IEEE International Symposium on Information Theory, 1993, 17-22 Jan. 1993, San Antonio, TX, USA.
Full text not available from this repository.
Official URL: http://ieeexplore.ieee.org/document/748716/
Related URL: http://dx.doi.org/10.1109/ISIT.1993.748716
Abstract
It is known that when the blocklengths of two cyclic codes are relatively prime their product code is cyclic when serialized using Chinese Remainder Theorem. When the block lengths are equal we characterize product codes that are cyclic when serialized either rowwise or columnwise.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Source: | Copyright of this article belongs to Institute of Electrical and Electronics Engineers. |
| ID Code: | 111275 |
| Deposited On: | 08 Dec 2017 10:36 |
| Last Modified: | 08 Dec 2017 10:36 |
Repository Staff Only: item control page
