A method for decoding a variable-rate error-correcting code based on finite-state automata

DOI10.1007/S10559-015-9726-9MaRDI QIDQ891712zbMATH OpenOpenAlexFDO

Authors I. O. Zavadskï

Publication date 17 November 2015

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10559-015-9726-9

zbMATH Keywords

(2,3) codeconvolutional codeerror-correcting codefinite-state automaton

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Convolutional codes (94B10) Decoding (94B35) Other types of codes (94B60)

Recommendations

• Variable-length error-correcting codes based on finite automata
• scientific article; zbMATH DE number 6444263
• scientific article; zbMATH DE number 5499321
• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
• Automata for codes

Cites work

• scientific article; zbMATH DE number 1314690 (Why is no real title available?)
• Robust prefix encoding using lower (2,3) number representation
• Variable-length error-correcting codes based on finite automata

Cited in

(6)

• Sequential decoding in a channel with spelling errors
• Variable-length error-correcting codes based on finite automata
• scientific article; zbMATH DE number 427961 (Why is no real title available?)
• Search algorithm for increase the performance of codes generated by finite automatons
• scientific article; zbMATH DE number 4064917 (Why is no real title available?)
• scientific article; zbMATH DE number 6444263 (Why is no real title available?)

This page was built for publication: A method for decoding a variable-rate error-correcting code based on finite-state automata

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