A decoding algorithm for orthogonal Latin square codes

MaRDI QIDQ1386815zbMATH OpenFDO

Authors D. Massart, Sang Geun Hahn, Dahn-Goon Kim, Y. S. Kim

Publication date 6 January 1999

Published in Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

orthogonal Latin square codesyndrome decoding algorithm

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Linear codes (general theory) (94B05) Decoding (94B35)

Review text

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.

This page was built for publication: A decoding algorithm for orthogonal Latin square codes

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