Bounds on complexity of trellis decoding of linear block codes
From MaRDI portal
Publication:1895472
zbMath0833.94017MaRDI QIDQ1895472
Vladimir Sidorenko, Victor Zyablov
Publication date: 21 August 1995
Published in: Problems of Information Transmission (Search for Journal in Brave)
complexityblock codesasymptotic boundsminimal trellissyndrome trellismaximum likelihood trellis decoding
Applications of graph theory (05C90) Linear codes (general theory) (94B05) Bounds on codes (94B65) Combined modulation schemes (including trellis codes) in coding theory (94B12) Decoding (94B35)
Related Items (2)
On periodic (partial) unit memory codes with maximum free distance ⋮ On the complexity of suboptimal decoding for list and decision feedback schemes
This page was built for publication: Bounds on complexity of trellis decoding of linear block codes
