Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct
We give simple algorithms for the construction of generator matrices for minimal tail-biting trellises for a powerful and practical subclass of the linear cyclic codes, from which the combinatorial representation in the form of a graph can be obtained by standard procedures.
Keywordslinear block codes cyclic codes Reed-Solomon codes tail-biting trellises
Unable to display preview. Download preview PDF.
- 4.Harmeet Singh, On Tail-Biting Trellises for Linear Block Codes, M.E. Thesis, Department of Electrical Communication Engineering, Indian Institute of Science, Bangalore, 2001.Google Scholar
- 5.Ralf Kotter and Vardy, A.,Construction of Minimal Tail-Biting Trellises, in Proceedings IEEE Information Theory Workshop (Killarney, Ireland, June 1998), 72–74.Google Scholar
- 7.F.J. MacWilliams and N.J.A. Sloane,The Theory of Error Correcting Codes, North-Holland, Amsterdam, 1981Google Scholar
- 8.J.L. Massey, Foundations and methods of channel encoding, in Proc. Int. Conf. on Information Theory and Systems 65(Berlin, Germany) Sept 1978.Google Scholar
- 11.Priti Shankar, P.N.A. Kumar, K. Sasidharan and B.S. Rajan, ML decoding of block codes on their tail-biting trellises, to appear in Proceedings of the 2001 IEEE International Symposium on Information Theory.Google Scholar
- 13.A. Vardy, Trellis structure of codes, in Handbook of Coding Theory,V.S. Pless and W.C. Huffman, Eds., Elsevier Science, 1998.Google Scholar
- 15.J.K. Wolf, Efficient maximum-likelihood decoding of linear block codes using a trellis, IEEE Trans. Inform. Theory 24, pp 76–80.Google Scholar