Variable-length error-correcting codes based on finite automata

DOI10.1007/S10559-015-9712-2MaRDI QIDQ2515332zbMATH OpenOpenAlexFDO

Authors I. O. Zavadskï

Publication date 31 July 2015

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

Full work available at URL https://doi.org/10.1007/s10559-015-9712-2

zbMATH Keywords

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

Mathematics Subject Classification ID

Source coding (94A29) Convolutional codes (94B10)

Recommendations

• A method for decoding a variable-rate error-correcting code based on finite-state automata
• scientific article; zbMATH DE number 6444263
• Automata for codes
• A lower bound on average codeword length of variable length error-correcting codes
• Variable-length codes for error correction

Cites work

• Prefix Encoding by Means of the (2,3)-Representation of Numbers
• Robust prefix encoding using lower (2,3) number representation

Cited in

(10)

• Multiple-rate error-correcting coding scheme
• Variable length codes and finite automata
• scientific article; zbMATH DE number 427961 (Why is no real title available?)
• Design of CAECC - cellular automata based error correcting code
• scientific article; zbMATH DE number 1775631 (Why is no real title available?)
• Constructions for variable-length error-correcting codes
• scientific article; zbMATH DE number 6444263 (Why is no real title available?)
• A new theory of error correction coding
• Complete variable-length codes: an excursion into word edit operations
• A method for decoding a variable-rate error-correcting code based on finite-state automata

This page was built for publication: Variable-length error-correcting codes based on finite automata

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