An upper bound on error probability in communication systems with single-user reception based on order statistics
From MaRDI portal
(Redirected from Publication:827893)
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
Cites work
- scientific article; zbMATH DE number 7434519 (Why is no real title available?)
- A simple derivation of the coding theorem and some applications
- Elements of Information Theory
- New performance bounds for turbo codes
- Nonrandom binary superimposed codes
- On the Application of LDPC Codes to Arbitrary Discrete-Memoryless Channels
- On the T-user M-frequency noiseless multiple-access channel with and without intensity information
- On the user capacity for a multiple-access system in a vector disjunctive channel with errors
- Techniques of bounding the probability of decoding error for block coded modulation structures
- The ML Decoding Performance of LDPC Ensembles Over<tex>$ BBZ _q$</tex>
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)