The following pages link to On relative constant-weight codes (Q2339140):
Displaying 10 items.
- Trellis complexity and pseudoredundancy of relative two-weight codes (Q260089) (← links)
- The geometric structure of relative one-weight codes (Q326310) (← links)
- On the intersection of binary linear codes (Q328230) (← links)
- Optimal non-projective linear codes constructed from down-sets (Q1720320) (← links)
- The \(t\)-wise intersection and trellis of relative four-weight codes (Q2040344) (← links)
- A family of linear codes from constant dimension subspace codes (Q2068376) (← links)
- Four classes of minimal binary linear codes with \(w_{\mathrm{min}}/w_{\mathrm{max}}<1/2\) derived from Boolean functions (Q2291661) (← links)
- The separation of binary relative three-weight codes and its applications (Q2325297) (← links)
- New Results on the Pseudoredundancy (Q4968623) (← links)
- Minimal codewords: an application of relative four-weight codes (Q6637066) (← links)
