Constructions of Optical Orthogonal Codes from Finite Geometry
T. L. Alderson, Keith E. Mellinger
Source abstract
The link between finite geometry and various classes of error-correcting codes is well known. Arcs in projective spaces, for instance, have a close tie to linear MDS codes as well as the high-performing low-density parity-check codes. In this article, we demonstrate a connection between arcs and optical orthogonal codes (OOCs), a class of nonlinear binary codes used for many modern communication applications. Using arcs and Baer subspaces of finite projective spaces, we construct some infinite classes of OOCs with auto-correlation and cross-correlation both larger than 1.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.