Sciweavers

Share
ICALP
2001
Springer

Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct

8 years 10 months ago
Minimal Tail-Biting Trellises for Certain Cyclic Block Codes Are Easy to Construct
We give simple algorithms for the construction of generator matrices for minimal tail-biting 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.
Priti Shankar, P. N. A. Kumar, Harmeet Singh, B. S
Added 29 Jul 2010
Updated 29 Jul 2010
Type Conference
Year 2001
Where ICALP
Authors Priti Shankar, P. N. A. Kumar, Harmeet Singh, B. Sundar Rajan
Comments (0)
books