Linear intersecting codes

DOI10.1016/0012-365X(85)90190-6zbMath0586.94015OpenAlexW1965206353MaRDI QIDQ1072521

Abraham Lempel, Gérard D. 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

dualsReed-Muller codescyclic structurepairs of binary linear codesV-G bound

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (13)

Variations on Minimal Linear Codes ⋮ \((2,1)\)-separating systems beyond the probabilistic bound ⋮ The maximum number of minimal codewords in an \([n,k\)-code] ⋮ 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 ⋮ Value functions and two classes of binary codes ⋮ The \(t\)-wise intersection of relative two-weight codes ⋮ Multi-wise and constrained fully weighted Davenport constants and interactions with coding theory ⋮ The \(t\)-wise intersection and trellis of relative four-weight codes ⋮ The separation of binary relative three-weight codes and its applications ⋮ On relative constant-weight codes ⋮ Yet another variation on minimal linear codes

Cites Work

• Unnamed Item
• Minimal 2-coverings of a finite affine space based on GF(2)
• Linear binary codes with intersection properties
• A new approach to error-correcting codes

This page was built for publication: Linear intersecting codes