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

DOI10.1017/S0004972719000637zbMATH Open1434.94093OpenAlexW2947625388MaRDI QIDQ5212972FDOQ5212972

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cites Work

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

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)