An upper bound on error probability in communication systems with single-user reception based on order statistics
From MaRDI portal
Publication:827893
DOI10.1134/S0005117920010099zbMath1458.94198OpenAlexW3008228874MaRDI QIDQ827893
Publication date: 14 January 2021
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0005117920010099
order statisticsupper bounderror probabilitydisjoint subchannelsnon-binary linear codessingle-user reception
Linear codes (general theory) (94B05) Channel models (including quantum) in information and communication theory (94A40) Communication theory (94A05)
Cites Work
- Unnamed Item
- On the user capacity for a multiple-access system in a vector disjunctive channel with errors
- New performance bounds for turbo codes
- On the Application of LDPC Codes to Arbitrary Discrete-Memoryless Channels
- The ML Decoding Performance of LDPC Ensembles Over<tex>$ BBZ _q$</tex>
- On the T-user M-frequency noiseless multiple-access channel with and without intensity information
- Techniques of bounding the probability of decoding error for block coded modulation structures
- Nonrandom binary superimposed codes
- Elements of Information Theory
- A simple derivation of the coding theorem and some applications
This page was built for publication: An upper bound on error probability in communication systems with single-user reception based on order statistics
