Constant Weight Conflict-Avoiding Codes
DOI10.1137/06067852XzbMATH Open1166.94010OpenAlexW1988374660MaRDI QIDQ3544245FDOQ3544245
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
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
cyclotomic cosetsconflict-avoiding codesconstant weight codesrecursive constructionsKronecker density
Combinatorial codes (94B25) Applications of design theory to circuits and networks (94C30) Density theorems (11R45)
Cited In (22)
- Explicit constructions of optimal conflict-avoiding codes
- Partially user-irrepressible sequence sets and conflict-avoiding codes
- Optimal equi-difference conflict-avoiding codes of weight four
- 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
- Strongly Conflict-Avoiding Codes
- A new series of optimal tight conflict-avoiding codes of weight 3
- Multichannel Conflict-Avoiding Codes of Weights Three and Four
- Constructions of optimal variable-weight OOCs via quadratic residues
- 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)
