On viewing block codes as finite automata.

DOI10.1016/S0304-3975(02)00083-XMaRDI QIDQ1401192zbMATH OpenFDO

Authors Amitava Dasgupta, Kaustubh Deshmukh, B. Sundar Rajan, Priti Shankar

Publication date 17 August 2003

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0304-3975(02)00083-X

zbMATH Keywords

Block codesDecoder complexityMaximum likelihood decodingTail-biting trellis

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 1500506
• scientific article; zbMATH DE number 1775631
• scientific article; zbMATH DE number 1284437
• scientific article; zbMATH DE number 1189021
• Minimal trellises for block codes

Cites work

• An Introduction to Symbolic Dynamics and Coding
• Coset codes. II. Binary lattices and related codes
• Efficient maximum likelihood decoding of linear block codes using a trellis
• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
• scientific article; zbMATH DE number 108350 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 3586931 (Why is no real title available?)
• scientific article; zbMATH DE number 4123587 (Why is no real title available?)
• scientific article; zbMATH DE number 1284437 (Why is no real title available?)
• scientific article; zbMATH DE number 1754625 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• Minimal tail-biting trellises: the Golay code and more
• Minimal trellises for block codes
• On the BCJR trellis for linear block codes
• On the trellis structure of block codes
• Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
• The dynamics of group codes: state spaces, trellis diagrams, and canonical encoders
• The trellis structure of maximal fixed-cost codes
• Transform Techniques for Error Control Codes

Cited in

(10)

• Nondeterministic syntactic complexity
• State-complexity hierarchies of uniform languages of alphabet-size length
• ON TRANSITION MINIMALITY OF BIDETERMINISTIC AUTOMATA
• scientific article; zbMATH DE number 1500506 (Why is no real title available?)
• scientific article; zbMATH DE number 1775631 (Why is no real title available?)
• scientific article; zbMATH DE number 2154143 (Why is no real title available?)
• Bideterministic weighted automata
• Bideterministic weighted automata
• Block languages and their bitmap representations
• Bideterministic automata and minimal representations of regular languages

This page was built for publication: On viewing block codes as finite automata.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401192)