An asymptotic Hamming bound on the feedback decoding minimum distance of linear tree codes (Corresp.)
From MaRDI portal
Publication:4124735
DOI10.1109/TIT.1977.1055724zbMATH Open0353.94016MaRDI QIDQ4124735FDOQ4124735
Authors: Matti J. Aaltonen 
Publication date: 1977
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
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)
