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

Authors:
Priti Shankar;P. N. A. Kumar;Harmeet Singh;B. Sundar Rajan
Affiliations:
-;-;-;-
Venue:
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Year:
2001

Citing 4
Cited 0

On the BCJR trellis for linear block codes

IEEE Transactions on Information Theory
Minimal tail-biting trellises: the Golay code and more

IEEE Transactions on Information Theory
Linear tail-biting trellises, the square-root bound, and applications for Reed-Muller codes

IEEE Transactions on Information Theory
Efficient maximum likelihood decoding of linear block codes using a trellis

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.