Optimal conflict-avoiding codes of odd length and weight three

標題:	Optimal conflict-avoiding codes of odd length and weight three
作者:	Fu, Hung-Lin Lo, Yuan-Hsun Shum, Kenneth W. 應用數學系 Department of Applied Mathematics
關鍵字:	Conflict-avoiding code;Tight equi-difference conflict-avoiding code;Optimal code with weight 3
公開日期:	1-Aug-2014
摘要:	A conflict-avoiding code (CAC) of length n and weight k is a collection of k-subsets of such that for any , , where . Let CAC(n, k) denote the class of all CACs of length n and weight k. A CAC with maximum size is called optimal. In this paper, we study the constructions of optimal CACs for the case when n is odd and k = 3.
URI:	http://dx.doi.org/10.1007/s10623-012-9764-5 http://hdl.handle.net/11536/24383
ISSN:	0925-1022
DOI:	10.1007/s10623-012-9764-5
期刊:	DESIGNS CODES AND CRYPTOGRAPHY
Volume:	72
Issue:	2
起始頁:	289
結束頁:	309
Appears in Collections:	Articles

Files in This Item:

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.