An upper bound on error probability in communication systems with single-user reception based on order statistics
DOI10.1134/S0005117920010099zbMATH Open1458.94198OpenAlexW3008228874MaRDI QIDQ827893FDOQ827893
Authors: Dmitry Sergeevich Osipov 
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
Recommendations
- First-order approximation of the ordered binary-symmetric channel
- Upper bounds on the probability of nondetected error
- Lower bounds to error probability for coding on discrete memoryless channels. I
- A simple derivation of the coding theorem and some applications
- A new lower bound for the a-mean error of parameter transmission over the white Gaussian channel
order statisticsupper bounderror probabilitydisjoint subchannelsnon-binary linear codessingle-user reception
Communication theory (94A05) Linear codes (general theory) (94B05) Channel models (including quantum) in information and communication theory (94A40)
Cites Work
- Elements of Information Theory
- Nonrandom binary superimposed codes
- Title not available (Why is that?)
- A simple derivation of the coding theorem and some applications
- On the T-user M-frequency noiseless multiple-access channel with and without intensity information
- On the Application of LDPC Codes to Arbitrary Discrete-Memoryless Channels
- Techniques of bounding the probability of decoding error for block coded modulation structures
- On the user capacity for a multiple-access system in a vector disjunctive channel with errors
- New performance bounds for turbo codes
- The ML Decoding Performance of LDPC Ensembles Over<tex>$ BBZ _q$</tex>
Cited In (1)
This page was built for publication: An upper bound on error probability in communication systems with single-user reception based on order statistics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q827893)
