Constant Weight Conflict-Avoiding Codes

DOI10.1137/06067852XMaRDI QIDQ3544245zbMATH OpenOpenAlexFDO

Authors 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

cyclotomic cosetsconflict-avoiding codesconstant weight codesrecursive constructionsKronecker density

Mathematics Subject Classification ID

Combinatorial codes (94B25) Applications of design theory to circuits and networks (94C30) Density theorems (11R45)

Recommendations

• New optimal constructions of conflict-avoiding codes of odd length and weight 3
• scientific article; zbMATH DE number 6500353
• Optimal conflict-avoiding codes of odd length and weight three
• Optimal equi-difference conflict-avoiding codes of weight four
• Explicit constructions of optimal conflict-avoiding codes

Cited in

(22)

• Partially user-irrepressible sequence sets and conflict-avoiding codes
• Optimal equi-difference conflict-avoiding codes of weight four
• Explicit constructions of optimal conflict-avoiding codes
• New optimal constructions of conflict-avoiding codes of odd length and weight 3
• Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3
• 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})\}}\)
• Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
• Optimal strongly conflict-avoiding codes of even length and weight three
• New constant weight codes and packing numbers
• Classification of optimal conflict-avoiding codes of weights 6 and 7
• Optimal conflict-avoiding codes for three, four and five active users
• Optimal tight equi-difference conflict-avoiding codes of length \(n = 2^{k} \pm 1\) and weight 3
• Some constructions of conflict-avoiding codes
• Optimal conflict-avoiding codes of odd length and weight three
• Optimal equi-difference conflict-avoiding codes of odd length and weight three
• A tight asymptotic bound on the size of constant-weight conflict-avoiding codes
• Weighted maximum matchings and optimal equi-difference conflict-avoiding codes
• A new series of optimal tight conflict-avoiding codes of weight 3
• Strongly Conflict-Avoiding Codes
• Constructions of optimal variable-weight OOCs via quadratic residues
• Multichannel Conflict-Avoiding Codes of Weights Three and Four
• On cyclic \(2(k-1)\)-support \((n,k)_{k-1}\) difference families

This page was built for publication: Constant Weight Conflict-Avoiding Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3544245)