loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Conference on Information Technology: Coding and Computing (ITCC '01)
Analysis of a Bound of Voronoi Region V(C0 ) and Proposal of Sub-Optimum Decoding Algorithm
Las Vegas, NV
April 02-April 04
ISBN: 0-7695-1062-0
Walter Godoy Jr, Centro Federal de Educa??o Tecnol?gica do Paran?
Emilio C.G. Wille, Centro Federal de Educa??o Tecnol?gica do Paran?
Abstract: The objective of this paper is to analyze the bound of addition proposed in [1] in contrast to the GMD bound [2] and the cone bound [3] which shows the Voronoi region of the zero code-word for a specific vector. A new algorithm, which associates the ZNA algorithm [4] with the bound of addition, is proposed for soft decision techniques.
Index Terms:
Error control codes, Error correcting codes: algorithms, Soft decision decoding, Decoding stop rules, Voronoi region.
Citation:
Walter Godoy Jr, Emilio C.G. Wille, "Analysis of a Bound of Voronoi Region V(C0 ) and Proposal of Sub-Optimum Decoding Algorithm," itcc, pp.0690, International Conference on Information Technology: Coding and Computing (ITCC '01), 2001
Usage of this product signifies your acceptance of the Terms of Use.