On the T-user M-frequency noiseless multiple-access channel with and without intensity information
From MaRDI portal
Publication:3904502
DOI10.1109/TIT.1981.1056304zbMath0455.94010OpenAlexW2003564337MaRDI QIDQ3904502
Jack Keil Wolf, Shih-Chun Chang
Publication date: 1981
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1981.1056304
Channel models (including quantum) in information and communication theory (94A40) Coding theorems (Shannon theory) (94A24)
Related Items (10)
An upper bound on error probability in communication systems with single-user reception based on order statistics ⋮ Random multiple access in a vector disjunctive channel ⋮ Multiple access system for a vector disjunctive channel ⋮ Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing ⋮ Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise ⋮ Remark on ``on the capacity of a multiple-access vector adder channel ⋮ On the user capacity for a multiple-access system in a vector disjunctive channel with errors ⋮ On the capacity of a multiple-access vector adder channel ⋮ Separable collusion-secure multimedia codes ⋮ Compositional restricted multiple access channel
This page was built for publication: On the T-user M-frequency noiseless multiple-access channel with and without intensity information