On the Optimum Distance Profiles About Linear Block Codes

DOI10.1109/TIT.2009.2039059MaRDI QIDQ5281563zbMATH OpenOpenAlexFDO

Authors Yuan Luo, A. J. Han Vinck, Yanling Chen

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.2009.2039059

Mathematics Subject Classification ID

Combinatorial codes (94B25) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Cited in

(5)

• On the relative profiles of a linear code and a subcode
• Optimal subcodes and optimum distance profiles of self-dual codes
• 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
• Improving bounds on the minimum Euclidean distance for block codes by inner distance measure optimization

This page was built for publication: On the Optimum Distance Profiles About Linear Block Codes

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