A powerful method for constructing difference families and optimal optical orthogonal codes-Reference-Cited by-同舟云学术

A powerful method for constructing difference families and optimal optical orthogonal codes

Published:1995-01 Issue:1 Volume:5 Page:13-25
ISSN:0925-1022
Container-title:Designs, Codes and Cryptography
language:en
Short-container-title:Des Codes Crypt

Author:

Buratti Marco

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications

Link

http://link.springer.com/article/10.1007/BF01388501/fulltext.html

Reference31 articles.

1. Beth, T., Jungnickel, D., and Lenz, H. 1993.Design Theory. Cambridge University Press, Cambridge.

2. Bitan, S., and Etzion, T. 1993. The last packing number of quadruples and cyclic SQS.Designs, Codes and Cryptography 3(4):283?313.

3. Bitan, S., and Etzion, T. 1993. Constructions for optimal constant weight cyclically permutable codes and difference families. Submitted toIEEE Transactions of Information Theory.

4. Bose, R. C. 1939. On the construction of balanced incomplete block designs.Ann. Eugenics 9:353?399.

5. Brickell, E. F., and Wei, V. K. 1987. Optical orthogonal codes and cyclic block designs.Congressus Numerantium 58:175?192.

Cited by 25 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Balanced ($\mathbb{Z} _{2u}\times \mathbb{Z}_{38v}$, {3, 4, 5}, 1) difference packings and related codes;Advances in Mathematics of Communications;2022

2. On optimal (Z6m×Z6n,4,1) and (Z2m×Z18n,4,1) difference packings and their related codes;Journal of Combinatorial Designs;2021-11-16

3. On balanced (Z4u×Z8v,{4,5},1) difference packings;Discrete Mathematics;2021-11

4. The sizes of maximal $$(v,k,k-2,k-1)$$ optical orthogonal codes;Designs, Codes and Cryptography;2020-01-16

5. Grid-block difference families and related combinatorial structures;Discrete Mathematics;2019-07