An asymptotic Hamming bound on the feedback decoding minimum distance of linear tree codes (Corresp.)

DOI10.1109/TIT.1977.1055724MaRDI QIDQ4124735zbMATH OpenFDO

Authors Matti J. Aaltonen

Publication date 1977

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

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99)

This page was built for publication: An asymptotic Hamming bound on the feedback decoding minimum distance of linear tree codes (Corresp.)

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