期刊文献+

The generalization of some trellis properties of linear codes to group codes

The generalization of some trellis properties of linear codes to group codes
原文传递
导出
摘要 In this paper, we discuss some trellis properties for codes over a finite Abelian group, which are the generalization of the corresponding trellis properties for linear codes over a field. Also, we also investigate difficulties when we try to generalize a property of a tail-biting trellis for a linear code over a field to a group code. In this paper, we discuss some trellis properties for codes over a finite Abelian group, which are the generalization of the corresponding trellis properties for linear codes over a field. Also, we also investigate difficulties when we try to generalize a property of a tail-biting trellis for a linear code over a field to a group code.
出处 《Science in China(Series F)》 2009年第5期797-803,共7页 中国科学(F辑英文版)
基金 Supported by the National Natural Science Foundation of China (No. 60772131) Shanghai Pujian Talent Program (No. 06PJ14009) Fox Ying Yung Education Foundation (No. 114401) and NCET'08.
关键词 atomic spans trellises tail-biting trellises minimal span form biproper p-bases atomic spans, trellises, tail-biting trellises, minimal span form, biproper p-bases
  • 相关文献

参考文献10

  • 1Kan H B,Hong S.A note on Tanner graph for group block codes and lattices[].IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences.2004
  • 2Kan H B,Hong S.Trellis properties of product codes[].IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences.2005
  • 3Kan H B,Hong S.Trellis properties of group codes[].theth International Conference Advanced Communication Tech- nology.2005
  • 4PIEESS V S,HUFFMAIY W C.Handbook of Cod ingTheory[]..1998
  • 5Kschischang F R,Sorokine V.On the trellis structure of block codes[].IEEE Transactions on Industry Applications.1995
  • 6Forney G D,Jr.Dimension/length profiles and trellis complexity of linear block codes[].IEEE Transactions on Information Theory.1994
  • 7Vazirani V V.An efficient algorithm for constructing minimal trellises for codes over finite Abelian groups[].IEEE Transactions on Information Theory.1996
  • 8Koetter R,Vardy A.On the Theory of Linear Trellises[].InformationCading and Mathematics.2002
  • 9Koetter R,Vardy A.The structure of tail-biting trellises: Minimality and basic principles[].IEEE Transactions on Information Theory.2003
  • 10Calderbank A,Forney Jr G D,Vardy A.Minimal tail-biting trellises:The Golay code and more[].IEEE Transactions on Information Theory.1999

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部