Title :
Spherically punctured biorthogonal codes
Author :
Dumer, Ilya ; Kapralova, Olga
Author_Institution :
Dept. of Electr. Eng., Univ. of California at Riverside, Riverside, CA, USA
Abstract :
Consider a binary Reed-Muller code RM(r, m) defined on the full set of binary m-tuples and let this code be punctured to the spherical layer S(b) that includes only m-tuples of a given Hamming weight b. More generally, we can consider punctured RM codes RM(r, m, B) restricted to some set B of several spherical layers S(b), b ϵ B. In this paper we specify this construction for the biorthogonal codes RM(1, m) and the Hadamard codes H(m). It is shown that the overall weight of any code vector in a punctured code H(m, B) is determined by the weight w of its information block. More specifically, this weight depends only on the values of the Krawtchouk polynomials Kbm(w) for all b ϵ B. We further refine our codes by limiting the possible weights w of the input information blocks. As a result, we obtain sequences of codes that meet or closely approach the Griesmer bound.
Keywords :
Hamming codes; Reed-Muller codes; binary codes; orthogonal codes; sequential codes; vectors; Griesmer bound; Hadamard codes; Hamming weight; Krawtchouk polynomial; binary RM code; binary Reed-Muller code; binary m-tuple; code vector; input information block; punctured RM code; sequence code; spherical layer; spherically punctured biorthogonal code; Decoding; Encoding; Error correction; Error correction codes; Hamming weight; Polynomials; Vectors;
Conference_Titel :
Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
978-1-4673-2580-6
Electronic_ISBN :
2157-8095
DOI :
10.1109/ISIT.2012.6283988