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

DOI10.1007/S10559-015-9726-9zbMATH Open1400.94195OpenAlexW983962033MaRDI QIDQ891712FDOQ891712

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

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

zbMATH Keywords

convolutional codeerror-correcting codefinite-state automaton(2,3) code

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Variable-length error-correcting codes based on finite automata
• Robust prefix encoding using lower \((2,3)\) number representation

Cited In (6)

• Variable-length error-correcting codes based on finite automata
• Title not available (Why is that?)
• Sequential decoding in a channel with spelling errors
• Search algorithm for increase the performance of codes generated by finite automatons
• Title not available (Why is that?)
• Title not available (Why is that?)

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)