Fast search on the shells of Golay codes (original) (raw)

2010 4th International Symposium on Communications, Control and Signal Processing (ISCCSP), 2010

Abstract

Search algorithms in Golay codebooks are necessary both for maximum likelihood decoding and for vector quantization applications. This work presents algorithms for fast search on shells (set of codewords having the same Hamming weight) of binary Golay codes. The algorithms are based on the Golay codebook projection into a hexacode codebook. Two cases are considered: when the nearest neighbors within each of the shells are simultaneously determined or when they are independently determined.

A. Vasilache hasn't uploaded this paper.

Let A. know you want this paper to be uploaded.

Ask for this paper to be uploaded.