Results 1  10
of
184,873
Construction of Minimal TailBiting Trellises for Codes over Finite Abelian Groups
, 2007
"... Abstract — A 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 tailbiting trellis for a group code over a finite abelian group can be constructed from its character ..."
Abstract
 Add to MetaCart
Abstract — A 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 tailbiting trellis for a group code over a finite abelian group can be constructed from its
The Structure of TailBiting Trellises: Minimality and Basic Principles
 IEEE Trans. Inform. Theory
, 2002
"... Basic structural properties of tailbiting trellises are investigated. We start with rigorous definitions of various types of minimality for tailbiting trellises. ..."
Abstract

Cited by 26 (1 self)
 Add to MetaCart
Basic structural properties of tailbiting trellises are investigated. We start with rigorous definitions of various types of minimality for tailbiting trellises.
Minimal TailBiting Trellises for Certain Cyclic Block Codes Are Easy to Construct
 Leeuwen (Eds.), ICALP 2001, Lecture
, 2001
"... We give simple algorithms for the construction of generator matrices for minimal tailbiting trellises for a powerful and practical subclass of the linear cyclic codes, from which the combinatorial representation in the form of a graph can be obtained by standard procedures. ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
We give simple algorithms for the construction of generator matrices for minimal tailbiting trellises for a powerful and practical subclass of the linear cyclic codes, from which the combinatorial representation in the form of a graph can be obtained by standard procedures.
Local Irreducibility of TailBiting Trellises
, 2014
"... This paper investigates tailbiting trellis realizations for linear block codes. Intrinsic trellis properties are used to characterize irreducibility on given intervals of the time axis. It proves beneficial to always consider the trellis and its dual simultaneously. A major role is played by trelli ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper investigates tailbiting trellis realizations for linear block codes. Intrinsic trellis properties are used to characterize irreducibility on given intervals of the time axis. It proves beneficial to always consider the trellis and its dual simultaneously. A major role is played
Reducing complexity of tailbiting trellises
"... Abstract—It is shown that a trellis realization can be locally reduced if it is not statetrim, branchtrim, proper, observable, and controllable. These conditions are not sufficient for local irreducibility. Making use of notions that amount to “almost unobservability/uncontrollability”, a necessar ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
necessary and sufficient criterion of local irreducibility for tailbiting trellises is presented. I.
Minimal TailBiting Trellises for Linear MIX Codes over Fpm
"... bsrajanQece.iisc.ernet.in Abstract For all linear ( n, k, d) MDS over finite fields Fpm, we identity a generator matrix with the property that the product of trellises of rows of the generator matrix will give a minimal tailbiting linear trellis, and viewing the code as a group code, identify a s ..."
Abstract
 Add to MetaCart
bsrajanQece.iisc.ernet.in Abstract For all linear ( n, k, d) MDS over finite fields Fpm, we identity a generator matrix with the property that the product of trellises of rows of the generator matrix will give a minimal tailbiting linear trellis, and viewing the code as a group code, identify a
Unifying Views of TailBiting Trellises for Linear Block Codes
, 2005
"... This thesis presents new techniques for the construction and specification of linear tailbiting trellises. Tailbiting trellises for linear block codes are combinatorial descriptions in the form of layered graphs, that are somewhat more compact than the corresponding conventional trellis descriptio ..."
Abstract
 Add to MetaCart
This thesis presents new techniques for the construction and specification of linear tailbiting trellises. Tailbiting trellises for linear block codes are combinatorial descriptions in the form of layered graphs, that are somewhat more compact than the corresponding conventional trellis
Characteristic Generators and Dualization for TailBiting
, 2011
"... Abstract: This paper focuses on dualizing tailbiting trellises, particularly KVtrellises. These trellises are based on characteristic generators, as introduced by Koetter/Vardy (2003), and may be regarded as a natural generalization of minimal conventional trellises, even though they are not neces ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
Abstract: This paper focuses on dualizing tailbiting trellises, particularly KVtrellises. These trellises are based on characteristic generators, as introduced by Koetter/Vardy (2003), and may be regarded as a natural generalization of minimal conventional trellises, even though
An Efficient Algorithm for Constructing Minimal Trellises for Codes over Finite Abelian Groups
, 1996
"... We present an efficient algorithm for computing the minimal trellis for a group code over a finite Abelian group, given a generator matrix for the code. We also show how to cornpure a succinct representation of the minimal trellis for such a code, andpresent algorithms that use this information to e ..."
Abstract

Cited by 19 (2 self)
 Add to MetaCart
We present an efficient algorithm for computing the minimal trellis for a group code over a finite Abelian group, given a generator matrix for the code. We also show how to cornpure a succinct representation of the minimal trellis for such a code, andpresent algorithms that use this information
Results 1  10
of
184,873