No label defined (Q4500617)
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 1496422
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1496422 |
Statements
27 August 2000
0 references
error-correcting code
0 references
mutually orthogonal Latin squares
0 references
non-binary codes
0 references
codewords
0 references
0.7331892848014832
0 references
The authors use mutually orthogonal Latin squares to construct non-binary codes that can correct more errors. The main theorem is the following: Any \(t\) mutually orthogonal Latin squares of order \(s\) yield a \([t/2]\)-error correcting code with \(s^2\) codewords of length \(t+2\) over the alphabet \(\{0,1,\dots, s-1\}\) for \(1\leq t\leq s-1\). For example, when \(s=9\) (a prime power), there exist 8 mutually orthogonal Latin squares of order 9, and hence a 4-error correcting 9-ary code is provided by 81 codewords of length 10.
0 references
