A Package for the Implementation of Block Codes as Finite Automata

We have implemented a package that transforms concise algebraic descriptions of linear block codes into finite automata representations, and also generates decoders from such representations. The transformation takes a description of the code in the form of a k

• Type: Conference
• Year: 2000
• Where: WIA
• Authors: Priti Shankar, K. Sasidharan, Vikas Aggarwal, B. Sundar Rajan
• Keywords: Artificial Intelligence, Finite Automata Representations, Minimal Automaton, Overlayed Automaton, WIA 2000