Abstract
This is another in a series of invited tutorial, status and survey papers that are being regularly solicited by the PTGIT Committee on Special Papers. We invited Profess01 Fano to commit to paprr his elegant but, unelaborate explanation of the principles of sequential decoding, a scheme which is currently contending for a position as the most practical implementation to dale of Shannon’s theory of noisy communication channels. -&e&l Pcqwrs Committw.
Keywords
Decoding methodsComputer scienceCommitProbabilistic logicList decodingHeuristicTheoretical computer scienceSequential decodingFano planeAlgorithmScheme (mathematics)Artificial intelligenceMathematicsConcatenated error correction codeDatabase
Related Publications
Deep and Wide: Multiple Layers in Automatic Speech Recognition
This paper reviews a line of research carried out over the last decade in speech recognition assisted by discriminatively trained, feedforward networks. The particular focus is ...
Low-density parity-check codes
A low-density parity-check code is a code specified by a parity-check matrix with the following properties: each column contains a small fixed number <tex xmlns:mml="http://www....
Publication Info
- Year
- 1963
- Type
- article
- Volume
- 9
- Issue
- 2
- Pages
- 64-74
- Citations
- 493
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
493
OpenAlex
Cite This
Robert M. Fano
(1963).
A heuristic discussion of probabilistic decoding.
IEEE Transactions on Information Theory
, 9
(2)
, 64-74.
https://doi.org/10.1109/tit.1963.1057827
Identifiers
- DOI
- 10.1109/tit.1963.1057827