Algebraic constructions of asymptotically optimal two-dimensional optical orthogonal codes
The paper deals with an algebraic construction of asymptotically optimal two-dimensional optical orthogonal codes (2-D OOCs) that are very useful in multiaccess applications, such as parallel transmissions of images over multicore-fiber code-division multiple-access (CDMA) Systems. 2-D OOC codes can also be used in radar, sonar and other systems that apply the frequency hopping (FH) technique. In the paper, the authors construct 2-D OOC codes using polynomials over the finite fields \(GF(p)\) and \(GF(q)\). They prove that these codes become asymptotically optimal as the order of the codewords reaches infinity.
- On constructions for optimal two-dimensional optical orthogonal codes
- Optical orthogonal codes obtained from conics on finite projective planes
- Optimal Two‐Dimensional Optical Orthogonal Codes with the Best Cross‐Correlation Constraint
- scientific article; zbMATH DE number 7448796
- Optimal 2-D \((n\times m,3,2,1)\)-optical orthogonal codes and related equi-difference conflict avoiding codes
This page was built for publication: Algebraic constructions of asymptotically optimal two-dimensional optical orthogonal codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1375817)