Result: Combinatorial constructions for optimal 2-D optical orthogonal codes with AM-OPPTS property
Title:
Combinatorial constructions for optimal 2-D optical orthogonal codes with AM-OPPTS property
Authors:
Source:
Designs, codes and cryptography. 71(2):315-330
Publisher Information:
New York, NY: Springer, 2014.
Publication Year:
2014
Physical Description:
print, 37 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Security, safety, Sécurité (multidisciplinaire, général), Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Combinatoire. Structures ordonnées, Combinatorics. Ordered structures, Combinatoire, Combinatorics, Plans d'expériences et configurations, Designs and configurations, Sciences appliquees, Applied sciences, Telecommunications et theorie de l'information, Telecommunications and information theory, Théorie de l'information, du signal et des communications, Information, signal and communications theory, Théorie du signal et des communications, Signal and communications theory, Codage, codes, Coding, codes, Télécommunications, Telecommunications, Télécommunications optiques, Optical telecommunications, Accès multiple répartition code, Code division multiple access, Acceso múltiple división código, Borne supérieure, Upper bound, Cota superior, Code correcteur erreur, Error correcting code, Código corrector error, Code optimal, Optimal code, Código optimal, Code orthogonal, Orthogonal code, Código ortogonal, Cyclique, Cyclic, Cíclico, Fenêtre temporelle, Time window, Ventana temporal, Groupe automorphisme, Automorphism group, Grupo automorfismo, Méthode combinatoire, Combinatorial method, Método combinatorio, Plan bloc, Block design, Plan bloque, Code optique orthogonal, Optical orthogonal code, Código ortogonal óptico, Matrice différence, Difference matrix, Matriz diferencia, Plan Holey, Holey design, Diseño Holey, 05B40, 94B65, Holey packing, Mixed-difference, Two-dimensional optical orthogonal code
Document Type:
Academic journal
Article
File Description:
text
Language:
English
Author Affiliations:
Department of Mathematics, Soochow University, Suzhou 215006, China
ISSN:
0925-1022
Rights:
Copyright 2015 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Mathematics
Telecommunications and information theory
Telecommunications and information theory
Accession Number:
edscal.28284087
Database:
PASCAL Archive
Further Information
We develop a new one-to-one correspondence between a two-dimensional (m × n, k, ρ) optical orthogonal code (2-D (m × n, k, ρ)-OOC) with AM-OPPTS (at most one-pulse per time slot) property and a certain combinatorial subject, called an n-cyclic holey packing of type mn. By this link, an upper bound on the size of a 2-D (m × n, k, ρ)-OOC with AM-OPPTS property is derived. Afterwards, we employ combinatorial methods to construct infinitely many 2-D (m × n, k, 1)-OOCs with AM-OPPTS property, whose existence was previously unknown. All these constructions meet the upper bounds with equality and are thus optimal.