A remark on Plotkin's bound

DOI10.1109/18.904534zbMATH Open1003.94044OpenAlexW2117264337MaRDI QIDQ4544477FDOQ4544477

Warwick de Launey, Daniel M. Gordon

Publication date: 4 August 2002

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/37d9406b68f3a3661ea125ad66014ca9231010cb

Recommendations

• Some remarks on the Plotkin bound
• scientific article; zbMATH DE number 2163546
• scientific article; zbMATH DE number 3854971
• scientific article
• An Integer Program for Codes

zbMATH Keywords

Plotkin's boundHadamard's conjecture

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Bounds on codes (94B65)

Cited In (6)

• Some remarks on the Plotkin bound
• A comment on the Hadamard conjecture
• Title not available (Why is that?)
• On the asymptotic existence of partial complex Hadamard matrices and related combinatorial objects
• Title not available (Why is that?)
• A Note on Burgess Bound

This page was built for publication: A remark on Plotkin's bound

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