Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
binary adder channel
Description:
A binary adder channel is a multiple-access communication channel whose output is the sum of simultaneous binary inputs.
Primary topic:
Coding theory and cryptography (41%)
Related topics:
Coding theory and cryptography (41%),
Error Correcting Code Techniques (40%)
OpenAlex ID:
keywords/binary-adder-channel
Linear codes with complementary duals
1992
·
James L. Massey
·
Discrete Mathematics
·
578
PDF
Low complexity schemes for the random access Gaussian channel
2017
·
Or Ordentlich
, Yury Polyanskiy
·
IEEE International Symposium on Information Theory (ISIT)
·
240
Construction of uniquely decodable codes for the two-user binary adder channel
1999
·
R. Ahlswede
, V.B. Balakirsky
·
IEEE Transactions on Information Theory
·
48
PDF
Further results on coding for T-user multiple-access channels (Corresp.)
1984
·
Shih-Chun Chang
·
IEEE Transactions on Information Theory
·
38
A New Bound for the Zero-Error Capacity Region of the Two-User Binary Adder Channel
2005
·
M. Mattas
, P.R.J. Ostergard
·
IEEE Transactions on Information Theory
·
37
Generalized T-user codes for multiple-access channels (Corresp.)
1982
·
T. Ferguson
·
IEEE Transactions on Information Theory
·
35
Nearly optimal multiuser codes for the binary adder channel
1996
·
B.L. Hughes
, A.B. Cooper
·
IEEE Transactions on Information Theory
·
34
Iterative multi-user decoding for asynchronous users
2002
·
F. Tarkoy
·
IEEE International Symposium on Information Theory (ISIT)
·
29
The noncooperative binary adder channel
1986
·
T. Ericson
·
IEEE Transactions on Information Theory
·
25
Recursive Constructions of Detecting Matrices for Multiuser Coding: A Unifying Approach
2009
·
Wai Ho Mow
·
IEEE Transactions on Information Theory
·
24
Code construction for the noiseless binary switching multiple-access channel
1988
·
P. Vanroose
·
IEEE Transactions on Information Theory
·
24
Multiple-Access Channel Coding With Non-Signaling Correlations
2023
·
Omar Fawzi
, Paul Fermé
·
IEEE Transactions on Information Theory
·
23
PDF
The zero-error capacity region of the 2-user synchronous BAC is strictly smaller than its Shannon capacity region
2002
·
R. Urbanke
, Quinn Li
·
IEEE Information Theory Workshop (ITW)
·
23
Error-correcting codes for a T-user binary adder channel
1988
·
J.H. Wilson
·
IEEE Transactions on Information Theory
·
23
New constructions of optimal binary LCD codes
2024
·
Guodong Wang
, Shengwei Liu
, et al.
·
Finite Fields and Their Applications
·
18
PDF
Upper bounds on|C_2|for a uniquely decodable code pair(C_1, C_2)for a two-access binary adder channel
1983
·
H. van Tilborg
·
IEEE Transactions on Information Theory
·
18
On Coding Techniques for Unsourced Multiple-Access
2021
·
Gianluigi Liva
, Yury Polyanskiy
·
Asilomar Conference on Signals, Systems and Computers (ACSSC)
·
17
A VC-dimension-based outer bound on the zero-error capacity of the binary adder channel
2015
·
Or Ordentlich
, Ofer Shayevitz
·
IEEE International Symposium on Information Theory (ISIT)
·
14
PDF
Graphs of Joint Types, Noninteractive Simulation, and Stronger Hypercontractivity
2024
·
Lei Yu
, Venkat Anantharam
, et al.
·
IEEE Transactions on Information Theory
·
13
PDF
New Uniquely Decodable Codes for the $T$-User Binary Adder Channel With $3 \le T \le 5$
2007
·
Lasse Kiviluoto
, Patric R. J. Ostergard
·
IEEE Transactions on Information Theory
·
13
Beating the Sum-Rate Capacity of the Binary Adder Channel with Non-Signaling Correlations
2022
·
Omar Fawzi
, Paul Fermé
·
IEEE International Symposium on Information Theory (ISIT)
·
12
Error control coding for the N-user mod-2 multiple-access channel
1998
·
V.P. Telang
, M.A. Herro
·
IEEE Transactions on Information Theory
·
12
Upper bound for uniquely decodable codes in a binary input N-user adder channel
1998
·
S.I. Bross
, I.F. Blake
·
IEEE Transactions on Information Theory
·
12
Deterministic Identification Over Multiple-Access Channels
2023
·
Johannes Rosenberger
, Abdalla Ibrahim
, et al.
·
IEEE International Symposium on Information Theory (ISIT)
·
11
PDF
Some families of zero- error block codes for the two-user binary adder channel with feedback
1987
·
Zhen Zhang
, T. Berger
, et al.
·
IEEE Transactions on Information Theory
·
11
Show more works
View as search
Works count:
97
Citation count:
1,491
Year
Topic
Type