Tail-biting trellis properties of group codes

Xuefei Li, Haibin Kan, Hong Shen

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

R. Koetter and A. Vardy built general theory on tail-biting trellises for linear codes over fields, in this paper, we analyze the difficulties of generalizing their results to group codes.

Original languageEnglish
Title of host publicationWMSCI 2005 - The 9th World Multi-Conference on Systemics, Cybernetics and Informatics, Proceedings
Pages79-83
Number of pages5
Publication statusPublished - 2005
Externally publishedYes
Event9th World Multi-Conference on Systemics, Cybernetics and Informatics, WMSCI 2005 - Orlando, FL, United States
Duration: 10 Jul 200513 Jul 2005

Publication series

NameWMSCI 2005 - The 9th World Multi-Conference on Systemics, Cybernetics and Informatics, Proceedings
Volume3

Conference

Conference9th World Multi-Conference on Systemics, Cybernetics and Informatics, WMSCI 2005
Country/TerritoryUnited States
CityOrlando, FL
Period10/07/0513/07/05

Keywords

  • Biproper p-basis
  • Elementary trellis
  • Group codes
  • Minimal tail-biting trellis
  • Trellis

Fingerprint

Dive into the research topics of 'Tail-biting trellis properties of group codes'. Together they form a unique fingerprint.

Cite this