Pages that link to "Item:Q1389282"
From MaRDI portal
The following pages link to On the trellis complexity of block and convolutional codes (Q1389282):
Displaying 11 items.
- Bounds on complexity of trellis decoding of linear block codes (Q1895472) (← links)
- A comparison of trellis modules for binary convolutional codes (Q2714805) (← links)
- Variable-complexity trellis decoding of binary convolutional codes (Q2726191) (← links)
- Error-trellises for convolutional codes. II: Decoding methods (Q2732751) (← links)
- Trellis complexity versus the coding gain of lattices. II (Q3129467) (← links)
- The trellis complexity of convolutional codes (Q3129472) (← links)
- Complexity and sliding-block decodability (Q3129478) (← links)
- Bounds on the trellis size of linear block codes (Q4034451) (← links)
- Trellis complexity of linear block codes via atomic codewords (Q4375829) (← links)
- Links between complexity theory and constrained block coding (Q4544764) (← links)
- On the trellis representation of the Delsarte-Goethals codes (Q4701125) (← links)