A package for the implementation of block codes as finite automata

DOI10.1007/3-540-44674-5_24MaRDI QIDQ4544432zbMATH OpenFDO

Authors Priti Shankar, K. Sasidharan, Vikas Aggarwal, Balaji Sundar Rajan

Publication date 4 August 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44674-5_24

zbMATH Keywords

block codesdecoder complexityminimal trellissubtrellis overlaying

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combined modulation schemes (including trellis codes) in coding theory (94B12) Decoding (94B35)

Recommendations

• On viewing block codes as finite automata.
• scientific article; zbMATH DE number 5499321
• Variable-length error-correcting codes based on finite automata
• scientific article; zbMATH DE number 6444263
• Coding theory package for Macaulay2
• Automata for codes
• scientific article; zbMATH DE number 3921963
• Automata for solid codes
• Codification schemes and finite automata
• A library for formalization of linear error-correcting codes

Cited in

(4)

• On viewing block codes as finite automata.
• Coding theory package for Macaulay2
• QPlus: computer package for coding theory research and education
• scientific article; zbMATH DE number 5499321 (Why is no real title available?)

This page was built for publication: A package for the implementation of block codes as finite automata

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