Construction of Minimal Tail-Biting Trellises for Codes over Finite Abelian Groups

Simple item page
dc.creatorYang, Qinqin
dc.creatorQin, Zhongping
dc.date2007-02-05
dc.date2007-05-17
dc.date.accessioned2026-07-07T08:17:01Z
dc.date.available2026-07-07T08:17:01Z
dc.descriptionA definition of atomic codeword for a group code is presented. Some properties of atomic codewords of group codes are investigated. Using these properties, it is shown that every minimal tail-biting trellis for a group code over a finite abelian group can be constructed from its characteristic generators, which extends the work of Koetter and Vardy who treated the case of a linear code over a field. We also present an efficient algorithm for constructing the minimal tail-biting trellis of a group code over a finite abelian group, given a generator matrix.
dc.description11 pages, submitted to IEEE Transactions on Information Theory
dc.identifierhttps://arxiv.org/abs/cs/0702020
dc.identifierhttp://arxiv.org/abs/cs/0702020
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133986
dc.subjectInformation Theory
dc.titleConstruction of Minimal Tail-Biting Trellises for Codes over Finite Abelian Groups
dc.typetext

Files

Collections

arXiv