Spectra of linear codes and error probability of decoding
[For the entire collection see Zbl 0745.00062.] Let \(C\) be a linear \([n,k,d]_ q\)-code and \(A_ i\) be the number of codewords of weight \(i\). Let \(d^ \perp\) the dual distance of \(C\). Its spectrum \(\{A_ j\}\) is defined as \(A_ j=A_ j(C)=|\{x\in C: \| x\|=j\}|\). The enumerator is given by \(W_ C(x:y)=\sum^ n_{i=0} A_ i x^{n-i} y^ i=x^ n+\sum^{n-d}_{j=0} B_ j(x- y)^ j y^{n-j}\), where \(B_ i=\sum^{n-i}_{j=d}{n-j\choose i} A_ j\). The main idea of that paper was to redevelop the enumerator \(W_ C(x:y)\) over the basis \(\bigl(x^ j(x-y)^{n-j}\bigr)\) and to estimate the corresponding coefficients \(B_ j\) which have a lucid algebraic- geometric interpretation. Finally, using algebraic-geometric codes and estimates for their spectra the authors ameliorate the Gallager bound [\textit{R. G. Gallager}, ``Information theory and reliable communications (1968; Zbl 0198.522)] in many cases. The details are too involved to be described here.
- Bounds on the decoding error probability of binary linear codes via their spectra
- On spectra of linear codes
- On the relation between the code spectrum and the decoding error probability
- scientific article; zbMATH DE number 1188982
- On the probability of incorrect decoding for linear codes
- scientific article; zbMATH DE number 4033671
- The Decoding Error Probability of Linear Codes Over the Erasure Channel
- Upper bound on the bit error probability of systematic binary linear codes via their weight spectra
- Some spectral techniques in coding theory
- Distance spectra of lattice-based codes
- On the probability of incorrect decoding for linear codes
- Uniform estimate for a spectrum of a linear code
- On spectra of linear codes
- Some spectral techniques in coding theory
- Spectral enumerators for certain additive-error-correcting codes over integer alphabets
- Linear Subcodes of Turbo Codes With Improved Distance Spectra
- Bounds on the decoding error probability of binary linear codes via their spectra
- scientific article; zbMATH DE number 1009721 (Why is no real title available?)
- scientific article; zbMATH DE number 1559531 (Why is no real title available?)
- Estimates of the distance distribution of codes and designs
- scientific article; zbMATH DE number 7274623 (Why is no real title available?)
- Статистические характеристики весовых спектров случайных линейных кодов над $\mathrm{GF}(p)$
- On the relation between the code spectrum and the decoding error probability
- Upper bound on the bit error probability of systematic binary linear codes via their weight spectra
- Asymptotically exact uniform bounds for spectra of cosets of linear codes
This page was built for publication: Spectra of linear codes and error probability of decoding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4027641)
