Optimal \((n,4,2)\)-OOC of small orders.

DOI10.1016/S0012-365X(03)00266-8zbMath1044.05016OpenAlexW2061504572MaRDI QIDQ1428520

Wensong Chu, Charles J. Colbourn

Publication date: 29 March 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00266-8

zbMATH Keywords

Johnson boundOptical orthogonal codes\(r\)-simple matricesCyclic Steiner quadruple systemsMaximal clique problem

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)

Related Items (13)

Optimal (v, 4, 2, 1) optical orthogonal codes with small parameters ⋮ Super-simple cyclic designs with small values ⋮ On constructions for optimal two-dimensional optical orthogonal codes ⋮ Combinatorial constructions of optimal \((m,n,4,2)\) optical orthogonal signature pattern codes ⋮ Optimal \((v,5,2,1)\) optical orthogonal codes of small \(v\) ⋮ Two classes of optimal two-dimensional OOCs ⋮ New bound and constructions for geometric orthogonal codes and geometric 180-rotating orthogonal codes ⋮ The sizes of optimal \((n,4,\lambda,3)\) optical orthogonal codes ⋮ Classification of optimal \((v,k,1)\) binary cyclically permutable constant weight codes with \(k=5, 6\) and \(7\) and small lengths ⋮ Affine-invariant strictly cyclic Steiner quadruple systems ⋮ Maximum two-dimensional \((u\times v, 4, 1, 3)\)-OOCs ⋮ Constructions for strictly cyclic 3-designs and applications to optimal OOCs with \(\lambda =2\) ⋮ Classification of optimal \((v, 4, 1)\) binary cyclically permutable constant-weight codes and cyclic \(2\)-\((v, 4, 1)\) designs with \(v \leq 76\).

Cites Work

• Unnamed Item
• Unnamed Item
• A fast algorithm for the maximum clique problem
• On Quadruple Systems
• A new recursive construction for optical orthogonal codes
• Optical orthogonal codes: design, analysis and applications
• An improved product construction of rotational Steiner quadruple systems
• Reactive local search for the maximum clique problem

This page was built for publication: Optimal \((n,4,2)\)-OOC of small orders.