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

DOI10.1109/TIT.2016.2612654zbMath1359.94707arXiv1503.03394OpenAlexW2963573917MaRDI QIDQ2976397

Johannes Zwanzger, Alfred Wassermann, Michael Kiermaier

Publication date: 28 April 2017

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

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (2)

An updated database of \(\mathbb{Z}_4\) codes and an open problem about quasi-cyclic codes ⋮ Search for combinatorial objects using lattice algorithms -- revisited

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