Abstract
The maximal transmission rate over binary-input discrete memoryless channel is calculated when the decoding decision function is fixed in any additive manner.
Preview
Unable to display preview. Download preview PDF.
References
C.E.Shannon A Mathematical Theory of Communication. Bell Syst. Techn.J., 1948, 27, p. 379–423, 623–656.
I.Csiszár, J.Körner Information Theory. Coding Theorems for Discrete Memoryless Systems. Academiai Kiado, Budapest, 1981.
G.C. Clark, J.B. Cain Error-Correction Coding for Digital Communications. Plenum Press, New York and London, 1987.
Goppa V.D. Nonprobabilistic Mutual Information without Memory.-Probl.Control Inform.Theory, 1975, 4, p.97–102.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Balakirsky, V.B. (1992). Coding theorem for discrete memoryless channels with given decision rule. In: Cohen, G., Lobstein, A., Zémor, G., Litsyn, S. (eds) Algebraic Coding. Algebraic Coding 1991. Lecture Notes in Computer Science, vol 573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0034351
Download citation
DOI: https://doi.org/10.1007/BFb0034351
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55130-0
Online ISBN: 978-3-540-46739-7
eBook Packages: Springer Book Archive