A Lower Bound on the Optimum Distance Profiles of the Second-Order Reed–Muller Codes

DOI10.1109/TIT.2010.2054512zbMATH Open1366.94755OpenAlexW2152302029MaRDI QIDQ5281292FDOQ5281292

Authors: Yanling Chen, A. J. Han Vinck 

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2010.2054512

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Cited In (6)

• The weight distributions of a class of cyclic codes with three nonzeros over \(\mathbb{F}_3\)
• Optimal subcodes and optimum distance profiles of self-dual codes
• Construction of two- or three-weight binary linear codes from Vasil'ev codes
• The weight distributions of some cyclic codes with three or four nonzeros over \(\mathbb F_3\)
• On the bounds and achievability about the ODPC of \(\mathrm{GRM}(2,m)^*\) over prime fields for increasing message length
• Optimal subcodes of formally self-dual codes and their optimum distance profiles

This page was built for publication: A Lower Bound on the Optimum Distance Profiles of the Second-Order Reed–Muller Codes

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