Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
Author:
- 11 October 2007
- journal article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 45 (3) , 379-390
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Constant Weight Conflict-Avoiding CodesSIAM Journal on Discrete Mathematics, 2008
- On Conflict-Avoiding Codes of Length $n=4m$ for Three Active UsersIEEE Transactions on Information Theory, 2007
- A powerful method for constructing difference families and optimal optical orthogonal codesDesigns, Codes and Cryptography, 1995
- Constructions of protocol sequences for multiple access collision channel without feedbackIEEE Transactions on Information Theory, 1993
- Constructions of binary constant-weight cyclic codes and cyclically permutable codesIEEE Transactions on Information Theory, 1992
- Optical orthogonal codes-new bounds and an optimal constructionIEEE Transactions on Information Theory, 1990
- A class of codes for a T active users out of N multiple-access communication systemIEEE Transactions on Information Theory, 1990
- Optical orthogonal codes: design, analysis and applicationsIEEE Transactions on Information Theory, 1989
- The collision channel without feedbackIEEE Transactions on Information Theory, 1985
- Sums of Gauss, Jacobi, and JacobsthalJournal of Number Theory, 1979