Keywords
Decoding methodsList decodingComputer scienceSequential decodingAlgorithmConcatenated error correction codeLinear codeSymbol (formal)Symbol rateSerial concatenated convolutional codesMathematicsBit error rateBlock codeArithmetic
Related Publications
Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
The general problem of estimating the a posteriori probabilities of the states and transitions of a Markov source observed through a discrete memoryless channel is considered. T...
Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
The probability of error in decoding an optimal convolutional code transmitted over a memoryless channel is bounded from above and below as a function of the constraint length o...
Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1
A new class of convolutional codes called turbo-codes, whose performances in terms of bit error rate (BER) are close to the Shannon limit, is discussed. The turbo-code encoder i...
Expander codes
Using expander graphs, we construct a new family of asymptotically good, linear error-correcting codes. These codes have linear time sequential decoding algorithms and logarithm...
A recursive approach to low complexity codes
A method is described for constructing long error-correcting codes from one or more shorter error-correcting codes, referred to as subcodes, and a bipartite graph. A graph is sh...
Publication Info
- Year
- 1974
- Type
- article
- Volume
- 20
- Issue
- 2
- Pages
- 284-287
- Citations
- 4675
- Access
- Closed
External Links
Citation Metrics
4675
OpenAlex
Cite This
L.R. Bahl
(1974).
Optimal decoding of linear codes for minimizing symbol error rate.
IEEE Transactions on Information Theory
, 20
(2)
, 284-287.