The \(t\)-wise intersection and trellis of relative four-weight codes

DOI10.1007/s12095-020-00456-wzbMath1469.94142OpenAlexW3094138888MaRDI QIDQ2040344

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

zbMATH Keywords

projective spacesupportTrellis\(t\)-wise intersectingrelative four-weight code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Cites Work

• Unnamed Item
• Trellis complexity and pseudoredundancy of relative two-weight codes
• A geometric approach to rank metric codes and a classification of constant weight codes
• Linear intersecting codes
• Completely separating systems
• At most three-weight binary linear codes from generalized Moisio's exponential sums
• New linear codes with few weights derived from Kloosterman sums
• On relative constant-weight codes
• Two-weight and three-weight linear codes based on Weil sums
• A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
• 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
• Dimension/length profiles and trellis complexity of linear block codes
• Intersecting codes and independent families
• Geometric approach to higher weights

This page was built for publication: The \(t\)-wise intersection and trellis of relative four-weight codes