Constant Weight Conflict-Avoiding Codes

DOI10.1137/06067852XzbMath1166.94010MaRDI QIDQ3544245

Koji Momihara, Junya Satoh, Masakazu Jimbo, Meinard Müller

Publication date: 5 December 2008

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/06067852x

zbMATH Keywords

constant weight codes; cyclotomic cosets; conflict-avoiding codes; recursive constructions; Kronecker density

Mathematics Subject Classification ID

94C30: Applications of design theory to circuits and networks

11R45: Density theorems

94B25: Combinatorial codes

Related Items

Optimal Tight Equi‐Difference Conflict‐Avoiding Codes of Length n = 2^k ± 1 and Weight 3, Partially user-irrepressible sequence sets and conflict-avoiding codes, Optimal equi-difference conflict-avoiding codes of weight four, Optimal strongly conflict-avoiding codes of even length and weight three, Constructions of optimal variable-weight OOCs via quadratic residues, New optimal constructions of conflict-avoiding codes of odd length and weight 3, Weighted maximum matchings and optimal equi-difference conflict-avoiding codes, A new series of optimal tight conflict-avoiding codes of weight 3, Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3, On cyclic \(2(k-1)\)-support \((n,k)_{k-1}\) difference families, Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three, Classification of optimal conflict-avoiding codes of weights 6 and 7, Optimal conflict-avoiding codes for three, four and five active users, Optimal conflict-avoiding codes of odd length and weight three, Optimal equi-difference conflict-avoiding codes of odd length and weight three, Some infinite classes of optimal \({(v,\{3,4\},1,Q)}\)-OOCs with \({Q\in\{(\frac{1}{3},\frac{2}{3}),(\frac{2}{3},\frac{1}{3})\}}\), A tight asymptotic bound on the size of constant-weight conflict-avoiding codes