Pages that link to "Item:Q4880315"
From MaRDI portal
The following pages link to Lower bounds on trellis complexity of block codes (Q4880315):
Displaying 6 items.
- Block transitive codes attaining the Tsfasman-Vladut-Zink bound (Q2182083) (← links)
- On the relative profiles of a linear code and a subcode (Q2248638) (← links)
- On the complexity of suboptimal decoding for list and decision feedback schemes (Q2489924) (← links)
- Minimal trellises for block codes (Q3816021) (← links)
- Bounds on the trellis size of linear block codes (Q4034451) (← links)
- Trellis complexity of linear block codes via atomic codewords (Q4375829) (← links)