Coding theorem for discrete memoryless channels with given decision rule
VB Balakirsky - Workshop on Algebraic Coding, 1991 - Springer
VB Balakirsky
Workshop on Algebraic Coding, 1991•Springer… The maximal transmission rate over binary-input discrete memoryless channel is
calculated when the decoding decision function is fixed in any addi t ice manner. … An
optimization over all possible block codes and all possible decoding rules is produced
during its calculating and the last optimum is achieved when maximum-likelihood decision
function is maximized during decoding procedure. We consider a similar problem when the
channel is defined by input alphabet X, output alphabet Y and transition probabilities W …
calculated when the decoding decision function is fixed in any addi t ice manner. … An
optimization over all possible block codes and all possible decoding rules is produced
during its calculating and the last optimum is achieved when maximum-likelihood decision
function is maximized during decoding procedure. We consider a similar problem when the
channel is defined by input alphabet X, output alphabet Y and transition probabilities W …
Abstract
The maximal transmission rate over binary-input discrete memoryless channel is calculated when the decoding decision function is fixed in any additive manner.
Springer
Showing the best result for this search. See all results