Optimal \((n,4,2)\)-OOC of small orders. (Q1428520): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Reactive local search for the maximum clique problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new recursive construction for optical orthogonal codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optical orthogonal codes: design, analysis and applications / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Quadruple Systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An improved product construction of rotational Steiner quadruple systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4547547 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A fast algorithm for the maximum clique problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4186331 / rank | |||
Normal rank |
Revision as of 15:30, 6 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Optimal \((n,4,2)\)-OOC of small orders. |
scientific article |
Statements
Optimal \((n,4,2)\)-OOC of small orders. (English)
0 references
29 March 2004
0 references
Optical orthogonal codes
0 references
Cyclic Steiner quadruple systems
0 references
Maximal clique problem
0 references
\(r\)-simple matrices
0 references
Johnson bound
0 references