A theorem on equidistant codes
From MaRDI portal
Publication:758951
DOI10.1016/0012-365X(73)90066-6zbMATH Open0271.94007OpenAlexW2168326159WikidataQ106166037 ScholiaQ106166037MaRDI QIDQ758951FDOQ758951
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
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
Cited In (18)
- Code pairs with specified parity of the Hamming distances
- Algebraic theory of block codes detecting independent errors
- Every large set of equidistant (0,+1,-1)-vectors forms a sunflower
- Some new results on Hadamard modulo prime matrices
- Jack van Lint (1932--2004): a survey of his scientific work
- Equidistant families of sets
- Extremal \((r,\lambda)\)-designs
- On the structure of regular pairwise balanced designs
- Matrices dont deux lignes quelconque coincident dans un nombre donne de positions communes
- Bounds for equidistant codes and partial projective planes
- Une propriété extremale des plans projectifs finis dans une classe de codes équidistants
- On the construction of \(q\)-ary equidistant codes
- Asymptotic bounds on the equilateral dimension of hypercubes
- Multicolour Sunflowers
- The clique number of the exact distance \(t\)-power graph: complexity and eigenvalue bounds
- Equidistant codes with distance 12
- On equidistant constant weight codes
- On equidistant constant weight codes
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)
