On Conflict-Avoiding Codes of Length n=4m for Three Active Users

DOI10.1109/TIT.2007.901233MaRDI QIDQ3548920zbMATH OpenFDO

Authors Masakazu Jimbo, Miwako Mishima, Susan Janiszewski, Amin Y. Teymorian, Vladimir D. Tonchev

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2007.901233

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• Optimal conflict-avoiding codes for three, four and five active users
• Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3
• Optimal strongly conflict-avoiding codes of even length and weight three
• Optimal Conflict-Avoiding Codes of Even Length and Weight 3
• Optimal conflict-avoiding codes of odd length and weight three
• Multichannel Conflict-Avoiding Codes of Weights Three and Four
• Optimal tight equi-difference conflict-avoiding codes of length \(n = 2^{k} \pm 1\) and weight 3
• A new series of optimal tight conflict-avoiding codes of weight 3
• Optimal equi-difference conflict-avoiding codes of odd length and weight three
• New optimal constructions of conflict-avoiding codes of odd length and weight 3

Cited in

(19)

• Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
• Optimal conflict-avoiding codes for three, four and five active users
• Optimal conflict-avoiding codes of odd length and weight three
• Optimal optical orthogonal signature pattern codes with weight three and cross-correlation constraint one
• Optimal 2-D \((n\times m,3,2,1)\)-optical orthogonal codes and related equi-difference conflict avoiding codes
• Partially user-irrepressible sequence sets and conflict-avoiding codes
• Optimal equi-difference conflict-avoiding codes of weight four
• 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
• Optimal strongly conflict-avoiding codes of even length and weight three
• Bounds and constructions on (v,4,3,2) optical orthogonal codes
• New optimal constructions of conflict-avoiding codes of odd length and weight 3
• Optimal tight equi-difference conflict-avoiding codes of length \(n = 2^{k} \pm 1\) and weight 3
• Weighted maximum matchings and optimal equi-difference conflict-avoiding codes
• Multichannel Conflict-Avoiding Codes of Weights Three and Four
• A new series of optimal tight conflict-avoiding codes of weight 3
• Certain diagonal equations and conflict-avoiding codes of prime lengths
• 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

This page was built for publication: On Conflict-Avoiding Codes of Length $n=4m$ for Three Active Users

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