Linear intersecting codes

DOI10.1016/0012-365X(85)90190-6MaRDI QIDQ1072521zbMATH OpenOpenAlexFDO

Authors Abraham Lempel, Gérard Cohen

Publication date 1985

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(85)90190-6

zbMATH Keywords

Reed-Muller codesdualscyclic structurepairs of binary linear codesV-G bound

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• Constructions of intersecting codes
• On the intersection of binary linear codes
• Linear binary codes with intersection properties
• Intersecting codes and independent families
• scientific article; zbMATH DE number 1498821

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• A new approach to error-correcting codes
• Linear binary codes with intersection properties
• Minimal 2-coverings of a finite affine space based on GF(2)

Cited in

(20)

• Yet another variation on minimal linear codes
• \((2,1)\)-separating systems beyond the probabilistic bound
• Variations on minimal linear codes
• Strong blocking sets and minimal codes from expander graphs
• Value functions and two classes of binary codes
• scientific article; zbMATH DE number 3410913 (Why is no real title available?)
• Intersecting codes and separating codes
• A note on (3,1) and (3,2) separating systems and bound for (3,1) separating system
• On the intersection of binary linear codes
• The \(t\)-wise intersection and trellis of relative four-weight codes
• On relative constant-weight codes
• On the lower bound for the length of minimal codes
• The \(t\)-wise intersection of relative two-weight codes
• Symbol-Intersecting Codes
• Minimal codewords: an application of relative four-weight codes
• Multi-wise and constrained fully weighted Davenport constants and interactions with coding theory
• An application of coding theory to estimating Davenport constants
• The separation of binary relative three-weight codes and its applications
• The maximum number of minimal codewords in an \([n,k]\)-code
• Linear \(\ell \)-intersection pairs of codes and their applications

This page was built for publication: Linear intersecting codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1072521)