Access the full text.
Sign up today, get DeepDyve free for 14 days.
V.I. Levenshtein (2007)
Conflict-Avoiding Codes and Cyclic Triple SystemsProbl. Peredachi Inf., 43
K. Shum, W. Wong (2010)
A tight asymptotic bound on the size of constant-weight conflict-avoiding codesDesigns, Codes and Cryptography, 57
K. Shum, W. Wong, Chung Chen (2009)
A General Upper Bound on the Size of Constant-Weight Conflict-Avoiding CodesIEEE Transactions on Information Theory, 56
F.R.K. Chung, J.A. Salehi, V.K. Wei (1989)
Optical Orthogonal Codes: DesignAnalysis, and Applications, IEEE Trans. Inform. Theory, 35
S. Wu, H. Fu (2013)
Optimal Tight Equi‐Difference Conflict‐Avoiding Codes of Length n = 2k ± 1 and Weight 3Journal of Combinatorial Designs, 21
L.A. Bassalygo, M.S. Pinsker (1983)
Restricted Asynchronous Multiple AccessProbl. Peredachi Inf., 19
V.I. Levenshtein (2005)
Proc. 14th Int. Conf. on Problems of Theoretical Cybernetics, Penza, Russia, May 23–28
F. Graham, J. Salehi, V. Wei (1989)
Optical orthogonal codes: Design, analysis, and applicationsIEEE Trans. Inf. Theory, 35
H. Fu, Yi-Hean Lin, Miwako Mishima (2010)
Optimal Conflict-Avoiding Codes of Even Length and Weight 3IEEE Transactions on Information Theory, 56
T. Baicheva, S. Topalova (2015)
Proc. Int. Sci. Jubilee Conf. “25 Years Faculty of Mathematics and Informatics,” Veliko Tarnovo, Bulgaria, Nov. 27–28
Masakazu Jimbo, Miwako Mishima, Susan Janiszewski, Amin Teymorian, V. Tonchev (2007)
On Conflict-Avoiding Codes of Length $n=4m$ for Three Active UsersIEEE Transactions on Information Theory, 53
K. Momihara, Meinard Müller, Junya Satoh, Masakazu Jimbo (2007)
Constant Weight Conflict-Avoiding CodesSIAM J. Discret. Math., 21
V. Levenshtein (2007)
Conflict-avoiding codes and cyclic triple systemsProblems of Information Transmission, 43
V.I. Levenshtein, V.D. Tonchev (2005)
Proc. 2005 IEEE Int. Sympos. on Information Theory (ISIT’2005), Adelaide, Australia, Sept. 4–9
V. Levenshtein, V. Tonchev (2005)
Optimal conflict-avoiding codes for three active usersProceedings. International Symposium on Information Theory, 2005. ISIT 2005.
H. Fu, Yuan-Hsun Lo, K. Shum (2014)
Optimal conflict-avoiding codes of odd length and weight threeDesigns, Codes and Cryptography, 72
(1983)
Restricted Asynchronous Multiple Access, Probl
T. Baicheva, S. Topalova (2013)
Optimal (v, 5, 2, 1) Optical Orthogonal Codes of Small vAppl. Algebra Engrg. Comm. Comput., 24
T. Baicheva, S. Topalova (2010)
Optimal (v, 4, 2, 1) optical orthogonal codes with small parametersJournal of Combinatorial Designs, 20
Wenping Ma, Chun-e Zhao, D. Shen (2014)
New optimal constructions of conflict-avoiding codes of odd length and weight 3Designs, Codes and Cryptography, 73
K. Momihara (2007)
Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight threeDesigns, Codes and Cryptography, 45
Yiling Lin, Miwako Mishima, Junya Satoh, Masakazu Jimbo (2014)
Optimal equi-difference conflict-avoiding codes of odd length and weight threeFinite Fields Their Appl., 26
T. Baicheva, S. Topalova (2015)
Classification of Maximal Optical Orthogonal Codes of Weight 3 and Small LengthsSerdica Journal of Computing
T. Baicheva, S. Topalova (2013)
Optimal $$(v,5,2,1)$$(v,5,2,1) optical orthogonal codes of small $$v$$vApplicable Algebra in Engineering, Communication and Computing, 24
Miwako Mishima, H. Fu, Sho Uruno (2009)
Optimal conflict-avoiding codes of length n ≡ 0 (mod 16) and weight 3Designs, Codes and Cryptography, 52
Conflict-avoiding codes are used in multiple-access collision channels without feedback. The number of codewords in a conflict-avoiding code is the number of potential users of the channel. That is why codes with maximum cardinality (optimal codes) for given parameters are of interest. In this paper we classify, up to multiplier equivalence, all optimal conflict-avoiding codes of weights 3, 4, and 5 and given small lengths. We also determine some previously unknown values of the maximum cardinality of conflict-avoiding codes of weights 4 and 5.
Problems of Information Transmission – Springer Journals
Published: Apr 23, 2017
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.