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

cyclic structuredualspairs of binary linear codesReed-Muller codesV-G bound

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Review text

Several new and interesting properties of 'linear intersecting codes' are studied. The cyclic structure as well as the duals of such codes are also discussed. Relationships of such codes with many well-known codes in the binary and non-binary cases are established. Almost every study made in the paper is illustrated with an interesting example. The paper concludes with an example of possible application of such codes.

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

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

Cited in

(24)

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

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)