MK01

S. A. Miri, F. R. Kschischang. Convolutional Codes on Trees and Cayley Graphs. In Proceedings of The The 2001 Canadian Workshop on Information Theory (CWIT), Pages 201-205, Vancouver, Canada, June 2001.

Abstract

Convolutional codes are usually defined as shift-invariant linear or more generally group systems over the integer discrete-time index set $\mathbb{Z}$. In this work, we generalize the notion of discrete-time index sets to infinite regular trees. By viewing the infinite regular tree as the Cayley graph of a free group, and taking the group generators as shift operators on the tree vertices, we may define general shift-invariant group systems and, in particular, convolutional codes on trees. Relative to their conventional time axis counterparts, such codes may have larger minimum Hamming distance for the same state-space complexity. We also introduce a generalization of conventional tail-biting to deal with termination of such codes

Contact

S.A. Miri
F. R. Kschischang

BibTex Reference

@InProceedings{MK01,
   Author = {Miri, S. A. and Kschischang, F. R.},
   Title = {Convolutional Codes on Trees and Cayley Graphs},
   BookTitle = {Proceedings of The The 2001 Canadian Workshop on Information Theory (CWIT)},
   Pages = {201--205},
   Address = {Vancouver, Canada},
   Month = {June},
   Year = {2001}
}

EndNote Reference [help]

Get EndNote Reference (.ref)