2014/05/29 by Anna-Lena Trautmann, Trautmann, Anna-Lena, Emanuele Viterbo +1
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1405.7464
To be published in the proceedings of ISITA 2014, IEICE copyright
arxiv created 2014/10/06 · arxiv updated 2014/10/07
In this work we investigate codes in ℤ2mn that can correct errors that occur in just one coordinate of the codeword, with a magnitude of up to a given parameter t. We will show upper bounds on these cross codes, derive constructions for linear codes and respective decoding algorithm. The constructions (and decoding algorithms) are given for length n = 2 and n = 3, but for general m and t.