Abstract
In this paper, a new approach of constructing tailbiting trellises for linear block codes is presented. It is proved that any minimal tail-biting trellis can be constructed by the recursive process of uniting two isomorphic subgraphs from the well-known Bahl-Cocke-Jelinek-Raviv(BCJR) constructed conventional trellises. Furthermore, several properties of isomorphic constructions of tail-biting trellises are discussed.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the Second International Conference on Communications and Networking in China, ChinaCom 2007 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 585-589 |
| Number of pages | 5 |
| ISBN (Print) | 9781424410095 |
| DOIs | |
| Publication status | Published - 2007 Jan 1 |
| Event | 2007 2nd International Conference on Communications and Networking in China, ChinaCom 2007 - Shanghai, China Duration: 2007 Aug 22 → 2007 Aug 24 |
Publication series
| Name | Proceedings of the Second International Conference on Communications and Networking in China, ChinaCom 2007 |
|---|
Other
| Other | 2007 2nd International Conference on Communications and Networking in China, ChinaCom 2007 |
|---|---|
| Country | China |
| City | Shanghai |
| Period | 07/8/22 → 07/8/24 |
Fingerprint
ASJC Scopus subject areas
- Computer Networks and Communications
- Electrical and Electronic Engineering
Cite this
Jianqin, Z., & Ohtsuki, T. (2007). Isomorphic constructions of tail-biting trellises for linear block codes. In Proceedings of the Second International Conference on Communications and Networking in China, ChinaCom 2007 (pp. 585-589). [4469459] (Proceedings of the Second International Conference on Communications and Networking in China, ChinaCom 2007). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/CHINACOM.2007.4469459