Skip to main content
Journal Article

Minimal tail-biting trellises for certain cyclic block codes are easy to construct

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2076 627-638
DOI: 10.1007/3-540-48224-5_52
5Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

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. © 2011 Springer-Verlag Berlin Heidelberg.

Author supplied keywords

Cite

CITATION STYLE

APA

Shankar, P., Kumar, P. N. A., Singh, H., & Rajan, B. S. (2001). Minimal tail-biting trellises for certain cyclic block codes are easy to construct. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2076, 627–638. https://doi.org/10.1007/3-540-48224-5_52

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free