A class of codes for a T active users out of N multiple-access communication system
From MaRDI portal
Publication:3363220
DOI10.1109/18.59923zbMath0734.94002OpenAlexW2120058847MaRDI QIDQ3363220
Publication date: 1990
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.59923
Channel models (including quantum) in information and communication theory (94A40) Communication theory (94A05) Coding theorems (Shannon theory) (94A24)
Related Items (13)
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 ⋮ Certain diagonal equations and conflict-avoiding codes of prime lengths ⋮ New optimal constructions of conflict-avoiding codes of odd length and weight 3 ⋮ Conflict-avoiding codes and cyclic triple systems ⋮ Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing ⋮ A new series of optimal tight conflict-avoiding codes of weight 3 ⋮ Optimal conflict-avoiding codes of odd length and weight three ⋮ Optimal Tight Equi‐Difference Conflict‐Avoiding Codes of Length n = 2k ± 1 and Weight 3 ⋮ Optimal conflict-avoiding codes of length \(n\equiv 0\pmod{16}\) and weight 3 ⋮ Separable collusion-secure multimedia codes ⋮ Necessary and sufficient conditions for tight equi-difference conflict-avoiding codes of weight three
This page was built for publication: A class of codes for a T active users out of N multiple-access communication system
