Jump to content

Delsarte–Goethals code

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Involtere (talk | contribs) at 19:05, 20 May 2017 (Created page with ' The Delsarte Goethals code is a type of error correcting code. == History == The concept was introduced by mathematicians Ph. Delsarte and J.-M. Goethals in...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)


The Delsarte Goethals code is a type of error correcting code.

History

The concept was introduced by mathematicians Ph. Delsarte and J.-M. Goethals in their published paper.[1][2]

A new proof of the Delsarte Goethals code was published in 1970.[3]


Function

The Delsarte-Goethals code DG(u, r) for even u ≥ 4 and 1 ≤ r ≤ u/2 is a binary, non-linear (2u, 2(u−1)(u/2-r+1)+u+1, 2m−1 – 2m−1−d)-code [1]. For r = u/2 − 1 it has strength 7 and is therefore an orthogonal array OA(23u−1, 2u, ℤ2, 7).[4][5]

References