Pages that link to "Item:Q4838694"
From MaRDI portal
The following pages link to On the trellis complexity of certain binary linear block codes (Q4838694):
Displaying 16 items.
- Trellis complexity and pseudoredundancy of relative two-weight codes (Q260089) (← links)
- On the intersection of binary linear codes (Q328230) (← links)
- The \(t\)-wise intersection and trellis of relative four-weight codes (Q2040344) (← links)
- Value functions and two classes of binary codes (Q2222958) (← links)
- On the relative profiles of a linear code and a subcode (Q2248638) (← links)
- The separation of binary relative three-weight codes and its applications (Q2325297) (← links)
- Trellis complexity versus the coding gain of lattices. II (Q3129467) (← links)
- The trellis complexity of convolutional codes (Q3129472) (← links)
- (Q3328459) (← links)
- Minimal trellises for block codes (Q3816021) (← links)
- Bounds on the trellis size of linear block codes (Q4034451) (← links)
- (Q4204104) (← links)
- Trellis complexity of linear block codes via atomic codewords (Q4375829) (← links)
- (Q4399936) (← links)
- Asymptotically good codes have infinite trellis complexity (Q4838693) (← links)
- On the BCJR trellis for linear block codes (Q4885710) (← links)