Linear Boolean Classification, Coding and the Critical Problem

DOI10.1109/TIT.2016.2531085MaRDI QIDQ2976887zbMATH OpenFDO

Authors Emmanuel Abbe, Noga Alon, Afonso S. Bandeira, Colin Sandon

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/1401.6528

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Abstract: The problem of constructing a minimal rank matrix over GF(2) whose kernel does not intersect a given set S is considered. In the case where S is a Hamming ball centered at 0, this is equivalent to finding linear codes of largest dimension. For a general set, this is an instance of "the critical problem" posed by Crapo and Rota in 1970. This work focuses on the case where S is an annulus. As opposed to balls, it is shown that an optimal kernel is composed not only of dense but also of sparse vectors, and the optimal mixture is identified in various cases. These findings corroborate a proposed conjecture that for annulus of inner and outer radius nq and np respectively, the optimal relative rank is given by (1-q)H(p/(1-q)), an extension of the Gilbert-Varshamov bound H(p) conjectured for Hamming balls of radius np.

Cited in

(2)

• Critical problem for codes over finite chain rings
• On the linear classification of even and odd permutation matrices and the complexity of computing the permanent

This page was built for publication: Linear Boolean Classification, Coding and the Critical Problem

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