Linear binary codes with intersection properties

DOI10.1016/0166-218X(84)90018-0MaRDI QIDQ800294zbMATH OpenWikidataFDO

Authors Dezsö Miklós

Publication date 1984

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218X(84)90018-0

zbMATH Keywords

binary linear code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• Maximum intersection of linear codes and codes equivalent to linear
• On the intersection of binary linear codes
• Constructions of intersecting codes
• scientific article; zbMATH DE number 5054189
• On intersection problem for perfect binary codes

Cites work

• Minimal 2-coverings of a finite affine space based on GF(2)
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities

Cited in

(12)

• Linear intersecting codes
• Intersection of isomorphic linear codes
• Critical problem for codes over finite chain rings
• On the intersection of binary linear codes
• \((2,1)\)-separating systems beyond the probabilistic bound
• scientific article; zbMATH DE number 2170443 (Why is no real title available?)
• Maximum intersection of linear codes and codes equivalent to linear
• A note on (3,1) and (3,2) separating systems and bound for (3,1) separating system
• An application of coding theory to estimating Davenport constants
• Strong blocking sets and minimal codes from expander graphs
• The geometry of intersecting codes and applications to additive combinatorics and factorization theory
• Expander graphs, strong blocking sets and minimal codes (extended abstract)

This page was built for publication: Linear binary codes with intersection properties

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