Remark on a result of Constantine

DOI10.1007/S00026-018-0379-ZMaRDI QIDQ1745902zbMATH OpenOpenAlexFDO

Authors Padraig Ó Catháin

Publication date 18 April 2018

Published in Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1511.08073

zbMATH Keywords

Hadamard matrixnonlinear block code

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorial codes (94B25) Applications of design theory to circuits and networks (94C30)

Abstract: In this short note we construct codes of length $4n$ with $8n+8$ codewords and minimum distance $2n-2$ whenever $4n+4$ is the order of a Hadamard matrix. This generalises work of Constantine who obtained a similar result in the special case that $n$ is a prime power.

Recommendations

• A comment on a result of Vîrgolici
• On a result by Geronimus
• Publication:4503725
• scientific article; zbMATH DE number 991647
• Publication:4722180
• A note on Romanov's constant
• On Romanov's constant
• REMARK ON A PAPER OF TURINICI
• On Romanoff's constant
• On a remark of De Vylder

Cites work

• scientific article; zbMATH DE number 124523 (Why is no real title available?)
• scientific article; zbMATH DE number 4195975 (Why is no real title available?)
• scientific article; zbMATH DE number 3397423 (Why is no real title available?)
• A Family of Difference Sets
• Algebraic design theory
• An alternative to Hadamard codes -- one error for the price of existence
• Hadamard matrices and their applications
• On Orthogonal Matrices
• On a new class of Hadamard determinants
• On the classification of Hadamard matrices of order 32
• On the density of the set of known Hadamard orders
• Product of four Hadamard matrices
• Quasi-symmetric designs and codes meeting the Grey-Rankin bound

This page was built for publication: Remark on a result of Constantine

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