Optimal conflict-avoiding codes of odd length and weight three
Loading...
Date
Journal Title
Journal ISSN
Volume Title
Publisher
DOI
10.1007/s10623-012-9764-5
Abstract
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.