The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Joint Physical Layer Coding and Network Coding for Bidirectional Relaying
Open accessAbstract
We consider a communication system where two transmitters wish to exchange information through a central relay. The transmitter and relay nodes exchange data over synchronized, average power constrained additive white Gaussian noise channels with a real input with signal-to-noise ratio (SNR) of snr. An upper bound on the capacity is 1/2 log(1 + snr) bits per transmitter per use of the multiple access phase and broadcast phase of the bidirectional relay channel. We show that, using lattice codes and lattice decoding, we can obtain a rate of 1/2 log(1/2 + snr) bits per transmitter, which is essentially optimal at high SNR. The main idea is to decode the sum of the codewords modulo a lattice at the relay followed by a broadcast phase which performs Slepian-Wolf coding. We also show that if the two transmitters use identical lattices with minimum angle decoding, we can achieve the same rate of 1/2 log(1/2 + snr). The proposed scheme can be thought of as a joint physical-layer network-layer code which outperforms other recently proposed analog network coding schemes.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
XORs in the Air: Practical Wireless Network Coding
Katti, S., Rahul, H., Hu, W., Katabi, D., Medard, M., & Crowcroft, J. (2008) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2008.923722 · Cited by 2,252
Embracing wireless interference: analog network coding
Katti, S., Gollakota, S., & Katabi, D. (2007) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1282380.1282425 · Cited by 1,253
Nested linear/lattice codes for structured multiterminal binning
Zamir, R., Shamai, S., & Erez, U. (2002) · IEEE Transactions on Information Theory · doi:10.1109/tit.2002.1003821 · Cited by 876
Probability of Error for Optimal Codes in a Gaussian Channel
Shannon, C. E. (1959) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1959.tb03905.x · Cited by 807
Computation Over Multiple-Access Channels
Nazer, B., & Gastpar, M. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.904785 · Cited by 753
Achieving<tex>$ 1over 2log (1+ hboxSNR)$</tex>on the AWGN Channel With Lattice Encoding and Decoding
Erez, U., & Zamir, R. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.834787 · Cited by 732
Lattices Which Are Good for (Almost) Everything
Erez, U., Litsyn, S., & Zamir, R. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.855591 · Cited by 365
How to encode the modulo-two sum of binary sources (Corresp.)
Korner, J., & Marton, K. (1979) · IEEE Transactions on Information Theory · doi:10.1109/tit.1979.1056022 · Cited by 355
Lattice codes can achieve capacity on the AWGN channel
Urbanke, R. L., & Rimoldi, B. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.651040 · Cited by 119
The case for structured random codes in network capacity theorems
Nazer, B., & Gastpar, M. (2008) · European Transactions on Telecommunications · doi:10.1002/ett.1284 · Cited by 72
Cited by
Compute-and-Forward: Harnessing Interference Through Structured Codes
Nazer, B., & Gastpar, M. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2165816 · Cited by 990
Optimal beamforming for two-way multi-antenna relay channel with analogue network coding
Zhang, R., Liang, Y.-C., Chai, C. C., & Cui, S. (2009) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2009.090611 · Cited by 560
Metadata
- Authors
- Wilson, M. P., Narayanan, K., Pfister, H. D., & Sprintson, A.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2010-11
- Volume
- 56
- Issue
- 11
- Pages
- 5641-5654
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2147355810
- Cited by
- 494
- References
- 11
- FWCI
- 103.20
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Joint Physical Layer Coding and Network Coding for Bidirectional Relaying. https://app.cochat.ai/papers/10.1109/tit.2010.2068750
- The paper
- Wilson, M. P., Narayanan, K., Pfister, H. D., & Sprintson, A. (2010). Joint Physical Layer Coding and Network Coding for Bidirectional Relaying. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.2010.2068750
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.