嵌入法构造线性分组码咬尾网格

下载PDF

导出

摘要设计了一种新的构造咬尾网格方法——嵌入法,基本思想是把一个线性分组码的咬尾网格嵌入到另一个线性分组码的传统网格中。举例说明如何用这种方法构造咬尾网格并给出了有关的结论及其证明。

作者谢振飞

机构地区滁州学院计算机科学与技术系

出处《滁州学院学报》 2009年第2期49-51,共3页 Journal of Chuzhou University

关键词线性分组码传统网格咬尾网格嵌入法

参考文献11

1Bahl L,Cocke J,Jelinek F,et al.Optimal decoding of linear codes for minimizing symbol error rate[J].IEEE Trans.On Information Theory,1974,20 (2):284-287.
2Wolf J.Efficient maximum-likelihood decoding of linear block codes using a trellis[J].IEEE Trans.on Information Theory,1978,24(1):76-80.
3Muder D J.Minimal trellises for block codes[J].IEEE Trans.on Information Theory,1988,34(5):1049-1053.
4Kschisehang F,Sorokine V.On the trellis structure of block codes[J].IEEE Trans.on Information Theory,1995,41 (6):1924-1937.
5McEliece R.On the BCJR trellis for linear block codes[J].IEEE Trans.on Information Theory,1996,42 (4):1072 -1092.
6Vardy A,Kschischang F.Proof of a conjecture of McEliece regarding the expansion index of the minimal trellis[J].IEEE Trans.on Information Theory,1996,42(6):2027-2034.
7Calderbank A,Fomey Jr G D,Vardy A.Minimal tail-biting trellises:The Golay code and more[J].IEEE Trans.On Information Theory,1999,45(5):1435-1455.
8R.Koetter and A.Vardy,On the Theory of Linear Trellises,M.Blaum,P.Farrel,and H.van Tilborg,Eds.Boston,MA:Kluwer,May 2002.
9R.Koetter and A.Vardy,The structure of tail-biting trellises:Mirtimality and basic principles,IEEE Trans.on Information Theory,2003,49(9):1877-1901.
10A.V.Nori and P.Shankar,Unifying views of tail-biting trellis constructions for linear block codes,IEEE Trans.On Information Theory,2006,62 (10):4431-4443.

滁州学院学报

2009年第2期

内容加载中请稍等...