Linear-time nearest point algorithms for coxeter lattices

McKilliam, Robby G., Smith, Warren D. and Clarkson, I. Vaughan L. (2010) Linear-time nearest point algorithms for coxeter lattices. IEEE Transactions on Information Theory, 56 3: 1015-1022. doi:10.1109/TIT.2009.2039090

Author McKilliam, Robby G.
Smith, Warren D.
Clarkson, I. Vaughan L.
Title Linear-time nearest point algorithms for coxeter lattices
Journal name IEEE Transactions on Information Theory   Check publisher's open access policy
ISSN 0018-9448
Publication date 2010-03
Sub-type Article (original research)
DOI 10.1109/TIT.2009.2039090
Volume 56
Issue 3
Start page 1015
End page 1022
Total pages 8
Place of publication New York
Publisher I E E E
Collection year 2011
Language eng
Subject 0806 Information Systems
0906 Electrical and Electronic Engineering
Keyword Channel coding
Lattice theory
Nearest point algorithm
Coset Codes
Q-Index Code C1
Q-Index Status Confirmed Code
Institutional Status UQ
Additional Notes Manuscript received March 04, 2009; revised October 02, 2009. Current version published March 10, 2010.

Document type: Journal Article
Sub-type: Article (original research)
Collections: Official 2011 Collection
School of Information Technology and Electrical Engineering Publications
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 9 times in Thomson Reuters Web of Science Article | Citations
Scopus Citation Count Cited 10 times in Scopus Article | Citations
Google Scholar Search Google Scholar
Created: Sun, 28 Mar 2010, 00:05:05 EST