Preparata code: Difference between revisions

Revision as of 11:24, 1 July 2014

Latest revision as of 23:51, 17 August 2023

(6 intermediate revisions by 5 users not shown)

Line 1:

In [[coding theory]], the '''Preparata codes''' form a class of non-linear double-[[Error detection and correction|error-correcting codes]]. They are named after [[Franco P. Preparata]] who first described them in 1968.

Although non-linear over [[GF(2)]] the Preparata codes are linear over '''Z'''₄ with the [[Lee distance]].

==Construction==

Line 10 ⟶ 12:

# <math>\sum_{x \in X} x^3 + \left(\sum_{x \in X} x\right)^3 = \sum_{y \in Y} y^3.</math>

The PeparataPreparata code is obtained by deleting the position in ''X'' corresponding to 0 in GF(2^''m'').

==Properties==

Line 18 ⟶ 20:

== References ==

* {{cite journal | author=F.P. Preparata | authorlink=Franco P. Preparata | title=A class of optimum nonlinear double-error-correcting codes | journal=Information and Control | volume=13 | year=1968 | issue=4 | pages=378–400 | doi=10.1016/S0019-9958(68)90874-7 | doi-access=free | hdl=2142/74662 | hdl-access=free }}

* {{cite book | author=J.H. van Lint | title=Introduction to Coding Theory | edition=2nd | publisher=Springer-Verlag | series=[[Graduate Texts in Mathematics|GTM]] | volume=86 | date=1992 | isbn=3-540-54894-7 | pages=[https://archive.org/details/introductiontoco0000lint/page/111 111–113] | url=https://archive.org/details/introductiontoco0000lint/page/111 }}

* http://www.encyclopediaofmath.org/index.php/Preparata_code

* http://www.encyclopediaofmath.org/index.php/Kerdock_and_Preparata_codes

[[Category:Error detection and correction]]

[[Category:Finite fields]]

[[Category:Coding theory]]

{{crypto-stub}}