New Upper Bounds on Binary Linear Codes and a {\mathbb Z}_{4} -Code With a Better-Than-Linear Gray Image

DOI10.1109/TIT.2016.2612654zbMATH Open1359.94707arXiv1503.03394OpenAlexW2963573917MaRDI QIDQ2976397FDOQ2976397

Johannes Zwanzger, Alfred Wassermann, Michael Kiermaier

Publication date: 28 April 2017

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

Abstract: Using integer linear programming and table-lookups we prove that there is no binary linear $[1988,12,992]$ code. As a by-product, the non-existence of binary linear codes with the parameters $[324,10,160]$, $[356,10,176]$, $[772,11,384]$, and $[836,11,416]$ is shown. Our work is motivated by the recent construction of the extended dualized Kerdock code $hat{mathcalK}_6^{*}$, which is a $mathbb{Z}_4$-linear code having a non-linear binary Gray image with the parameters $(1988,2^{12},992)$. By our result, the code $hat{mathcalK}_6^{*}$ can be added to the small list of $mathbb{Z}_4$-codes for which it is known that the Gray image is better than any binary linear code.

Full work available at URL: https://arxiv.org/abs/1503.03394

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited In (4)

• Search for combinatorial objects using lattice algorithms -- revisited
• Title not available (Why is that?)
• There is No Self-Dual $ \BBZ _{4}$-Linear Code Whose Gray Image Has the Parameters $(72,2^{36},16)$
• An updated database of \(\mathbb{Z}_4\) codes and an open problem about quasi-cyclic codes

This page was built for publication: New Upper Bounds on Binary Linear Codes and a $ {\mathbb Z}_{4}$ -Code With a Better-Than-Linear Gray Image

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