A new upper bound for codes with a single Hamming distance

MaRDI QIDQ6839554zbMATH OpenFDO

Authors Gábor Hegedüs

Publication date 24 March 2026

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://ajc.maths.uq.edu.au/pdf/94/ajc_v94_p300.pdf

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Linear codes (general theory) (94B05)

Cites work

• A new proof of several inequalities on codes and sets
• An Inequality for Incidence Matrices
• Extremal combinatorics. With applications in computer science
• scientific article; zbMATH DE number 3634287 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• On some Theorems in Combinatorics Relating to Incomplete Block Designs

This page was built for publication: A new upper bound for codes with a single Hamming distance

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