Upper bounds for the cardinality of s-distances codes

DOI10.1016/S0195-6698(86)80015-4zbMath0594.94019OpenAlexW1969182197MaRDI QIDQ1077373

Monique Laurent

Publication date: 1986

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0195-6698(86)80015-4

zbMATH Keywords

Hadamard codes of index 2modular Hadamard codestransversal matroid designs

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Related Items (3)

Bouquets of maroids, d-injection geometries and diagrams ⋮ Bouquets of geometric lattices: Some algebraic and topological aspects ⋮ Weight distribution and dual distance

Cites Work

• On the nonexistence of unknown perfect 6- and 8-codes in Hamming schemes H(n,q) with q arbitrary
• On squashed designs
• Nonexistence of nontrivial perfect codes in case \(q=p^r_1p^s_2\), \(e\geq 3\)
• Four fundamental parameters of a code and their combinatorial significance
• On the Nonexistence of Perfect Codes over Finite Fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Upper bounds for the cardinality of s-distances codes