A decoding algorithm for orthogonal Latin square codes (Q1386815)
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: A decoding algorithm for orthogonal Latin square codes |
scientific article; zbMATH DE number 1157077
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A decoding algorithm for orthogonal Latin square codes |
scientific article; zbMATH DE number 1157077 |
Statements
A decoding algorithm for orthogonal Latin square codes (English)
0 references
6 January 1999
0 references
Let \(p\) be an odd prime. The authors define the orthogonal Latin square code of order \(p\) to be the 2-dimensional subspace of \(GF(p)^{p+1}\) generated by \((1,0,1,2,\dots, p-1)\) and \((1,0,1,1,\dots, 1)\). This code has minimum distance \(p\). The authors present a syndrome decoding algorithm for these codes.
0 references
orthogonal Latin square code
0 references
syndrome decoding algorithm
0 references
