Pages that link to "Item:Q1895472"
From MaRDI portal
The following pages link to Bounds on complexity of trellis decoding of linear block codes (Q1895472):
Displaying 14 items.
- On the trellis complexity of block and convolutional codes (Q1389282) (← links)
- On the comparative complexity of algorithms for constructing the syndrome trellis of a linear block code (Q1582940) (← links)
- On the complexity of suboptimal decoding for list and decision feedback schemes (Q2489924) (← links)
- Variable-complexity trellis decoding of binary convolutional codes (Q2726191) (← links)
- Minimum distance bounding techniques for individual trellis codes (Q2726498) (← links)
- MAP algorithms for decoding linear block codes based on sectionalized trellis diagrams (Q2732978) (← links)
- Complexity and sliding-block decodability (Q3129478) (← links)
- Bounds on the trellis size of linear block codes (Q4034451) (← links)
- (Q4204104) (← links)
- On complexity of trellis structure of linear block codes (Q4277170) (← links)
- Trellis complexity of linear block codes via atomic codewords (Q4375829) (← links)
- (Q4399936) (← links)
- On periodic (partial) unit memory codes with maximum free distance (Q4637807) (← links)
- On the BCJR trellis for linear block codes (Q4885710) (← links)