Heuristic Algorithms for Constructing Binary Constant Weight Codes

DOI10.1109/TIT.2009.2027491zbMath1367.94375OpenAlexW2129888958MaRDI QIDQ4974024

Derek H. Smith, Roberto Montemanni

Publication date: 8 August 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.2027491

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (6)

New lower bounds for the Shannon capacity of odd cycles ⋮ Permutation codes with specified packing radius ⋮ New constant weight codes and packing numbers ⋮ New Lower Bounds for Binary Constant-Dimension Subspace Codes ⋮ Оценки объемов окрестностей двоичных кодов в терминах их весовых спектров ⋮ A new table of permutation codes

This page was built for publication: Heuristic Algorithms for Constructing Binary Constant Weight Codes