A note on the method of poles for code construction

DOI10.1109/18.312177MaRDI QIDQ4308790zbMATH OpenOpenAlexFDO

Authors Jonathan J. Ashley, Marie-Pierre Béal

Publication date 9 July 1995

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.312177

zbMATH Keywords

encoderlocal automatonmethod of polesshift of finite typesliding- block decoderupper bound on the window length of the decoder

Mathematics Subject Classification ID

Applications of graph theory (05C90) Formal languages and automata (68Q45) Channel models (including quantum) in information and communication theory (94A40) Decoding (94B35)

Recommendations

• Extensions of the method of poles for code construction
• The method of poles: a coding method for constrained channels
• A linear bound for sliding-block decoder window size. II
• A general error-correcting code construction for run-length limited binary channels
• On the principal state method for run-length limited sequences

Cited in

(2)

• The method of poles: a coding method for constrained channels
• Extensions of the method of poles for code construction

This page was built for publication: A note on the method of poles for code construction

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