Pages that link to "Item:Q260089"
From MaRDI portal
The following pages link to Trellis complexity and pseudoredundancy of relative two-weight codes (Q260089):
Displaying 8 items.
- A multivariate weight enumerator for tail-biting trellis pseudocodewords (Q501756) (← 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)
- On relative constant-weight codes (Q2339140) (← links)
- Trellis complexity versus the coding gain of lattices. II (Q3129467) (← links)
- Minimal codewords: an application of relative four-weight codes (Q6637066) (← links)