scientific article; zbMATH DE number 1496422

MaRDI QIDQ4500617zbMATH OpenFDO

Authors Satoru Kadowaki, Miho Kimura, Yasuko Yanagida, Sanpei Kageyama

Publication date 27 August 2000

zbMATH Keywords

codewordserror-correcting codemutually orthogonal Latin squaresnon-binary codes

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Other types of codes (94B60)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 1890839
• scientific article; zbMATH DE number 16254
• Constructions of nonbinary codes correcting t-symmetric errors and detecting all unidirectional errors: magnitude error criterion
• scientific article; zbMATH DE number 994588

Cited in

(3)

• A decoding algorithm for orthogonal Latin square codes
• scientific article; zbMATH DE number 1890839 (Why is no real title available?)
• Error Correcting Codes from Quasi-Hadamard Matrices

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4500617)