Abstract
A simple method is proposed for the calculation of moments of the weight function of a random linear code. Applying this method we compute the exact expression for the third-order covariance of the weight function. The results are also extended to random coset codes.
Similar content being viewed by others
References
Blinovsky V.: A lower bound on the number of words of a linear code in an arbitrary sphere with given radius in \({\mathbb{F}^n_q}\). Problemy Peredachi Informatsii (Russian) 23(2), 50–53 (1987)
Blinovsky V.: Asymptotic Combinatorial Coding Theory. Kluwer, Boston (1997)
Blinovsky V.: A uniform estimate for the spectrum of a linear code. Problemy Peredachi Informatsii (Russian) 37(3), 3–5 (2001)
Cohen G., Honkala I., Litsyn S., Lobstein A.: Covering Codes. Elsevier, Amsterdam (1997)
Dobrushin R.L.: Asymptotic optimality of group and systematic codes for some channels. Theory Probab. Appl. 8, 52–66 (1963)
Gallager R.G.: Low-Density Parity-Check Codes. MIT Press, Cambridge, MA (1963)
Kløve T.: Codes for Error Detection. World Scientific, Singapore (2007)
Landau H.J.: Classical background on the moment problem. In: Landau H.J. (ed.) Moments in Mathematics. Proc. Sympos. Appl. Math., Amer. Math. Soc., Providence, RI. Series III, vol. 37, pp. 1–15 (1987).
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by J.D. Key.
Rights and permissions
About this article
Cite this article
Blinovsky, V., Erez, U. & Litsyn, S. Weight distribution moments of random linear/coset codes. Des. Codes Cryptogr. 57, 127–138 (2010). https://doi.org/10.1007/s10623-009-9356-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-009-9356-1