Determining the burst-correcting limit of cyclic codes
From MaRDI portal
Publication:3864417
DOI10.1109/TIT.1980.1056193zbMath0427.94022MaRDI QIDQ3864417
Publication date: 1980
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
computationally efficient algorithmsburst-correcting limitlength of the shortest linear feedback shift-registerparity- check matrix
Related Items (2)
This page was built for publication: Determining the burst-correcting limit of cyclic codes