Decoding q-ary lattices in the Lee metric
Information Theory
2012-04-18 v4 Combinatorics
math.IT
Abstract
q-ary lattices can be obtained from q-ary codes using the so-called Construction A. We investigate these lattices in the Lee metric and show how their decoding process can be related to the associated codes. For prime q we derive a Lee sphere decoding algorithm for q-ary lattices, present a brief discussion on its complexity and some comparisons with the classic sphere decoding.
Cite
@article{arxiv.1105.5557,
title = {Decoding q-ary lattices in the Lee metric},
author = {Antonio Campello and Grasiele C. Jorge and Sueli I. R. Costa},
journal= {arXiv preprint arXiv:1105.5557},
year = {2012}
}
Comments
5 pages, 4 figures. Presented at the 2012 Information Theory Workshop (ITW)