## Abstract

This paper considers the problem of linear Boolean classification, where the goal is to determine in which set, among two given sets of Boolean vectors, an unknown vector belongs to by making linear queries. Finding the least number of queries is formulated as determining the minimal rank of a matrix over GF(2) whose kernel does not intersect a given set S. In the case where S is a Hamming ball, this reduces to finding linear codes of largest dimension. For a general set S, this is an instance of 'the critical problem' posed by Crapo and Rota in 1970, open in general. 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 an annulus of inner and outer radius nq and np respectively, the optimal relative rank is given by the normalized entropy (1 - q)H(p=(1 - q)), an extension of the Gilbert-Varshamov bound.

Original language | English (US) |
---|---|

Title of host publication | 2014 IEEE International Symposium on Information Theory, ISIT 2014 |

Publisher | Institute of Electrical and Electronics Engineers Inc. |

Pages | 1231-1235 |

Number of pages | 5 |

ISBN (Print) | 9781479951864 |

DOIs | |

State | Published - Jan 1 2014 |

Event | 2014 IEEE International Symposium on Information Theory, ISIT 2014 - Honolulu, HI, United States Duration: Jun 29 2014 → Jul 4 2014 |

### Other

Other | 2014 IEEE International Symposium on Information Theory, ISIT 2014 |
---|---|

Country | United States |

City | Honolulu, HI |

Period | 6/29/14 → 7/4/14 |

## All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics