On viewing block codes as finite automata.
type: Item
instance of: scholarly article
title: On viewing block codes as finite automata.
zbMATH Open document ID: 1044.68102
DOI: 10.1016/S0304-3975(02)00083-X
author: Amitava Dasgupta
author: Kaustubh Deshmukh
author: B. Sundar Rajan
author: Priti Shankar
published in: Theoretical Computer Science
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1965233
zbMATH Keywords: Block codes
zbMATH Keywords: Tail-biting trellis
zbMATH Keywords: Decoder complexity
zbMATH Keywords: Maximum likelihood decoding
MaRDI profile type: Publication
cites work: Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
cites work: Transform Techniques for Error Control Codes
cites work: Minimal tail-biting trellises: the Golay code and more
cites work: Q4023809
cites work: Coset codes. II. Binary lattices and related codes
cites work: The dynamics of group codes: state spaces, trellis diagrams, and canonical encoders
cites work: Q5592246
cites work: The trellis structure of maximal fixed-cost codes
cites work: On the trellis structure of block codes
cites work: An Introduction to Symbolic Dynamics and Coding
cites work: Q4146667
cites work: Q4156696
cites work: On the BCJR trellis for linear block codes
cites work: Minimal trellises for block codes
cites work: Q4535052
cites work: Q4242031
cites work: Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
cites work: Q4204049
cites work: Efficient maximum likelihood decoding of linear block codes using a trellis
description: scientific article; zbMATH DE number 1965233