On the trellis complexity of certain binary linear block codes
From MaRDI portal
Publication:4838694
DOI10.1109/18.370172zbMath0827.94026OpenAlexW2170121303MaRDI QIDQ4838694
Publication date: 17 December 1995
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.370172
Related Items (6)
On the intersection of binary linear codes ⋮ Value functions and two classes of binary codes ⋮ On the relative profiles of a linear code and a subcode ⋮ The \(t\)-wise intersection and trellis of relative four-weight codes ⋮ The separation of binary relative three-weight codes and its applications ⋮ Trellis complexity and pseudoredundancy of relative two-weight codes
This page was built for publication: On the trellis complexity of certain binary linear block codes