Asymptotic Normality of Q-Ary Linear Codes

Minjia Shi, Olivier Rioul, Patrick Sole

Research output: Contribution to journalArticlepeer-review

Abstract

Sidel'nikov proved in 1971 that the weight distribution of long binary codes is asymptotically Gaussian. Delsarte sketched in 1975 an extension of this result to Q -ary codes when Q > 2. In this note, we complete Delsarte's proof.

Original languageEnglish
Article number8804213
Pages (from-to)1895-1898
Number of pages4
JournalIEEE Communications Letters
Volume23
Issue number11
DOIs
Publication statusPublished - 1 Nov 2019
Externally publishedYes

Keywords

  • Berry's inequality
  • Linear codes
  • weight distribution

Fingerprint

Dive into the research topics of 'Asymptotic Normality of Q-Ary Linear Codes'. Together they form a unique fingerprint.

Cite this