## Abstract

The lattice A(n)* is an important lattice because of its covering properties in low dimensions. Two algorithms exist in the literature that compute the nearest point in the lattice A(n)*, in O(n log n) arithmetic operations. In this paper we describe a new algorithm that requires only O(n) operations. The new algorithm makes use of an approximate sorting procedure called a bucket sort. This is the fastest known nearest point algorithm for this lattice.

Original language | English |
---|---|

Title of host publication | 2008 international symposium on information theory and its applications |

Place of Publication | Piscataway, NJ |

Publisher | Institute of Electrical and Electronics Engineers (IEEE) |

Number of pages | 5 |

ISBN (Print) | 9781424420681 |

DOIs | |

Publication status | Published - 2008 |

Event | International Symposium on Information Theory and Its Applications - Auckland, New Zealand Duration: 7 Dec 2008 → 10 Dec 2008 |

### Conference

Conference | International Symposium on Information Theory and Its Applications |
---|---|

Country | New Zealand |

City | Auckland |

Period | 7/12/08 → 10/12/08 |