Book ChapterDOI
Majority Decoding of Large Repetition Codes for the R-Ary Symmetric Channel
Reads0
Chats0
TLDR
A r-ary symmetric channel has as transition probability matrix the r×r matrix qxy=p if x≠y andqxy=1−(r−1)p=q if x=y, and MLD here reduces to majority decoding.Abstract:
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.read more
References
More filters
Journal ArticleDOI
An Introduction to Probability Theory and Its Applications
David A. Freedman,William Feller +1 more
Book
The theory of information and coding
TL;DR: In this paper, the authors present a survey of advanced topics for part I and a survey for part II of a survey on the Gaussian channel and the source coding theorem, including linear codes, BCH Goppa codes, and variable-length source coding.