On the generalisation of Sidel'nikov's theorem to q-ary linear codes

DOI10.1017/S0004972719000637MaRDI QIDQ5212972zbMATH OpenOpenAlexFDO

Authors Yilun Wei, Bo Wu, Qijin Wang

Publication date 31 January 2020

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0004972719000637

zbMATH Keywords

estimation\(q\)-ary linear codeSidel'nikov's theorem

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Recommendations

• Identities and approximations for the weight distribution of q-ary codes
• The weight distribution of cosets
• A limit law on the distance distribution of binary codes
• New upper bounds on generalized weights
• An approximation to the weight distribution of binary linear codes

Cites work

• scientific article; zbMATH DE number 3695097 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• Fundamentals of Error-Correcting Codes
• How many weights can a linear code have?
• New classes of \(p\)-ary few weight codes
• On constacyclic codes over \(\mathbb{Z}_4 [u] / \langle u^2 - 1 \rangle\) and their Gray images
• On the remainder term in the central limit theorem
• On two-weight \(\mathbb {Z}_{2^k}\)-codes
• Quasi-twisted codes with constacyclic constituent codes

Cited in

(1)

• On the asymptotic number of non-equivalent \(q\)-ary linear codes.

This page was built for publication: On the generalisation of Sidel'nikov's theorem to \(q\)-ary linear codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5212972)