Rajan, B. S. ; Viswanath, G. (2000) Minimal tail-biting trellises for linear MDS codes over F/sub p/m In: Proceedings of the IEEE International Symposium on Information Theory, 2000, 25-30 June 2000, Sorrento, Italy.
Full text not available from this repository.
Related URL: http://dx.doi.org/10.1109/ISIT.2000.866408
Abstract
For all linear (n,k,d) MDS codes over finite fields F/sub p/m we identity a generator matrix with the property that the product of trellises of rows of the generator matrix will give a minimal tail-biting linear trellis, and viewing the code as a group code, identify a set of generators, the product of whose trellises will give a minimal tail biting group trellis. We also give the necessary and sufficient condition for the existence of flat minimal linear and group tail-biting trellises.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Source: | Copyright of this article belongs to Institute of Electrical and Electronics Engineers. |
| ID Code: | 111263 |
| Deposited On: | 08 Dec 2017 10:36 |
| Last Modified: | 08 Dec 2017 10:36 |
Repository Staff Only: item control page
