The t-wise intersection and trellis of relative four-weight codes
From MaRDI portal
Publication:2040344
Recommendations
- The \(t\)-wise intersection of relative three-weight codes
- The \(t\)-wise intersection of relative two-weight codes
- On the relative generalized Hamming weights of a 4-dimensional linear code and a subcode with dimension one
- On relative constant-weight codes
- A construction of two classes of linear codes with four-weights
Cites work
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- A geometric approach to rank metric codes and a classification of constant weight codes
- At most three-weight binary linear codes from generalized Moisio's exponential sums
- Completely separating systems
- Constructions of intersecting codes
- Dimension/length profiles and trellis complexity of linear block codes
- Geometric approach to higher weights
- Intersecting codes and independent families
- Linear intersecting codes
- Maximum-likelihood soft decision decoding of BCH codes
- New linear codes with few weights derived from Kloosterman sums
- On relative constant-weight codes
- On the trellis complexity of certain binary linear block codes
- The \(t\)-wise intersection of relative three-weight codes
- The weight hierarchies of q-ary codes of dimension 4
- Trellis complexity and pseudoredundancy of relative two-weight codes
- Two-weight and three-weight linear codes based on Weil sums
Cited in
(4)
This page was built for publication: The \(t\)-wise intersection and trellis of relative four-weight codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2040344)