A theorem on equidistant codes

DOI10.1016/0012-365X(73)90066-6MaRDI QIDQ758951zbMATH OpenOpenAlexWikidataFDO

Authors Jack van Lint

Publication date 1973

Published in Discrete Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorial aspects of finite geometries (05B25) Theory of error-correcting codes and error-detecting codes (94B99)

Cites work

• scientific article; zbMATH DE number 3311772 (Why is no real title available?)
• Une propriété extremale des plans projectifs finis dans une classe de codes équidistants

Cited in

(18)

• On the construction of \(q\)-ary equidistant codes
• The clique number of the exact distance \(t\)-power graph: complexity and eigenvalue bounds
• Multicolour sunflowers
• Jack van Lint (1932--2004): a survey of his scientific work
• Une propriété extremale des plans projectifs finis dans une classe de codes équidistants
• Some new results on Hadamard modulo prime matrices
• Bounds for equidistant codes and partial projective planes
• Equidistant families of sets
• On equidistant constant weight codes
• Asymptotic bounds on the equilateral dimension of hypercubes
• Algebraic theory of block codes detecting independent errors
• On equidistant constant weight codes
• Extremal \((r,\lambda)\)-designs
• On the structure of regular pairwise balanced designs
• Code pairs with specified parity of the Hamming distances
• Every large set of equidistant (0,+1,-1)-vectors forms a sunflower
• Matrices dont deux lignes quelconque coincident dans un nombre donne de positions communes
• Equidistant codes with distance 12

This page was built for publication: A theorem on equidistant codes

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