Upper bound for uniquely decodable codes in a binary input N-user adder channel
From MaRDI portal
Publication:4392466
DOI10.1109/18.651062zbMath0906.94012OpenAlexW2159734452MaRDI QIDQ4392466
Publication date: 23 February 1999
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.651062
Channel models (including quantum) in information and communication theory (94A40) Prefix, length-variable, comma-free codes (94A45)
Related Items (1)
This page was built for publication: Upper bound for uniquely decodable codes in a binary input N-user adder channel