Decoding the ternary \((23, 11, 9)\) quadratic residue code (Q983400)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Decoding the ternary (23, 11, 9) quadratic residue code |
scientific article; zbMATH DE number 5759269
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decoding the ternary \((23, 11, 9)\) quadratic residue code |
scientific article; zbMATH DE number 5759269 |
Statements
Decoding the ternary \((23, 11, 9)\) quadratic residue code (English)
0 references
22 July 2010
0 references
Summary: The algebraic decoding of binary quadratic residue codes can be performed using the Peterson or the Berlekamp-Massey algorithm once certain unknown syndromes are determined or eliminated. The technique of determining unknown syndromes is applied to the nonbinary case to decode the expurgated ternary quadratic residue code of length 23.
0 references
0.9824629426002502
0 references
0.9236166477203368
0 references
0.8733303546905518
0 references
0.8733303546905518
0 references
