On viewing block codes as finite automata.
From MaRDI portal
Publication:1401192
DOI10.1016/S0304-3975(02)00083-XzbMath1044.68102MaRDI QIDQ1401192
Kaustubh Deshmukh, Amitava Dasgupta, B. Sundar Rajan, Priti Shankar
Publication date: 17 August 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
Bideterministic weighted automata ⋮ Bideterministic weighted automata ⋮ ON TRANSITION MINIMALITY OF BIDETERMINISTIC AUTOMATA ⋮ Nondeterministic syntactic complexity ⋮ Bideterministic automata and minimal representations of regular languages ⋮ State-complexity hierarchies of uniform languages of alphabet-size length
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The trellis structure of maximal fixed-cost codes
- Minimal trellises for block codes
- Coset codes. II. Binary lattices and related codes
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
- Efficient maximum likelihood decoding of linear block codes using a trellis
- Transform Techniques for Error Control Codes
- The dynamics of group codes: state spaces, trellis diagrams, and canonical encoders
- Minimal tail-biting trellises: the Golay code and more
- An Introduction to Symbolic Dynamics and Coding
- On the trellis structure of block codes
- On the BCJR trellis for linear block codes
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
This page was built for publication: On viewing block codes as finite automata.