New geometrical spectra of linear codes with applications to performance analysis

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.

[1]  A. Mehrabian,et al.  Improved tangential sphere bound on the ML decoding error probability of linear binary block codes in AWGN and block fading channels , 2006 .

[2]  Erik Agrell,et al.  On the Voronoi Neighbor Ratio for Binary Linear Block Codes , 1998, IEEE Trans. Inf. Theory.

[3]  Dariush Divsalar,et al.  Upper bounds to error probabilities of coded systems beyond the cutoff rate , 2003, IEEE Trans. Commun..

[4]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[5]  Robert J. McEliece,et al.  On the BCJR trellis for linear block codes , 1996, IEEE Trans. Inf. Theory.

[6]  Shlomo Shamai,et al.  Performance Analysis of Linear Codes under Maximum-Likelihood Decoding: A Tutorial , 2006, Found. Trends Commun. Inf. Theory.

[7]  Gregory Poltyrev,et al.  Bounds on the decoding error probability of binary linear codes via their spectra , 1994, IEEE Trans. Inf. Theory.

[8]  Johannes Zangl,et al.  Improved tangential sphere bound on the bit-error probability of concatenated codes , 2001, IEEE J. Sel. Areas Commun..

[9]  E.R. Berlekamp,et al.  The technology of error-correcting codes , 1980, Proceedings of the IEEE.

[10]  Amir K. Khandani,et al.  A new upper bound on the ML decoding error probability of linear binary block codes in AWGN interference , 2004, IEEE Transactions on Information Theory.

[11]  Xiao Ma,et al.  New techniques for upper-bounding the MLD performance of binary linear codes , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[12]  Neil J. A. Sloane,et al.  Techniques of Bounding the Probability of Decoding Error for Block Coded Modulation Structures , 1994 .

[13]  Shu Lin,et al.  Evaluation of the Block Error Probability of Block Modulation Codes by the Maximum-Likelihood Decoding for an Awgn Channel , 1993, Proceedings. IEEE International Symposium on Information Theory.