Encoding and decoding of the binary extended (24,12,8) Golay code:
An arithmetic decoding algorithm. It is a very close relative of the error-trapping decoding algorithms developed by Kasami in the 1960s.
The Viterbi algorithm is the same as the binary case with one main difference: The survivor sequences include the uncoded bits, which are decided at each trellis stage when selecting one of two parallel branches with the largest correlation metric.
Presently, only 8-PSK modulation is considered. Extensions to higher-order modulations can be implemented following a similar procedure.
This build is for developing a "binary-to-BCD" converter for use in
// displaying numerals in base-10 so that people can read and interpret the
// numbers more readily than they could if the numbers were displayed in
// binary or hexadecimal format. Also, a "BCD-to-binary" converter is
// tested in this build.
