IEEE Transactions on Information Theory · 1986 · 38 citations · 8 references
EngineeringComputer EngineeringComputer ScienceAlgorithmsCryptographyInformation TheoryChannel CodingCoding TheoryError Control CodingError DetectionError-correcting CodesBch CodesDecoding AlgorithmsGolay CodesLinear CodesMinimum DistanceParity Check CodesQuadratic Residue CodesSoft-decision Decoding
A decoding algorithm for linear codes that uses the minimum weight words of the dual code as parity checks is defined. This algorithm is able to correct beyond the half minimum distance and has the capability of including soft-decision decoding. Results on applying this algorithm to quadratic residue (QR) codes, BCH codes, and the Golay codes (with and without soft-decision decoding) are presented.
8
J. J. Stiffler · 1971 · 1.4K citations
On the Golay perfect binary code
J.-M. Goethals · Journal of Combinatorial Theory Series A · 1971 · 44 citations