Decoding q-ary lattices in the Lee metric

@article{Campello2011DecodingQL,
  title={Decoding q-ary lattices in the Lee metric},
  author={Antonio Campello and Grasiele C. Jorge and Sueli I. Rodrigues Costa},
  journal={2011 IEEE Information Theory Workshop},
  year={2011},
  pages={220-224}
}
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. 

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 21 REFERENCES

Complexity of Lattice Problems; A Cryptographic Perspective, The Kluwer International Series in Engineering and Computer Science, vol. 671

  • D. Micciancio, S. Goldwasser
  • 2002
3 Excerpts

Similar Papers

Loading similar papers…