Some new results on the minimum length of binary linear codes of dimension nine

DOI10.1109/18.796403zbMath0960.94020OpenAlexW4246636843MaRDI QIDQ4503457

Simonis, Juriaan, Sugi Guritman, Stefan Dodunekov

Publication date: 7 September 2000

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

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

zbMATH Keywords

Reed-Muller codesweight distributionMacWilliams identitiesbinary linear codelength-optimal codesresidual code technique

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (3)

On strongly walk regular graphs, triple sum sets and their codes ⋮ The degree of functions and weights in linear codes. ⋮ The \([46, 9, 20_2\) code is unique]

This page was built for publication: Some new results on the minimum length of binary linear codes of dimension nine