Lower bound for error probability in a discrete memoryless channel with feedback
From MaRDI portal
Publication:788694
zbMATH Open0531.94009MaRDI QIDQ788694FDOQ788694
Authors: A. Yu. Sheverdyaev 
Publication date: 1983
Published in: Problems of Information Transmission (Search for Journal in Brave)
Recommendations
- Lower bounds to error probability for coding on discrete memoryless channels. I
- Lower bound for ensemble-average error probability for a discrete memoryless channel
- scientific article; zbMATH DE number 3242951
- On the converse to the coding theorem for discrete memoryless channels (Corresp.)
- scientific article; zbMATH DE number 3510190
error probabilitychannel capacityArimoto upper boundblock transmissiondiscrete memoryless channellower spherical-packing bound
Channel models (including quantum) in information and communication theory (94A40) Error probability in coding theory (94B70)
Cited In (11)
- Feedback does not affect the reliability function of a DMC at rates above capacity (Corresp.)
- Title not available (Why is that?)
- Error Exponents for Variable-Length Block Codes With Feedback and Cost Constraints
- Title not available (Why is that?)
- Lower bound for ensemble-average error probability for a discrete memoryless channel
- Title not available (Why is that?)
- Lower bounds to error probability for coding on discrete memoryless channels. I
- An isoperimetric theorem for sequences generated by feedback and feedback-codes for unequal error protection
- A new lower bound for the a-mean error of parameter transmission over the white Gaussian channel
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Lower bound for error probability in a discrete memoryless channel with feedback
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q788694)
