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

Wensong Chu, Charles Colbourn

Research output: Contribution to journalArticle

27 Citations (Scopus)

Abstract

In this paper, we introduce an algorithmic scheme to find optimal (v,4,2)-OOCs of small orders. We determine the sizes of optimal (v,4,2)-OOCs up to v = 44, with three possible exceptions. We also develop an algebraic method to generate all difference triples over ℤv.

Original languageEnglish (US)
Pages (from-to)163-172
Number of pages10
JournalDiscrete Mathematics
Volume279
Issue number1-3
DOIs
StatePublished - Mar 28 2004

Fingerprint

Algebraic Methods
Exception

Keywords

  • Cyclic Steiner quadruple systems
  • Maximal clique problem
  • Optical orthogonal codes
  • r-simple matrices

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Optimal (n,4,2)-OOC of small orders. / Chu, Wensong; Colbourn, Charles.

In: Discrete Mathematics, Vol. 279, No. 1-3, 28.03.2004, p. 163-172.

Research output: Contribution to journalArticle

Chu, Wensong ; Colbourn, Charles. / Optimal (n,4,2)-OOC of small orders. In: Discrete Mathematics. 2004 ; Vol. 279, No. 1-3. pp. 163-172.
@article{0d61b6aa818c40cf99a1493d66eac25a,
title = "Optimal (n,4,2)-OOC of small orders",
abstract = "In this paper, we introduce an algorithmic scheme to find optimal (v,4,2)-OOCs of small orders. We determine the sizes of optimal (v,4,2)-OOCs up to v = 44, with three possible exceptions. We also develop an algebraic method to generate all difference triples over ℤv.",
keywords = "Cyclic Steiner quadruple systems, Maximal clique problem, Optical orthogonal codes, r-simple matrices",
author = "Wensong Chu and Charles Colbourn",
year = "2004",
month = "3",
day = "28",
doi = "10.1016/S0012-365X(03)00266-8",
language = "English (US)",
volume = "279",
pages = "163--172",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

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

AU - Chu, Wensong

AU - Colbourn, Charles

PY - 2004/3/28

Y1 - 2004/3/28

N2 - In this paper, we introduce an algorithmic scheme to find optimal (v,4,2)-OOCs of small orders. We determine the sizes of optimal (v,4,2)-OOCs up to v = 44, with three possible exceptions. We also develop an algebraic method to generate all difference triples over ℤv.

AB - In this paper, we introduce an algorithmic scheme to find optimal (v,4,2)-OOCs of small orders. We determine the sizes of optimal (v,4,2)-OOCs up to v = 44, with three possible exceptions. We also develop an algebraic method to generate all difference triples over ℤv.

KW - Cyclic Steiner quadruple systems

KW - Maximal clique problem

KW - Optical orthogonal codes

KW - r-simple matrices

UR - http://www.scopus.com/inward/record.url?scp=1342265864&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=1342265864&partnerID=8YFLogxK

U2 - 10.1016/S0012-365X(03)00266-8

DO - 10.1016/S0012-365X(03)00266-8

M3 - Article

AN - SCOPUS:1342265864

VL - 279

SP - 163

EP - 172

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -