On the Optimum Distance Profiles About Linear Block Codes

DOI10.1109/TIT.2009.2039059zbMath1366.94668OpenAlexW2107219662MaRDI QIDQ5281563

Yanling Chen, Yuan Luo, 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.2009.2039059

Mathematics Subject Classification ID

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

Related Items (4)

Optimal subcodes of formally self-dual codes and their optimum distance profiles ⋮ Optimal subcodes and optimum distance profiles of self-dual codes ⋮ On the relative profiles of a linear code and a subcode ⋮ On the bounds and achievability about the ODPC of \(\mathrm{GRM}(2,m)^*\) over prime fields for increasing message length

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