标题: Weighted maximum matchings and optimal equi-difference conflict-avoiding codes
作者: Lo, Yuan-Hsun
Fu, Hung-Lin
Lin, Yi-Hean
应用数学系
Department of Applied Mathematics
关键字: Conflict-avoiding code;Equi-difference conflict-avoiding code;Weighted matching
公开日期: 1-八月-2015
摘要: A conflict-avoiding code (CAC) of length and weight is a collection of -subsets of such that for any and , where . Let denote the class of all CACs of length and weight . A CAC is said to be equi-difference if any codeword has the form . A CAC with maximum size is called optimal. In this paper we propose a graphical characterization of an equi-difference CAC, and then provide an infinite number of optimal equi-difference CACs for weight four.
URI: http://dx.doi.org/10.1007/s10623-014-9961-5
http://hdl.handle.net/11536/127846
ISSN: 0925-1022
DOI: 10.1007/s10623-014-9961-5
期刊: DESIGNS CODES AND CRYPTOGRAPHY
Volume: 76
起始页: 361
结束页: 372
显示于类别:Articles