Majority decoding of large repetition codes for the r-ary symmetric channel
A r-ary symmetric channel has as transition probability matrix the r×r matrix qxy=p if x≠y and qxy=1−(r−1)p=q if x=y. Given a set Y of r symbols, the code here consists of r codewords, each one of them is made up of n identical symbols. Whenever q is larger than p, maximum likelihood decoding amounts to find out in the received vector which symbol is repeated most. Thus MLD here reduces to majority decoding.
A generating function for the error probability as well as the probability of decoding failure for the system is obtained. Also recurrence relations are given for computing those probabilities.
The results corresponding to those announced for the r-ary symmetric channel are obtained for the majority decoding repetition codes over r-ary transitive DMC.
Unable to display preview. Download preview PDF.
- W. FELLER: An Introduction to Probability Theory and Its Applications. 1968 John Wiley & Sons.Google Scholar
- D. FOATA, M. SCHÜTZENBERGER: Théorie Géométrique des Polynômes Eulériens. 1970 Lecture Notes in Mathematics # 138 Springer Verlag.Google Scholar
- R.McELIECE: The Theory of information and coding. 1977 Addison-Wesley.Google Scholar
- T. ERICSON: Concatenated Codes — Principles and possibilities-AAECC-4, Karlsruhe 1986.Google Scholar