Journal of Combinatorial Designs (J Combin Des)

Publisher: Wiley InterScience (Online service), Wiley

Journal description

The Journal of Combinatorial Designs is an international journal devoted to the timely publication of the most influential papers in the area of combinatorial design theory. All topics in design theory and in which design theory has important applications are covered including: block designs t-designs pairwise balanced designs and group divisible designs Latin squares quasigroups and related algebras computational methods in design theory construction methods applications in computer science experimental design theory and coding theory graph decompositions factorizations and design-theoretic techniques in graph theory and extremal combinatorics finite geometry and its relation with design theory. algebraic aspects of design theory. Researchers and scientists can depend on the Journal of Combinatorial Designs for the most recent developments in this rapidly growing field and to provide a forum for both theoretical research and applications.

Current impact factor: 0.49

Impact Factor Rankings

2015 Impact Factor Available summer 2015
2013 / 2014 Impact Factor 0.493
2012 Impact Factor 0.687
2011 Impact Factor 0.62
2010 Impact Factor 0.662
2009 Impact Factor 0.709
2008 Impact Factor 0.456
2007 Impact Factor 0.355
2006 Impact Factor 0.757
2005 Impact Factor 0.493
2004 Impact Factor 0.662
2003 Impact Factor 0.541
2002 Impact Factor 0.74
2001 Impact Factor 0.407
2000 Impact Factor 0.408
1999 Impact Factor 0.6
1998 Impact Factor 0.27

Impact factor over time

Impact factor

Additional details

5-year impact 0.63
Cited half-life 8.20
Immediacy index 0.12
Eigenfactor 0.00
Article influence 0.65
Website Journal of Combinatorial Designs website
Other titles Journal of combinatorial designs (Online), Journal of combinatorial designs
ISSN 1520-6610
OCLC 41616630
Material type Document, Periodical, Internet resource
Document type Internet Resource, Computer File, Journal / Magazine / Newspaper

Publisher details


  • Pre-print
    • Author can archive a pre-print version
  • Post-print
    • Author cannot archive a post-print version
  • Restrictions
    • 12 months embargo
  • Conditions
    • Some journals have separate policies, please check with each journal directly
    • On author's personal website, institutional repositories, arXiv, AgEcon, PhilPapers, PubMed Central, RePEc or Social Science Research Network
    • Author's pre-print may not be updated with Publisher's Version/PDF
    • Author's pre-print must acknowledge acceptance for publication
    • On a non-profit server
    • Publisher's version/PDF cannot be used
    • Publisher source must be acknowledged with citation
    • Must link to publisher version with set statement (see policy)
    • If OnlineOpen is available, BBSRC, EPSRC, MRC, NERC and STFC authors, may self-archive after 12 months
    • If OnlineOpen is available, AHRC and ESRC authors, may self-archive after 24 months
    • Publisher last contacted on 07/08/2014
    • This policy is an exception to the default policies of 'Wiley'
  • Classification
    ​ yellow

Publications in this journal

  • [Show abstract] [Hide abstract]
    ABSTRACT: Quantum jump codes are quantum codes that correct errors caused by quantum jumps. A spontaneous emission error design (SEED) was introduced by Beth et al. in 2003 to construct quantum jump codes. In this paper, we study the existence of 3-SEEDs from PSL(2, q) or PGL(2, q). By doing this, a large number of 3- SEEDs are derived for prime powers q and all .
    Journal of Combinatorial Designs 05/2015; DOI:10.1002/jcd.21429
  • [Show abstract] [Hide abstract]
    ABSTRACT: Grooming uniform all-to-all traffic in optical (SONET) rings with grooming ratio C requires the determination of a decomposition of the complete graph into subgraphs each having at most C edges. The drop cost of such a grooming is the total number of vertices of nonzero degree in these subgraphs, and the grooming is optimal when the drop cost is minimum. The determination of optimal C-groomings has been considered for , and completely solved for . For , it has been shown that the lower bound for the drop cost of an optimal C-grooming can be attained for almost all orders with 5 exceptions and 308 possible exceptions. For , there are infinitely many unsettled orders; especially the case is far from complete. In this paper, we show that the lower bound for the drop cost of a 6-grooming can be attained for almost all orders by reducing the 308 possible exceptions to 3, and that the lower bound for the drop cost of a 7-grooming can be attained for almost all orders with seven exceptions and 16 possible exceptions. Moreover, for the unsettled orders, we give upper bounds for the minimum drop costs.
    Journal of Combinatorial Designs 05/2015; DOI:10.1002/jcd.21428
  • [Show abstract] [Hide abstract]
    ABSTRACT: Let be a nontrivial 2- symmetric design admitting a flag-transitive, point-primitive automorphism group G of almost simple type with sporadic socle. We prove that there are up to isomorphism six designs, and must be one of the following: a 2-(144, 66, 30) design with or , a 2-(176, 50, 14) design with , a 2-(176, 126, 90) design with or , or a 2-(14,080, 12,636, 11,340) design with .
    Journal of Combinatorial Designs 04/2015; 23(4):140-150. DOI:10.1002/jcd.21385
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we determine the necessary and sufficient conditions for the existence of an equitably ℓ-colorable balanced incomplete block design for any positive integer . In particular, we present a method for constructing nontrivial equitably ℓ-colorable BIBDs and prove that these examples are the only nontrivial examples that exist. We also observe that every equitable ℓ-coloring of a BIBD yields both an equalized ℓ-coloring and a proper 2-coloring of the same BIBD.
    Journal of Combinatorial Designs 04/2015; DOI:10.1002/jcd.21427
  • [Show abstract] [Hide abstract]
    ABSTRACT: An is a triple , where X is a set of points, is a partition of X into m disjoint sets of size n and is a set of 4-element transverses of , such that each 3-element transverse of is contained in exactly one of them. If the full automorphism group of an admits an automorphism α consisting of n cycles of length m (resp. m cycles of length n), then this is called m-cyclic (resp. semi-cyclic). Further, if all block-orbits of an m-cyclic (resp. semi-cyclic) are full, then it is called strictly cyclic. In this paper, we construct some infinite classes of strictly m-cyclic and semi-cyclic , and use them to give new infinite classes of perfect two-dimensional optical orthogonal codes with maximum collision parameter and AM-OPPTS/AM-OPPW property.
    Journal of Combinatorial Designs 02/2015; DOI:10.1002/jcd.21424
  • [Show abstract] [Hide abstract]
    ABSTRACT: Using the Katona–Kierstead (K–K) definition of a Hamilton cycle in a uniform hypergraph, we investigate the existence of wrapped K–K Hamilton cycle decompositions of the complete bipartite 3-uniform hypergraph and their large sets, settling their existence whenever n is prime.
    Journal of Combinatorial Designs 01/2015; DOI:10.1002/jcd.21423
  • [Show abstract] [Hide abstract]
    ABSTRACT: Every abelian group of even order with a noncyclic Sylow 2-subgroup is known to be R-sequenceable except possibly when the Sylow 2-subgroup has order 8. We construct an R-sequencing for many groups with elementary abelian Sylow 2-subgroups of order 8 and use this to show that all such groups of order other than 8 also have terraces. This completes the proof of Bailey's Conjecture in the abelian case: all abelian groups other than the noncyclic elementary abelian 2-groups have terraces. For odd orders it is known that abelian groups are R-sequenceable except possibly those with noncyclic Sylow 3-subgroups. We show how the theory of narcissistic terraces can be exploited to find R-sequencings for many such groups, including infinitely many groups with each possible of Sylow 3-subgroup type of exponent at most 312and all groups whose Sylow 3-subgroups are of the form or .
    Journal of Combinatorial Designs 01/2015; 23(1). DOI:10.1002/jcd.21396
  • [Show abstract] [Hide abstract]
    ABSTRACT: Given five positive integers and t where and a t-general covering design is a pair where X is a set of n elements (called points) and a multiset of k-subsets of X (called blocks) such that every p-subset of X intersects at least λ blocks of in at least t points. In this article we continue the work carried out by Etzion, Wei, and Zhang [Des. Codes Cryptogr. 5 (1995), 217–239] on the asymptotic covering density of general covering designs. We will present combinatorial constructions leading to new upper bounds on the asymptotic covering density of 4-(n, 4, 6, 1) general covering designs and 4- general covering designs with . The new bound on the asymptotic covering density of 4-(n, 4, 6, 1) general covering designs is equivalent to a new lower bound for the Turán density .
    Journal of Combinatorial Designs 01/2015; 23(1). DOI:10.1002/jcd.21401
  • [Show abstract] [Hide abstract]
    ABSTRACT: It is known that extremal ternary self-dual codes of length mod 12) yield 5-designs. Previously, mutually disjoint 5-designs were constructed by using single known generator matrix of bordered double circulant ternary self-dual codes (see [1, 2]). In this paper, a number of generator matrices of bordered double circulant extremal ternary self-dual codes are searched with the aid of computer. Using these codes we give many mutually disjoint 5-designs. As a consequence, a list of 5-spontaneous emission error designs are obtained.
    Journal of Combinatorial Designs 01/2015; 23(2). DOI:10.1002/jcd.21391
  • [Show abstract] [Hide abstract]
    ABSTRACT: In [U. Dempwolff: More Translation Planes and Semifields from Dembowski-Ostrom Polynomials, Designs, Codes, Cryptogr. \textbf{68} (1-3) (2013), 81-103], the author gives a construction of three classes of rank two semifields of order $q^{2n}$, with $q$ and $n$ odd, using Dembowski-Ostrom polynomials. The question whether these semifields are new, i.e. not isotopic to previous constructions, is left as an open problem. In this paper we solve this problem for $n>3$, in particular we prove that two of these classes, labeled $D_{A}$ and $D_{AB}$, are new for $n>3$, whereas presemifields in family $D_{B}$ are isotopic to Generalized Twisted Fields for each $n\geq 3$.
    Journal of Combinatorial Designs 01/2015; 23(2). DOI:10.1002/jcd.21382
  • [Show abstract] [Hide abstract]
    ABSTRACT: A cube design of order v, or a CUBE(v), is a decomposition of all cyclicly oriented quadruples of a v-set into oriented cubes. A CUBE(v) design is unoriented if its cubes can be paired so that the cubes in each pair are related by reflection through the center. A cube design is degenerate if it has repeated points on one of its cubes, otherwise it is nondegenerate.We show that a nondegenerate CUBE(v) design exists for all integers , and that an unoriented nondegenerate CUBE(v) design exists if and only if and or . A degenerate example of a CUBE(v) design is also given for each integer .
    Journal of Combinatorial Designs 01/2015; DOI:10.1002/jcd.21422
  • [Show abstract] [Hide abstract]
    ABSTRACT: A 3-phase Barker array is a matrix of third roots of unity for which all out-of-phase aperiodic autocorrelations have magnitude 0 or 1. The only known truly two-dimensional 3-phase Barker arrays have size 2 × 2 or 3 × 3. We use a mixture of combinatorial arguments and algebraic number theory to establish severe restrictions on the size of a 3-phase Barker array when at least one of its dimensions is divisible by 3. In particular, there exists a double-exponentially growing arithmetic function T such that no 3-phase Barker array of size with exists for all . For example, , , and . When both dimensions are divisible by 3, the existence problem is settled completely: if a 3-phase Barker array of size exists, then .
    Journal of Combinatorial Designs 01/2015; 23(2). DOI:10.1002/jcd.21377
  • [Show abstract] [Hide abstract]
    ABSTRACT: Using the technique of amalgamation-detachment, we show that the complete equipartite multigraph can be decomposed into cycles of lengths (plus a 1-factor if the degree is odd) whenever there exists a decomposition of into cycles of lengths (plus a 1-factor if the degree is odd). In addition, we give sufficient conditions for the existence of some other, related cycle decompositions of the complete equipartite multigraph .
    Journal of Combinatorial Designs 12/2014; DOI:10.1002/jcd.21419