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

DOI10.1109/TIT.2007.901233zbMath1325.94079MaRDI QIDQ3548920

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

Publication date: 21 December 2008

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

Mathematics Subject Classification ID

Source coding (94A29)

Related Items (17)

Optimal strongly conflict-avoiding codes of even length and weight three ⋮ On cyclic \(2(k-1)\)-support \((n,k)_{k-1}\) difference families ⋮ 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 ⋮ Bounds and Constructions on (v, 4, 3, 2) Optical Orthogonal Codes ⋮ Certain diagonal equations and conflict-avoiding codes of prime lengths ⋮ Optimal 2-D \((n\times m,3,2,1)\)-optical orthogonal codes and related equi-difference conflict avoiding codes ⋮ 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 for three, four and five active users ⋮ Optimal conflict-avoiding codes of odd length and weight three ⋮ Optimal Tight Equi‐Difference Conflict‐Avoiding Codes of Length n = 2^k ± 1 and Weight 3 ⋮ Optimal optical orthogonal signature pattern codes with weight three and cross-correlation constraint one ⋮ Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3 ⋮ Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three ⋮ Optimal equi-difference conflict-avoiding codes of weight four

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