Skip to Main content Skip to Navigation
Journal articles

Asymptotic Normality of Q-ary Linear Codes

Minjia Shi 1 Olivier Rioul 2, 3 Patrick Solé 4, 5
1 Anhui University [Hefei]
2 COMNUM - Communications Numériques
LTCI - Laboratoire Traitement et Communication de l'Information
3 COMELEC - Département Communications & Electronique
4 I2M - Institut de Mathématiques de Marseille
5 CNRS - Centre National de la Recherche Scientifique
Abstract : Sidel’nikov proved in 1971 that the weight distribution of long binary codes is asymptotically Gaus- sian. Delsarte sketched in 1975 an extension of this result to Q-ary codes when Q > 2. In this note, we complete Delsarte’s proof.
Document type :
Journal articles
Complete list of metadata
https://hal.telecom-paris.fr/hal-02300794
Contributor : Olivier Rioul Connect in order to contact the contributor
Submitted on : Saturday, August 28, 2021 - 2:51:40 PM
Last modification on : Tuesday, October 19, 2021 - 10:49:40 PM

File

Vignette du document
08804213 cropped.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02300794, version 1

Collections

IP_PARIS | TDS-MACS | COMNUM | COMELEC | INSTITUT-TELECOM | UNIV-AMU | CNRS | LTCI | INSMI | I2M | I2M-2014- | EC-MARSEILLE

Citation

Minjia Shi, Olivier Rioul, Patrick Solé. Asymptotic Normality of Q-ary Linear Codes. IEEE Communications Letters, Institute of Electrical and Electronics Engineers, 2019, 23 (11), pp.1895-1898. ⟨hal-02300794⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

218

Files downloads

36