A converse coding theorem for mismatched decoding at the output of binary-input memoryless channels

@article{Balakirsky1995ACC,
  title={A converse coding theorem for mismatched decoding at the output of binary-input memoryless channels},
  author={Vladimir B. Balakirsky},
  journal={IEEE Trans. Information Theory},
  year={1995},
  volume={41},
  pages={1889-1902}
}
An upper bound on the maximal transmission rate over binary-input memoryless channels, provided that the decoding decision rule is given, is derived. If the decision rule is equivalent to the maximum likelihood decoding (matched decoding), then the bound coincides with the channel capacity. Otherwise (mismatched decoding), it coincides with a known lower bound. 
Highly Cited
This paper has 57 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
Showing 1-10 of 30 extracted citations

Converse Theorems for the DMC With Mismatched Decoding

IEEE Transactions on Information Theory • 2018
View 2 Excerpts

A General Formula for the Mismatch Capacity

IEEE Transactions on Information Theory • 2014
View 1 Excerpt

57 Citations

051015'95'00'06'12'18
Citations per Year
Semantic Scholar estimates that this publication has 57 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Channel capacity for a given decoding rule

I Csiszz, P Narayan
IEEE Trans. Inform. Theory • 1995

Information rates for mismatched decoders

A Lapidoth
Proc. 2-nd Winter Meeting on Coding and Information Theory • 1993

Information Theory: Coding Theorems for Discrete Memoryless Systems

J Csiszz Ar, Kk Orner
Information Theory: Coding Theorems for Discrete Memoryless Systems • 1981

Similar Papers

Loading similar papers…