Latin hypercubes and MDS codes |
| |
Authors: | Edwin Soedarmadji |
| |
Institution: | Department of Electrical Engineering, California Institute of Technology, Pasadena, CA 91125, USA |
| |
Abstract: | Maximum distance separable (MDS) codes have special properties that give them excellent error correcting capabilities. Counting the number of q-ary MDS codes of length n and distance d, denoted by Dq(n,d)MDS, is a very hard problem. This paper shows that for d=2, it amounts to counting the number of (n-1)-dimensional Latin hypercubes of order q. Thus, Dq(3,2)MDS is the number of Latin squares of order q, which is known only for a few values of q. This paper proves constructively that D3(n,2)MDS=6·2n-2. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|