On bit-level trellis complexity of Reed-Muller codes
From MaRDI portal
Publication:4880338
DOI10.1109/18.476337zbMath0845.94018OpenAlexW2080971637MaRDI QIDQ4880338
Publication date: 15 September 1996
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.476337
Related Items (1)
This page was built for publication: On bit-level trellis complexity of Reed-Muller codes