The t-wise intersection and trellis of relative four-weight codes
From MaRDI portal
Publication:2040344
DOI10.1007/S12095-020-00456-WzbMATH Open1469.94142OpenAlexW3094138888MaRDI QIDQ2040344FDOQ2040344
Authors: Yanyan Li 
Publication date: 13 July 2021
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-020-00456-w
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
- Linear intersecting codes
- On relative constant-weight codes
- Trellis complexity and pseudoredundancy of relative two-weight codes
- Maximum-likelihood soft decision decoding of BCH codes
- The weight hierarchies of q-ary codes of dimension 4
- Constructions of intersecting codes
- On the trellis complexity of certain binary linear block codes
- Intersecting codes and independent families
- Dimension/length profiles and trellis complexity of linear block codes
- Completely separating systems
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- Geometric approach to higher weights
- The \(t\)-wise intersection of relative three-weight codes
- A geometric approach to rank metric codes and a classification of constant weight codes
- Two-weight and three-weight linear codes based on Weil sums
- New linear codes with few weights derived from Kloosterman sums
- At most three-weight binary linear codes from generalized Moisio's exponential 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)
