Some 20-regular CDP(5,1;20u) and their applications

Authors:
Jianxing Yin;Xiaoke Yang;Yang Li
Affiliations:
Department of Mathematics, Soochow University, Suzhou 215006, China;Department of Mathematics, Soochow University, Suzhou 215006, China;Department of Mathematics, Soochow University, Suzhou 215006, China
Venue:
Finite Fields and Their Applications
Year:
2011

Citing 19
Cited 0

Constructions of (q,k,1) difference families with q a prime power and k=4,5

Selected papers of the 14th British conference on Combinatorial conference
A survey on relative difference sets

GDSTM '93 Proceedings of a special research quarter on Groups, difference sets, and the monster
Some combinational constructions for optical orthogonal codes

Discrete Mathematics
Existence of (q,6,1) Difference Families withq a Prime Power

Designs, Codes and Cryptography
A general construction for optimal cyclic packing designs

Journal of Combinatorial Theory Series A
Optimal (9v, 4, 1) Optical Orthogonal Codes

SIAM Journal on Discrete Mathematics
Cyclic Designs with Block Size 4 and Related Optimal Optical Orthogonal Codes

Designs, Codes and Cryptography
Some progress on (v, 4, 1) difference families and optical orthogonal codes

Journal of Combinatorial Theory Series A
Directed--ordered whist tournaments and (v,5,1) difference families: existence results and some new classes of Z-cyclic solutions

Discrete Applied Mathematics
Some difference matrix constructions and an almost completion for the existence of triplewhist tournaments TWh(v)

European Journal of Combinatorics
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)

Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Strong difference families, difference covers, and their applications for relative difference families

Designs, Codes and Cryptography
Further progress on difference families with block size 4 or 5

Designs, Codes and Cryptography
Optical orthogonal codes: their bounds and new optimal constructions

IEEE Transactions on Information Theory
Constructions for optimal (υ, 4, 1) optical orthogonal codes

IEEE Transactions on Information Theory
A new class of optimal optical orthogonal codes with weight five

IEEE Transactions on Information Theory
Constructions for optimal constant weight cyclically permutable codes and difference families

IEEE Transactions on Information Theory
Combinatorial designs and the theorem of Weil on multiplicative character sums

Finite Fields and Their Applications
Cyclotomic Conditions Leading to New Steiner 2-Designs

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a direct construction for 20-regular cyclic difference packings CDP(5,1;20p)@?s when p=1(mod6) is a prime. Then, recursively, we prove the existence of an optimal (20@?3^@au,5,1) optical orthogonal code for every nonnegative integer @a and any positive integer u whose prime factors are all congruent to 1 (mod 6).