Threshold Decoding (Q4133522)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3557651
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Threshold Decoding |
scientific article; zbMATH DE number 3557651 |
Statements
Threshold Decoding (English)
0 references
1975
0 references
0.8428100943565369
0 references
0.8052550554275513
0 references
0.7981266379356384
0 references
0.7963261008262634
0 references
The paper is divided into four sections: 1) Threshold decoding of linear codes. 2) Geometric codes. 3. Generalized Reed-Muller codes. 4. Threshold decoding with t-design each followed by a list of references. The first part gives an introduction to the subject and describes one-step and multistep majority decoding with orthogonal and non-orthogonal parity checks. The second section deals with the largest class of threshold-decodable codes, the geometric codes. For this class of codes the decoding rules of Rudolph, Goethals and Delsarte, and Weldon's hybrid decoding are considered. The third section describes the interrelation between geometric codes and generalized Reed-Muller codes. Furthermore, a characterization of these codes in terms of cyclic codes is obtained. Section four, finally, shows by the example of the Golay code how Rudolph's decoding method can be improved by making use of the t-design property of a set of parity checks.
0 references