DocumentCode
659164
Title
New geometrical spectra of linear codes with applications to performance analysis
Author
Xiao Ma ; Jia Liu ; Qiutao Zhuang ; Baoming Bai
Author_Institution
Dept. of Electron. & Commun. Eng., Sun Yat-sen Univ., Guangzhou, China
fYear
2013
fDate
9-13 Sept. 2013
Firstpage
1
Lastpage
5
Abstract
In this paper, new enumerating functions for linear codes are defined, including the triangle enumerating function and the tetrahedron enumerating function, both of which can be computed using a trellis-based algorithm over polynomial rings. The computational complexity is dominated by the complexity of the trellis. In addition, we show that these new enumerating functions can be used to improve existing performance bounds on the maximum likelihood decoding.
Keywords
computational complexity; linear codes; maximum likelihood decoding; polynomials; trellis codes; computational complexity; geometrical spectra; linear code; maximum likelihood decoding; polynomial ring; tetrahedron enumerating function; trellis-based algorithm; triangle enumerating function; Error probability; Linear codes; Maximum likelihood decoding; Upper bound; Vectors;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Workshop (ITW), 2013 IEEE
Conference_Location
Sevilla
Print_ISBN
978-1-4799-1321-3
Type
conf
DOI
10.1109/ITW.2013.6691287
Filename
6691287
Link To Document