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)

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

(9)

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

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)